arXiv AI

DreamQAS: Learning a Decision-Useful World Model for VQE-Efficient Quantum Architecture Search

arXiv:2607. 29491v1 Announce Type: cross Abstract: Reinforcement-learning-based quantum architecture search (RL-QAS) repeatedly optimizes a variational quantum eigensolver (VQE) after extending a circuit, although circuit construction and action legality are deterministic and known.

Hugging Face Trending Papers
Sep 10

Generative Replay Mitigates Sample Starvation in Quantum Architecture Search

The paper introduces GenQAS, a tensor‑network‑guided reinforcement learning framework that uses a learned local transition model to generate synthetic circuit transitions for prioritized generative replay. By mixing these synthetic transitions with real experience during Double Deep Q‑Network updates, GenQAS addresses sample starvation in quantum architecture search. Experiments on chemical Hamiltonian benchmarks up to 12 qubits and a 15‑qubit Ising model show significant improvements in success probability and circuit compactness, while a noisy 6‑qubit BeH₂ transfer experiment demonstrates a 92.7% reduction in steps to chemical accuracy.

arXiv Machine Learning
Sep 11

Generative Replay Mitigates Sample Starvation in Quantum Architecture Search

The paper introduces GenQAS, a tensor network‑guided reinforcement learning framework that uses a learned local transition model to generate synthetic circuit transitions for prioritized generative replay. By mixing these synthetic transitions with real experience during Double Deep Q‑Network updates, GenQAS addresses sample starvation in quantum architecture search. Across benchmarks ranging from 6 to 15 qubits, the method improves success probabilities, identifies compact circuits, and reduces steps to chemical accuracy by up to 92.7%.

By Akash Kundu, Amit Kumar Jaiswal, Sebastian Feld, Prayag Tiwari
arXiv AI
Sep 17

APGEM: Adaptive Policy-Guided Error Mitigation for Quantum Reinforcement Learning on a Real-World CVRP Case Study

The paper introduces APGEM, an adaptive controller that dynamically selects among four error‑mitigation techniques—Zero‑Noise Extrapolation, Probabilistic Error Cancellation, Clifford Data Regression, and Readout Error Mitigation—based on a utility function and Q‑learning scores. Applied to a realistic Delhi‑based Capacitated Vehicle Routing Problem, the adaptive approach improves the quantum reinforcement learning agent’s approximation ratios from 0.84‑0.87 to 0.92‑0.94 under high noise, outperforming constructive heuristics and approaching metaheuristics. The controller’s strategy shifts from a Clifford‑data‑regression‑heavy regime early in training to a balanced use of all techniques as training progresses, demonstrating regime‑dependent selection.

By Shabir Ahmad Sofi, Bisma Majid, Mir Mohammad Yousuf
arXiv Machine Learning
Jul 1

Quantum Bayesian Networks Can Speed up Reinforcement Learning in Partially Observable Environments

arXiv:2507. 18606v2 Announce Type: replace-cross Abstract: Reinforcement learning (RL) provides a principled framework for decision-making in partially observable environments, which can be modeled as Markov decision processes and compactly represented through dynamic decision Bayesian networks.

By Gilberto Cunha, Alexandra Ram\^oa, Andr\'e Sequeira, Michael de Oliveira, Lu\'is Barbosa
arXiv AI
Jul 22

Robust Belief-State Policy Learning for Quantum Network Routing Under Decoherence and Time-Varying Conditions

arXiv:2509. 08654v2 Announce Type: replace-cross Abstract: Quantum network routing requires online decisions under probabilistic entanglement generation, finite quantum memories, decoherence, imperfect operations, and classical feedback, while the controller has incomplete knowledge of the physical state.

By Amirhossein Taherpour, Abbas Taherpour, Tamer Khattab, Mazen Hasna