High Precision Fault-Tolerant Quantum Circuit Synthesis by Diagonalization using Reinforcement Learning (2409.00433v3)

Abstract: Resource efficient and high precision compilation of programs into quantum circuits expressed in Fault-Tolerant gate sets, such as the Clifford+T gate set, is vital for the success of quantum computing. Optimal analytical compilation methods are known for restricted classes of unitaries, otherwise the problem is intractable. Empirical search-based synthesis methods, including Reinforcement Learning and simulated annealing, can generate good implementations for a more extensive set of unitaries, but require trade-offs in approximation precision and resource use. We leverage search-based methods to reduce the general unitary synthesis problem to one of synthesizing diagonal unitaries; a problem solvable efficiently in general and optimally in the single-qubit case. We demonstrate how our approach improves the implementation precision attainable by Fault-Tolerant synthesis algorithms on an array of unitaries taken from real quantum algorithms. On these benchmarks, many of which cannot be handled by existing approaches, we observe an average of 95% fewer resource-intensive non-Clifford gates compared to the more general Quantum Shannon Decomposition. On a subset of algorithms of interest for future term applications, diagonalization can reduce T gate counts by up to 16.8% compared to other methods.