Distilling one-qubit magic states into Toffoli states

Abstract

For certain quantum architectures and algorithms, most of the required resources are consumed during the distillation of one-qubit magic states for use in performing Toffoli gates. I show that the overhead for magic-state distillation can be reduced by merging distillation with the implementation of Toffoli gates. The resulting routine distills 8 one-qubit magic states directly to a Toffoli state, which can be used without further magic to perform a Toffoli gate.

arXiv comment8 pages, 11 figures, 1 table, v2: corrected several careless errors, apologies

References in corpus (16)

• Elementary gates for quantum computation
• Surface codes: Towards practical large-scale quantum computation
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Topological fault-tolerance in cluster state quantum computation
• Magic state distillation with low overhead
• Novel constructions for the fault-tolerant Toffoli gate
• Layered architecture for quantum computing
• Topological Computation without Braiding
• Magic state distillation in all prime dimensions using quantum Reed-Muller codes
• Improved magic states distillation for quantum universality
• Multilevel distillation of magic states for quantum computing
• Fault-tolerant quantum computation
• Catalysis and activation of magic states in fault tolerant architectures
• A bridge to lower overhead quantum computation
• Level Reduction and the Quantum Threshold Theorem
• On the Power of Reusable Magic States

Cited by in corpus (37)

• Majorana Zero Modes and Topological Quantum Computation
• Roads towards fault-tolerant universal quantum computation
• The Resource Theory of Stabilizer Computation
• Building a fault-tolerant quantum computer using concatenated cat codes
• Universal fault-tolerant quantum computation with only transversal gates and error correction
• Novel constructions for the fault-tolerant Toffoli gate
• Convex resource theory of non-Gaussianity
• Quantum computation with realistic magic state factories
• Focus beyond quadratic speedups for error-corrected quantum advantage
• Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation
• Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization
• A unified framework for magic state distillation and multi-qubit gate-synthesis with reduced resource cost
• Universal quantum computing with twist-free and temporally encoded lattice surgery
• Codes and Protocols for Distilling $T$, controlled-$S$, and Toffoli Gates
• Efficient Decomposition of Single-Qubit Gates into $V$ Basis Circuits
• Applying quantum algorithms to constraint satisfaction problems
• Magic State Distillation with Low Space Overhead and Optimal Asymptotic Input Count
• Unifying gate-synthesis and magic state distillation
• Braiding Majorana zero modes using quantum dots
• An efficient magic state approach to small angle rotations
• Composite Toffoli gate with two-round error detection
• Quantifying dynamical magic with completely stabilizer preserving operations as free
• One-step implementation of Toffoli gate for neutral atoms based on unconventional Rydberg pumping
• Effective Compression of Quantum Braided Circuits Aided by ZX-Calculus
• Quantum Simulations of Chemistry in First Quantization with any Basis Set
• Error rates and resource overheads of encoded three-qubit gates
• State-injection schemes of quantum computation in Spekkens' toy theory
• Fault-tolerant Preparation of Stabilizer States for Quantum CSS Codes by Classical Error-Correcting Codes
• Distillation protocols for Fourier states in quantum computing
• Flexible layout of surface code computations using AutoCCZ states
• Quantum Computation of Electronic Structure with Projector Augmented-Wave Method and Plane Wave Basis Set
• Hybrid magic state distillation for universal fault-tolerant quantum computation
• Resource optimization for fault-tolerant quantum computing
• Measurement sequences for magic state distillation
• Clifford operators in SU(N)1; N not odd prime
• Measurement-free code-switching for low overhead quantum computation using permutation invariant codes
• Hypergraph States in SU(N)1, N odd prime, Chern-Simons Theory