Metraipolis › archive › dc_8fe7cb0415ac
AlphaClifford: Efficient Clifford Synthesis and Transpilation with Model-based RL — arXiv:2608.18946
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.18946
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T13:45:28.308Z
- SHA-256 of the archived text
bbee2c202506acf4b86a243fbcab8074c6fb398844ecaea70be927f24bacc971- Stable URL of this page
https://metraipolis.com/documento/dc_8fe7cb0415ac
How to cite
AlphaClifford: Efficient Clifford Synthesis and Transpilation with Model-based RL — arXiv:2608.18946 — arXiv (en), https://arxiv.org/abs/2608.18946 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_8fe7cb0415ac (Metraipolis archive dc_8fe7cb0415ac, sha256 bbee2c202506acf4b86a243fbcab8074c6fb398844ecaea70be927f24bacc971)
BibTeX
@misc{dc8fe7cb0415ac,
title = {AlphaClifford: Efficient Clifford Synthesis and Transpilation with Model-based RL — arXiv:2608.18946},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.18946},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_8fe7cb0415ac; sha256 bbee2c202506acf4b86a243fbcab8074c6fb398844ecaea70be927f24bacc971},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.18946. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Clifford circuits play a foundational role in quantum computing, particularly due to their importance in quantum error correction and fault-tolerant logical synthesis. While these circuits can be efficiently simulated and represented as symplectic matrices, standard synthesis methods-such as the Aaronson-Gottesman algorithm-often yield sub-optimal circuits with excessively high gate counts. In this work, we introduce AlphaClifford, a model-based Reinforcement Learning framework powered by Monte Carlo Tree Search, designed to efficiently synthesize Clifford circuits from the fundamental gate set composed of H, S, and CNOT. By modeling the state space through the algebraic properties of the symplectic group, AlphaClifford effectively explores this combinatorial space to minimize overall circuit cost. For unconstrained Clifford optimization, our approach achieves a consistent reduction in both total and two-qubit (CNOT) gate counts compared to state-of-the-art synthesis heuristics, despite operating with a strictly less expressive gate set. Furthermore, we demonstrate the broad applicability of our framework on two additional tasks: hardware-constrained Clifford transpilation, where we outperform existing RL-based compilers, and as a post-synthesis optimization component within a full Clifford+T logical synthesis pipeline. Our results underscore that model-based RL is highly effective at addressing the combinatorial complexities of quantum compilation, offering a scalable pathway to mitigate hardware constraints in both near-term and future fault-tolerant quantum devices. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-20 in cs.AI). Categorie arXiv: Quantum Physics (quant-ph) ; Artificial Intelligence (cs.AI). Pagina del lavoro: https://arxiv.org/abs/2608.18946 — 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-18T13:41:17.988Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-08-20?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).