Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation

Abstract

We present magic state factory constructions for producing $|CCZ⟩$ states and $|T⟩$ states. For the $|CCZ⟩$ factory we apply the surface code lattice surgery construction techniques described by Fowler et al. to the fault-tolerant Toffoli. The resulting factory has a footprint of $12d\times 6d$ (where $d$ is the code distance) and produces one $|CCZ⟩$ every $5.5d$ surface code cycles. Our $|T⟩$ state factory uses the $|CCZ⟩$ factory's output and a catalyst $|T⟩$ state to exactly transform one $|CCZ⟩$ state into two $|T⟩$ states. It has a footprint 25% smaller than the factory of Fowler et al. but outputs $|T⟩$ states twice as quickly. We show how to generalize the catalyzed transformation to arbitrary phase angles, and note that the case $\theta =22.5^{\circ }$ produces a particularly efficient circuit for producing $|\sqrt{T}⟩$ states. Compared to using the $12d\times 8d\times 6.5d$ $|T⟩$ factory of Fowler et al., our $|CCZ⟩$ factory can quintuple the speed of algorithms that are dominated by the cost of applying Toffoli gates, including Shor's algorithm and the chemistry algorithm of Babbush et al.. Assuming a physical gate error rate of $10^{-3}$, our CCZ factory can produce $\sim 10^{10}$ states on average before an error occurs. This is sufficient for classically intractable instantiations of the chemistry algorithm, but for more demanding algorithms such as Shor's algorithm the mean number of states until failure can be increased to $\sim 10^{12}$ by increasing the factory footprint ~20%.

arXiv comment24 pages, 19 figures, 7 ancillary files

References in corpus (20)

• Surface codes: Towards practical large-scale quantum computation
• Quantum Teleportation is a Universal Computational Primitive
• Topological quantum memory
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Fault-tolerant quantum computation with high threshold in two dimensions
• Topological fault-tolerance in cluster state quantum computation
• Surface code quantum computing by lattice surgery
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Magic state distillation with low overhead
• Entanglement-assisted local manipulation of pure quantum states
• Halving the cost of quantum addition
• Novel constructions for the fault-tolerant Toffoli gate
• Efficient synthesis of universal Repeat-Until-Success circuits
• Poking holes and cutting corners to achieve Clifford gates with the surface code
• Surface code implementation of block code state distillation
• A unified framework for magic state distillation and multi-qubit gate-synthesis with reduced resource cost
• A magic state's fidelity can be superior to the operations that created it
• Catalysis and activation of magic states in fault tolerant architectures
• Distilling one-qubit magic states into Toffoli states

Cited by in corpus (90)

• Quantum computational chemistry
• How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Stim: a fast stabilizer circuit simulator
• Even more efficient quantum computations of chemistry through tensor hypercontraction
• Building a fault-tolerant quantum computer using concatenated cat codes
• Quantum computing enhanced computational catalysis
• Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
• Magic State Distillation: Not as Costly as You Think
• Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization
• Focus beyond quadratic speedups for error-corrected quantum advantage
• Reliably assessing the electronic structure of cytochrome P450 on today's classical computers and tomorrow's quantum computers
• Quantum error mitigation as a universal error-minimization technique: applications from NISQ to FTQC eras
• Fault-Tolerant Quantum Simulations of Chemistry in First Quantization
• Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules
• Compilation of Fault-Tolerant Quantum Heuristics for Combinatorial Optimization
• Universal quantum computing with twist-free and temporally encoded lattice surgery
• The ZX calculus is a language for surface code lattice surgery
• Fault-tolerant magic state preparation with flag qubits
• Early fault-tolerant simulations of the Hubbard model
• A fault-tolerant non-Clifford gate for the surface code in two dimensions
• Fault-Tolerant Weighted Union-Find Decoding on the Toric Code
• Error Rates and Resource Overheads of Repetition Cat Qubits
• Simulating key properties of lithium-ion batteries with a fault-tolerant quantum computer
• Experimental Demonstration of Logical Magic State Distillation
• Challenges of variational quantum optimization with measurement shot noise
• Quantum computing for chemistry and physics applications from a Monte Carlo perspective
• The Impact of Hardware Specifications on Reaching Quantum Advantage in the Fault Tolerant Regime
• Preparing Bethe Ansatz Eigenstates on a Quantum Computer
• Morphing quantum codes
• Shorter quantum circuits via single-qubit gate approximation
• Fault-Tolerant One-Bit Addition with the Smallest Interesting Colour Code
• Inplace Access to the Surface Code Y Basis
• Unifying the Clifford Hierarchy via Symmetric Matrices over Rings
• Graphical Structures for Design and Verification of Quantum Error Correction
• High-Fidelity Magic-State Preparation with a Biased-Noise Architecture
• Universal limitations on implementing resourceful unitary evolutions
• Effective Compression of Quantum Braided Circuits Aided by ZX-Calculus
• Sampling, rates, and reaction currents through reverse stochastic quantization on quantum computers
• Logical Clifford Synthesis for Stabilizer Codes
• Fault-tolerant Post-Selection for Low Overhead Magic State Preparation
• Opening the Black Box Inside Grover's Algorithm
• Codesign of quantum error-correcting codes and modular chiplets in the presence of defects
• Efficient Construction of a Control Modular Adder on a Carry-Lookahead Adder Using Relative-phase Toffoli Gates
• Assessment of various Hamiltonian partitionings for the electronic structure problem on a quantum computer using the Trotter approximation
• The prospects of Monte Carlo antibody loop modelling on a fault-tolerant quantum computer
• Spin coupling is all you need: Encoding strong electron correlation in molecules on quantum computers
• Pauli Fusion: a Computational Model to Realise Quantum Transformations from ZX Terms
• Compilation of a simple chemistry application to quantum error correction primitives
• Option pricing under stochastic volatility on a quantum computer
• The T-Complexity Costs of Error Correction for Control Flow in Quantum Computation
• A SAT Scalpel for Lattice Surgery: Representation and Synthesis of Subroutines for Surface-Code Fault-Tolerant Quantum Computing
• Extending the reach of quantum computing for materials science with machine learning potentials
• Low-overhead quantum computing with the color code
• Code switching revisited: Low-overhead magic state preparation using color codes
• AKLT-states as ZX-diagrams: diagrammatic reasoning for quantum states
• Quantum Computation of Electronic Structure with Projector Augmented-Wave Method and Plane Wave Basis Set
• Resource Analysis of Low-Overhead Transversal Architectures for Reconfigurable Atom Arrays
• Unlocking early fault-tolerant quantum computing with mitigated magic dilution
• Completeness of the ZH-calculus
• Quantum computing for genomics: conceptual challenges and practical perspectives
• Cost-optimal single-qubit gate synthesis in the Clifford hierarchy
• TE-PAI: Exact Time Evolution by Sampling Random Circuits
• From quantum-enhanced to quantum-inspired Monte Carlo
• Well-tempered ZX and ZH Calculi
• Randomized semi-quantum matrix processing
• Leveraging Zero-Level Distillation to Generate High-Fidelity Magic States
• Picturing Counting Reductions with the ZH-Calculus
• Quantum Algorithms and Oracles with the Scalable ZX-calculus
• Error mitigation and circuit division for early fault-tolerant quantum phase estimation
• Catalytic Transformation from Computationally Universal to Strictly Universal Measurement-Based Quantum Computation
• Certifying nonstabilizerness in quantum processors
• Many-body quantum catalysts for transforming between phases of matter
• Logical qubits with erasure conversion using metastable neutral atoms
• Prospects for NMR Spectral Prediction on Fault-Tolerant Quantum Computers
• Low Depth Phase Oracle Using a Parallel Piecewise Circuit
• Phase estimation with partially randomized time evolution
• Non-stabilizerness and entanglement from cat-state injection
• Finite Verification of Infinite Families of Diagram Equations
• Efficient simulation of logical magic state preparation protocols
• Magic tricycles: Efficient magic state generation with finite block-length quantum LDPC codes
• Catalytic $z$-rotations in constant $T$-depth
• Averaging gate approximation error and performance of Unitary Coupled Cluster ansatz in Pre-FTQC Era
• Noise-Canceling Quantum Feedback: non-Hermitian Dynamics with Applications to State Preparation and Magic State Distillation
• Unfolded distillation: very low-cost magic state preparation for biased-noise qubits
• String Diagrams for Defect-Based Surface Code Computing
• A Graphical #SAT Algorithm for Formulae with Small Clause Density
• Weakly Fault-Tolerant Computation in a Quantum Error-Detecting Code
• Accelerating Fault-Tolerant Quantum Computation with Good qLDPC Codes
• Quantum phase estimation with optimal confidence interval using three control qubits