AI-Assisted Discovery of CNOT Decompositions for Quantum Permutations on Constrained Topologies
Efficient quantum circuit compilation is challenging for quantum computers, where limited qubit connectivity can introduce substantial overhead in the implementation of logical operations. Recent AI-assisted synthesis methods have shown considerable potential for reducing circuit complexity, but their role in uncovering principles that can guide the design of new deterministic compilation algorithms remains largely unexplored. In this work, we investigate this perspective for the synthesis of quantum permutations into CNOT circuits under constrained qubit connectivity. Using AlphaCNOT as an exploratory tool, we identify a recurring decomposition for remote transpositions that improves on ...
| Authors | Daniele Lizzio Bosco, Jacopo Cossio, Simone Faro et al. |
|---|---|
| Primary category | cs.AI |
| Published | 27 October 2026 |
| Last updated at source | 27 October 2026 |
Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 28 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.