High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization

Abstract

Resource-efficient and high-precision approximate synthesis of quantum circuits expressed in the Clifford+T gate set is vital for Fault-Tolerant quantum computing. Efficient optimal methods are known for single-qubit RZ unitaries, otherwise the problem is generally intractable. Search-based methods, like simulated annealing, empirically generate low resource cost approximate implementations of general multi-qubit unitaries so long as low precision (Hilbert-Schmidt distances of e>10^-2) can be tolerated. These algorithms build up circuits that directly invert target unitaries. We instead leverage search-based methods to first approximately diagonalize a unitary, then perform the inversion analytically. This lets difficult continuous rotations be bypassed and handled in a post-processing step. Our approach improves both the implementation precision and run time of synthesis algorithms by orders of magnitude when evaluated on unitaries from real quantum algorithms. On benchmarks previously synthesizable only with analytical techniques like the Quantum Shannon Decomposition, diagonalization uses an average of 95% fewer non-Clifford gates.

In Proceedings QPL 2025, arXiv:2508.13619

References in corpus (23)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Surface codes: Towards practical large-scale quantum computation
• Logical quantum processor based on reconfigurable atom arrays
• Quantum error correction below the surface code threshold
• Synthesis of Quantum Logic Circuits
• A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
• Restrictions on Transversal Encoded Quantum Gate Sets
• t$|$ket$⟩$ : A Retargetable Compiler for NISQ Devices
• MQT Bench: Benchmarking Software and Design Automation Tools for Quantum Computing
• Quantum computation with realistic magic state factories
• Exact synthesis of multiqubit Clifford+T circuits
• Efficient synthesis of universal Repeat-Until-Success circuits
• Quipper: A Scalable Quantum Programming Language
• PyZX: Large Scale Automated Diagrammatic Reasoning
• Topological Quantum Compiling with Reinforcement Learning
• Efficient synthesis of probabilistic quantum circuits with fallback
• Shorter gate sequences for quantum computing by mixing unitaries
• LEAP: Scaling Numerical Optimization Based Synthesis Using an Incremental Approach
• T-count and T-depth of any multi-qubit unitary
• The block-ZXZ synthesis of an arbitrary quantum circuit
• Quantum Logic Gate Synthesis as a Markov Decision Process
• Unitary Synthesis of Clifford+T Circuits with Reinforcement Learning

Cited by in corpus (1)

• Quantum phase estimation with optimal confidence interval using three control qubits