Shorter quantum circuits via single-qubit gate approximation

Abstract

We give a novel procedure for approximating general single-qubit unitaries from a finite universal gate set by reducing the problem to a novel magnitude approximation problem, achieving an immediate improvement in sequence length by a factor of 7/9. Extending the works arXiv:1612.01011 and arXiv:1612.02689, we show that taking probabilistic mixtures of channels to solve fallback (arXiv:1409.3552) and magnitude approximation problems saves factor of two in approximation costs. In particular, over the Clifford+$\sqrt{\mathrm{T}}$ gate set we achieve an average non-Clifford gate count of $0.23{\log }_2(1/\epsilon )+2.13$ and T-count $0.56{\log }_2(1/\epsilon )+5.3$ with mixed fallback approximations for diamond norm accuracy $\epsilon$. This paper provides a holistic overview of gate approximation, in addition to these new insights. We give an end-to-end procedure for gate approximation for general gate sets related to some quaternion algebras, providing pedagogical examples using common fault-tolerant gate sets (V, Clifford+T and Clifford+$\sqrt{\mathrm{T}}$). We also provide detailed numerical results for Clifford+T and Clifford+$\sqrt{\mathrm{T}}$ gate sets. In an effort to keep the paper self-contained, we include an overview of the relevant algorithms for integer point enumeration and relative norm equation solving. We provide a number of further applications of the magnitude approximation problems, as well as improved algorithms for exact synthesis, in the Appendices.

88 pages

References in corpus (10)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Restrictions on Transversal Encoded Quantum Gate Sets
• Quantum computing enhanced computational catalysis
• Efficient synthesis of universal Repeat-Until-Success circuits
• The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
• Assessing requirements to scale to practical quantum advantage
• Efficient synthesis of probabilistic quantum circuits with fallback
• Quantum Circuits for Sparse Isometries
• Computing Stabilized Norms for Quantum Operations via the Theory of Completely Bounded Maps
• Turning Gate Synthesis Errors into Incoherent Errors

Cited by in corpus (24)

• Compilation of a simple chemistry application to quantum error correction primitives
• Unlocking early fault-tolerant quantum computing with mitigated magic dilution
• Sparse Probabilistic Synthesis of Quantum Operations
• Probabilistic state synthesis based on optimal convex approximation
• TE-PAI: Exact Time Evolution by Sampling Random Circuits
• Resource-optimized fault-tolerant simulation of the Fermi-Hubbard model and high-temperature superconductor models
• Leveraging Zero-Level Distillation to Generate High-Fidelity Magic States
• Probabilistic unitary synthesis with optimal accuracy
• Locality-aware Pauli-based computation for local magic state preparation
• Lower T-count with faster algorithms
• Almost fault-tolerant quantum machine learning with drastic overhead reduction
• Exponential distillation of dominant eigenproperties
• Stabilizer configuration interaction: Finding molecular subspaces with error detection properties
• Low Depth Phase Oracle Using a Parallel Piecewise Circuit
• Phase estimation with partially randomized time evolution
• Non-unitary Coupled Cluster Enabled by Mid-circuit Measurements on Quantum Computers
• Superconducting qubits in the millions: the potential and limitations of modularity
• Space-time tradeoff in networked virtual distillation
• Error Crafting in Mixed Quantum Gate Synthesis
• Catalytic $z$-rotations in constant $T$-depth
• Simulating sparse SYK model with a randomized algorithm on a trapped-ion quantum computer
• Unbiased observable estimation with approximate channels in fault-tolerant quantum computation
• Quantum phase estimation with optimal confidence interval using three control qubits
• Quantum Simulation of Nuclear Dynamics in First Quantization