Quantum computation with realistic magic state factories

Abstract

Leading approaches to fault-tolerant quantum computation dedicate a significant portion of the hardware to computational factories that churn out high-fidelity ancillas called magic states. Consequently, efficient and realistic factory design is of paramount importance. Here we present the most detailed resource assessment to date of magic state factories within a surface code quantum computer, along the way introducing a number of new techniques. We show that the block codes of Bravyi and Haah [Phys. Rev. A 86, 052329 (2012)] have been systematically undervalued; we track correlated errors both numerically and analytically, providing fidelity estimates without appeal to the union bound. We also introduce a subsystem code realisation of these protocols with constant time and low ancilla cost. Additionally, we confirm that magic state factories have space-time costs that scale as a constant factor of surface code costs. We find that the magic state factory required for post-classical factoring can be as small as 6.3 million data qubits, ignoring ancilla qubits, assuming $10^{-4}$ error gates, and the availability of long range interactions.

Error corrected in expression for code gauge generators, presented matrix now full rank. Subsequent constant time implementation altered with marginal resulting change to overhead results. Improved discussion of overhead scaling. Appendices and abstract rewritten for clarity. Added references. Corrected typos. Supplementary materials at https://github.com/JoeOG/magicStateFactory

References in corpus (19)

• Surface codes: Towards practical large-scale quantum computation
• Topological fault-tolerance in cluster state quantum computation
• Magic state distillation with low overhead
• Distributed Quantum Computation Based-on Small Quantum Registers
• Quantum circuits of T-depth one
• Novel constructions for the fault-tolerant Toffoli gate
• Subsystem fault tolerance with the Bacon-Shor code
• Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
• Magic state distillation in all prime dimensions using quantum Reed-Muller codes
• Multilevel distillation of magic states for quantum computing
• 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
• Measurement based entanglement under conditions of extreme photon loss
• Unifying gate-synthesis and magic state distillation
• Distilling one-qubit magic states into Toffoli states
• Reducing the quantum computing overhead with complex gate distillation
• Scalable Error Correction in Distributed Ion Trap Computers
• Lattice Surgery Translation for Quantum Computation
• Freely Scalable Quantum Technologies using Cells of 5-to-50 Qubits with Very Lossy and Noisy Photonic Links

Cited by in corpus (98)

• Quantum computational chemistry
• How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
• Efficient variational quantum simulator incorporating active error minimisation
• Quantum Error Mitigation
• Roads towards fault-tolerant universal quantum computation
• Practical Quantum Error Mitigation for Near-Future Applications
• Hybrid quantum-classical algorithms and quantum error mitigation
• Theory of variational quantum simulation
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Rydberg atom quantum technologies
• A random compiler for fast Hamiltonian simulation
• The Future of Quantum Computing with Superconducting Qubits
• Quantum Error Correction: An Introductory Guide
• Building a fault-tolerant quantum computer using concatenated cat codes
• Automated optimization of large quantum circuits with continuous parameters
• Magic State Distillation: Not as Costly as You Think
• Challenges and Opportunities of Near-Term Quantum Computing Systems
• Computational advantage of quantum random sampling
• Quantum advantage with noisy shallow circuits in 3D
• Quantum computation with universal error mitigation on superconducting quantum processor
• Error-Mitigated Quantum Gates Exceeding Physical Fidelities in a Trapped-Ion System
• Digital quantum simulation of molecular vibrations
• 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
• Quantum simulation with hybrid tensor networks
• The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
• Fault-tolerant magic state preparation with flag qubits
• Early fault-tolerant simulations of the Hubbard model
• Three-dimensional surface codes: Transversal gates and fault-tolerant architectures
• A fault-tolerant non-Clifford gate for the surface code in two dimensions
• Time-Space Complexity of Quantum Search Algorithms in Symmetric Cryptanalysis
• Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits
• Resilience of quantum random access memory to generic noise
• Phase transition in magic with random quantum circuits
• Applying quantum algorithms to constraint satisfaction problems
• Towards low overhead magic state distillation
• Magic State Distillation with Low Space Overhead and Optimal Asymptotic Input Count
• Majorana loop stabilizer codes for error correction of fermionic quantum simulations
• Partial Compilation of Variational Algorithms for Noisy Intermediate-Scale Quantum Machines
• Error Rates and Resource Overheads of Repetition Cat Qubits
• Dual-state purification for practical quantum error mitigation
• Experimental Demonstration of Logical Magic State Distillation
• Resource speed limits: Maximal rate of resource variation
• Three-dimensional solid-state qubit arrays with long-lived spin coherence
• Block-encoding structured matrices for data input in quantum computing
• Quantifying nonlocality: how outperforming local quantum codes is expensive
• Pseudomagic Quantum States
• Lower bound for the T count via unitary stabilizer nullity
• Error mitigation and quantum-assisted simulation in the error corrected regime
• Characterization of an operational quantum resource in a critical many-body system
• Error statistics and scalability of quantum error mitigation formulas
• Hardware-efficient quantum algorithm for the simulation of open-system dynamics and thermalisation
• Learning time-dependent noise to reduce logical errors: Real time error rate estimation in quantum error correction
• Multi-mode architectures for noise-resilient superconducting qubits
• Universal limitations on implementing resourceful unitary evolutions
• High-Fidelity Magic-State Preparation with a Biased-Noise Architecture
• Magic-State Functional Units: Mapping and Scheduling Multi-Level Distillation Circuits for Fault-Tolerant Quantum Architectures
• CMOS on-chip thermometry at deep cryogenic temperatures
• Verifying the Smallest Interesting Colour Code with Quantomatic
• Constraints on magic state protocols from the statistical mechanics of Wigner negativity
• Reducing 2-QuBit Gate Count for ZX-Calculus based Quantum Circuit Optimization
• Adaptive quantum error mitigation using pulse-based inverse evolutions
• One-dimensional quantum computing with a 'segmented chain' is feasible with today's gate fidelities
• Optimization of Richardson extrapolation for quantum error mitigation
• A Silicon Surface Code Architecture Resilient Against Leakage Errors
• Codesign of quantum error-correcting codes and modular chiplets in the presence of defects
• Analogue Quantum Simulation: A New Instrument for Scientific Understanding
• Volumetric Benchmarking of Error Mitigation with Qermit
• Resource Optimized Quantum Architectures for Surface Code Implementations of Magic-State Distillation
• Power-optimal, stabilized entangling gate between trapped-ion qubits
• Code switching revisited: Low-overhead magic state preparation using color codes
• Low-overhead magic state distillation with color codes
• Unlocking early fault-tolerant quantum computing with mitigated magic dilution
• Resource Analysis of Low-Overhead Transversal Architectures for Reconfigurable Atom Arrays
• Time-Efficient Logical Operations on Quantum Low-Density Parity Check Codes
• Preserving phase coherence and linearity in cat qubits with exponential bit-flip suppression
• Fault-Tolerant Preparation of Quantum Polar Codes Encoding One Logical Qubit
• Magic state distillation with punctured polar codes
• Counting stabiliser codes for arbitrary dimension
• Self-consistent tomography of temporally correlated errors
• Learning from physics experiments, with quantum computers: Applications in muon spectroscopy
• Full-Dimensional Schrödinger Wavefunction Calculations using Tensors and Quantum Computers: the Cartesian component-separated approach
• Fault tolerant quantum data locking
• Lowering the T-depth of Quantum Circuits By Reducing the Multiplicative Depth Of Logic Networks
• Efficient CNOT Synthesis for NISQ Devices
• Mode multiplexing for scalable cavity-enhanced operations in neutral-atom arrays
• Low Overhead Qutrit Magic State Distillation
• High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization
• Perturbative tomography of small errors in quantum gates
• Towards Symmetry-Aware Efficient Simulation of Quantum Systems and Beyond
• Measurement-free code-switching for low overhead quantum computation using permutation invariant codes
• Noise-Agnostic Unbiased Quantum Error Mitigation for Logical Qubits
• Efficient simulation of logical magic state preparation protocols
• Clifford operators in SU(N)1; N not odd prime
• Hypergraph States in SU(N)1, N odd prime, Chern-Simons Theory
• Universal quantum computation via scalable measurement-free error correction
• Fault-tolerant fidelity based on few-qubit codes: Parity-check circuits for biased error channels
• AccQOC: Accelerating Quantum Optimal Control Based Pulse Generation