arXiv:2604.13812 · v2
AlphaCNOT: Learning CNOT Minimization with Model-Based Planning
摘要
Quantum circuit optimization is a central task in quantum computing, as current NISQ devices suffer from error propagation that often scales with the number of operations. Among quantum operations, the CNOT gate is of fundamental importance, being the only two-qubit gate in the universal Clifford+T set. Minimizing CNOT gates is therefore particularly important, as these gates exhibit higher error rates and they typically introduce additional routing overhead due to hardware constraints. The problem of CNOT gate minimization has been addressed by heuristic algorithms such as the well-known Patel-Markov-Hayes (PMH) for linear reversible synthesis (i.e., CNOT minimization with no topological constraints), and more recently by Reinforcement Learning (RL) based strategies in the more complex case of topology-aware synthesis, where each CNOT can act on a subset of qubit pairs. We introduce AlphaCNOT, an RL framework based on Monte Carlo Tree Search that effectively addresses the CNOT minimization problem by modeling it as a planning problem. In contrast to other RL-based solutions, our method is model-based, i.e., it can leverage lookahead search to evaluate future trajectories, thus finding more efficient sequences of CNOTs. Our method achieves a reduction of up to 24.62% in CNOT count compared with the PMH baseline on linear reversible synthesis, and a consistent gate count reduction on different topologies with up to 8 qubits, also with respect to state-of-the-art RL-based solutions. Our results suggest the combination of RL with search-based strategies can be applied to different circuit optimization tasks, thus fostering the transition toward the "quantum utility" era.
作者备注：35 pages, 12 figures , journal. New Updates - Results: new experiments on permutation-free synthesis, phase polynomials application, more detailed ablation study. Small changes in Abstract, Related Work and Method. Introduction, conclusion unchanged