Metraipolis › archive › dc_5d30e8ed5ec6
Quantum circuit optimization using deep reinforcement learning: Applications across multiple gate sets — arXiv:2608.19103
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.19103
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T14:12:56.238Z
- SHA-256 of the archived text
2759dda8da0a611e1ab4aa67c6467eb234b3c6ebb24095a50011b13bc4230323- Stable URL of this page
https://metraipolis.com/documento/dc_5d30e8ed5ec6
How to cite
Quantum circuit optimization using deep reinforcement learning: Applications across multiple gate sets — arXiv:2608.19103 — arXiv (en), https://arxiv.org/abs/2608.19103 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_5d30e8ed5ec6 (Metraipolis archive dc_5d30e8ed5ec6, sha256 2759dda8da0a611e1ab4aa67c6467eb234b3c6ebb24095a50011b13bc4230323)
BibTeX
@misc{dc5d30e8ed5ec6,
title = {Quantum circuit optimization using deep reinforcement learning: Applications across multiple gate sets — arXiv:2608.19103},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.19103},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_5d30e8ed5ec6; sha256 2759dda8da0a611e1ab4aa67c6467eb234b3c6ebb24095a50011b13bc4230323},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.19103. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The practical implementation of quantum algorithms on noisy intermediate-scale quantum devices encounters operational limitations due to decoherence and other sources of noise inherent in real hardware. To mitigate these errors while preserving the original functionality of the algorithm, shorter quantum circuits are therefore preferred. This motivates the development of effective quantum circuit optimization algorithms. Learning-based approaches have emerged as a leading candidate, yet existing autonomous agents remain inefficient, spending most of their training capacity rediscovering elementary reductions that deterministic rule-based methods already handle reliably. To address this challenge, we propose a reinforcement learning framework that embeds a deterministic Commutation-and-Reduction (CR) algorithm directly into the training environment. After every agent action, the CR algorithm automatically resolves elementary commutations and cancellations, enabling the agent to focus its learning capacity on the non-trivial optimizations where reinforcement learning adds real value. Empirical evaluation across two gate sets, the universal Clifford+T basis and the CNOT+Pauli basis, shows that RL+CR produces shorter circuits than a standard RL agent at all tested scales. We demonstrate that RL trained on smaller quantum circuits can be applied to larger quantum circuits. On 20-qubit Clifford+T circuits, five times larger than the training circuits, RL+CR removes twice as many gates as standard RL. This work provides a robust approach that could accelerate the compilation and optimization processes for future fault-tolerant and utility-scale quantum systems. Tema degli esploratori: fisica e astronomia (retro-catalogo arXiv: annunci del 2026-08-20 in quant-ph). Categorie arXiv: Quantum Physics (quant-ph). Pagina del lavoro: https://arxiv.org/abs/2608.19103 — 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-18T14:10:23.830Z dalla pagina https://arxiv.org/catchup/quant-ph/2026-08-20?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).