Metraipolis › archive › dc_ce12abc5aa0f

Generative Replay Mitigates Sample Starvation in Quantum Architecture Search — arXiv:2609.11248

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.11248
License (as archived)
CC0-1.0
Archived
2026-10-16T05:26:55.247Z
SHA-256 of the archived text
7bc16e1b95a729a03e2896847d22e919f738dfea4c67f5a49a50a2573f19bda1
Stable URL of this page
https://metraipolis.com/documento/dc_ce12abc5aa0f

How to cite

Generative Replay Mitigates Sample Starvation in Quantum Architecture Search — arXiv:2609.11248 — arXiv (en), https://arxiv.org/abs/2609.11248 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ce12abc5aa0f (Metraipolis archive dc_ce12abc5aa0f, sha256 7bc16e1b95a729a03e2896847d22e919f738dfea4c67f5a49a50a2573f19bda1)
BibTeX
@misc{dcce12abc5aa0f,
  title = {Generative Replay Mitigates Sample Starvation in Quantum Architecture Search — arXiv:2609.11248},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.11248},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ce12abc5aa0f; sha256 7bc16e1b95a729a03e2896847d22e919f738dfea4c67f5a49a50a2573f19bda1},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.11248. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Reinforcement learning (RL) can automate quantum architecture search, but its scalability is limited when useful circuit trajectories become rare in the rapidly expanding search space. Existing replay mechanisms reuse observed transitions; the proposed learned model produces additional predicted one step transitions from real state-action seeds. Here we introduce GenQAS, a tensor network-guided RL framework that combines a fixed matrix product state warm-start with prioritized generative replay. A learned local transition model generates synthetic circuit transitions on demand and mixes them with real experience during Double Deep Q-Network updates. Under a random exploration analysis, near ground state circuits occupy a rapidly shrinking region of the accessible state space. We investigate whether real data anchored synthetic replay can improve the effective training signal in this regime. Across chemical Hamiltonian benchmarks from 6 to 12 qubits, GenQAS improves fixed-budget success probability and identifies compact circuits at competitive energy error. At 12 qubits, it improves final success probability by up to $7.0\times$ over passive replay. On a 15-qubit transverse field Ising model, GenQAS increases success probability from $12\%$ to $21\%$. In a noisy 6-qubit BeH$_2$ transfer experiment, generative replay reduces the steps to chemical accuracy by $92.7\%$. These results show that generative replay can mitigate sample starvation in quantum architecture search and support more resource efficient circuit discovery.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-11 in cs.AI).
Categorie arXiv: Quantum Physics (quant-ph) ; Artificial Intelligence (cs.AI); Emerging Technologies (cs.ET); Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2609.11248 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T05:17:52.138Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).