Magic state distillation with low overhead

Abstract

We propose a new family of error detecting stabilizer codes with an encoding rate 1/3 that permit a transversal implementation of the pi/8-rotation $T$ on all logical qubits. The new codes are used to construct protocols for distilling high-quality `magic' states $T|+>$ by Clifford group gates and Pauli measurements. The distillation overhead has a poly-logarithmic scaling as a function of the output accuracy, where the degree of the polynomial is ${\log }_{2}3\approx 1.6$. To construct the desired family of codes, we introduce the notion of a triorthogonal matrix --- a binary matrix in which any pair and any triple of rows have even overlap. Any triorthogonal matrix gives rise to a stabilizer code with a transversal $T$-gate on all logical qubits, possibly augmented by Clifford gates. A powerful numerical method for generating triorthogonal matrices is proposed. Our techniques lead to a two-fold overhead reduction for distilling magic states with output accuracy $10^{-12}$ compared with the best previously known protocol.

11 pages, 3 figures

References in corpus (12)

• Good Quantum Error-Correcting Codes Exist
• Topological quantum memory
• Universal Quantum Computation with ideal Clifford gates and noisy ancillas
• Multiple Particle Interference and Quantum Error Correction
• Quantum Computing with Very Noisy Devices
• Fault-tolerant quantum computation with high threshold in two dimensions
• Topological fault-tolerance in cluster state quantum computation
• High threshold universal quantum computation on the surface code
• Restrictions on Transversal Encoded Quantum Gate Sets
• Improved magic states distillation for quantum universality
• Quantum Measurements and Gates by Code Deformation
• On triply even binary codes

Cited by in corpus (214)

• Majorana Zero Modes and Topological Quantum Computation
• Scalable Designs for Quasiparticle-Poisoning-Protected Topological Quantum Computation with Majorana Zero Modes
• Building logical qubits in a superconducting quantum computing system
• Roads towards fault-tolerant universal quantum computation
• The Resource Theory of Stabilizer Computation
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Trading classical and quantum computational resources
• Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer
• Building a fault-tolerant quantum computer using concatenated cat codes
• Universal fault-tolerant quantum computation with only transversal gates and error correction
• Magic State Distillation: Not as Costly as You Think
• Novel constructions for the fault-tolerant Toffoli gate
• Convex resource theory of non-Gaussianity
• Enhanced fault-tolerant quantum computing in $d$-level systems
• Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
• Quantum computation with realistic magic state factories
• Quantum Algorithms for Simulating the Lattice Schwinger Model
• Efficient synthesis of universal Repeat-Until-Success circuits
• Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation
• Multilevel distillation of magic states for quantum computing
• Lower bounds on the non-Clifford resources for quantum computations
• Quantifying the magic of quantum channels
• On the robustness of bucket brigade quantum RAM
• Quantifying magic for multi-qubit operations
• Factoring with Qutrits: Shor's Algorithm on Ternary and Metaplectic Quantum Architectures
• Resource costs for fault-tolerant linear optical quantum computing
• Measuring magic on a quantum processor
• Efficient classical simulation of noisy random quantum circuits in one dimension
• Fault-tolerant error correction with the gauge color code
• Surface code implementation of block code state distillation
• Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules
• Efficiently computable bounds for magic state distillation
• No-Go Theorems for Quantum Resource Purification
• Many-body magic via Pauli-Markov chains -- from criticality to gauge theories
• Using concatenated quantum codes for universal fault-tolerant quantum gates
• 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
• Universal quantum computing with twist-free and temporally encoded lattice surgery
• Requirements for fault-tolerant factoring on an atom-optics quantum computer
• The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
• Learning to Decode the Surface Code with a Recurrent, Transformer-Based Neural Network
• Codes and Protocols for Distilling $T$, controlled-$S$, and Toffoli Gates
• Nonstabilizerness via matrix product states in the Pauli basis
• Universal fault-tolerant gates on concatenated stabilizer codes
• Combining Topological Hardware and Topological Software: Color Code Quantum Computing with Topological Superconductor Networks
• 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
• Applying quantum algorithms to constraint satisfaction problems
• Nonstabilizerness determining the hardness of direct fidelity estimation
• Towards low overhead magic state distillation
• Magic State Distillation with Low Space Overhead and Optimal Asymptotic Input Count
• Efficient synthesis of probabilistic quantum circuits with fallback
• Distillation with sublogarithmic overhead
• Logical blocks for fault-tolerant topological quantum computation
• Shorter gate sequences for quantum computing by mixing unitaries
• Unifying gate-synthesis and magic state distillation
• On Optimality of CSS Codes for Transversal $T$
• Fault-tolerant quantum computation with asymmetric Bacon-Shor codes
• Classically emulated digital quantum simulation for screening and confinement in the Schwinger model with a topological term
• A State Distillation Protocol to Implement Arbitrary Single-qubit Rotations
• Mapping of Lattice Surgery-based Quantum Circuits on Surface Code Architectures
• Braiding Majorana zero modes using quantum dots
• Distilling one-qubit magic states into Toffoli states
• Cost-Reduced All-Gaussian Universality with the Gottesman-Kitaev-Preskill Code: Resource-Theoretic Approach to Cost Analysis
• T-count optimization and Reed-Muller codes
• Transversal Clifford gates on folded surface codes
• Stacked codes: universal fault-tolerant quantum computation in a two-dimensional layout
• Qudit Colour Codes and Gauge Colour Codes in All Spatial Dimensions
• Critical behaviors of non-stabilizerness in quantum spin chains
• Reducing the quantum computing overhead with complex gate distillation
• Reducing the overhead for quantum computation when noise is biased
• Pseudomagic Quantum States
• Lower bound for the T count via unitary stabilizer nullity
• Locality-Preserving Logical Operators in Topological Stabiliser Codes
• Partially Fault-tolerant Quantum Computing Architecture with Error-corrected Clifford Gates and Space-time Efficient Analog Rotations
• Quantum Lego: Building Quantum Error Correction Codes from Tensor Networks
• Qutrit Magic State Distillation Tight in Some Directions
• The Impact of Hardware Specifications on Reaching Quantum Advantage in the Fault Tolerant Regime
• Magic in generalized Rokhsar-Kivelson wavefunctions
• Fault-tolerant gates on hypergraph product codes
• Error mitigation and quantum-assisted simulation in the error corrected regime
• An efficient magic state approach to small angle rotations
• Partitioning qubits in hypergraph product codes to implement logical gates
• Characterization of an operational quantum resource in a critical many-body system
• Measurement-induced phases of matter require feedback
• Gauge color codes in two dimensions
• Morphing quantum codes
• A Non-Commuting Stabilizer Formalism
• Lattice Surgery Translation for Quantum Computation
• Low-Overhead Transversal Fault Tolerance for Universal Quantum Computation
• General Quantum Resource Theories: Distillation, Formation and Consistent Resource Measures
• Quantum computation from dynamic automorphism codes
• Data centers with quantum random access memory and quantum networks
• A High Performance Compiler for Very Large Scale Surface Code Computations
• Robust Majorana magic gates via measurements
• Phase transition in Stabilizer Entropy and efficient purity estimation
• Composite Toffoli gate with two-round error detection
• Qutrit and Ququint Magic States
• Magic-State Functional Units: Mapping and Scheduling Multi-Level Distillation Circuits for Fault-Tolerant Quantum Architectures
• Universal limitations on implementing resourceful unitary evolutions
• High-Fidelity Magic-State Preparation with a Biased-Noise Architecture
• Quantifying dynamical magic with completely stabilizer preserving operations as free
• Constraints on magic state protocols from the statistical mechanics of Wigner negativity
• Quantum circuit optimization by topological compaction in the surface code
• Effective Compression of Quantum Braided Circuits Aided by ZX-Calculus
• Logical Clifford Synthesis for Stabilizer Codes
• Magic State Distillation from Entangled States
• Magic State Distillation and Gate Compilation in Quantum Algorithms for Quantum Chemistry
• Fault-tolerant Post-Selection for Low Overhead Magic State Preparation
• Magic State Distillation with the Ternary Golay Code
• Classification of Small Triorthogonal Codes
• Error rates and resource overheads of encoded three-qubit gates
• Fault-tolerant Preparation of Stabilizer States for Quantum CSS Codes by Classical Error-Correcting Codes
• Towers of generalized divisible quantum codes
• Un-Weyl-ing the Clifford Hierarchy
• Lattice Surgery on the Raussendorf Lattice
• Efficient Formal Verification of Quantum Error Correcting Programs
• Efficient Preparation of Large Block Code Ancilla States for Fault-tolerant Quantum Computation
• Non-Uniform Code Concatenation for Universal Fault-Tolerant Quantum Computing
• No-Go Theorems for Universal Entanglement Purification
• Fermion-Parity-Based Computation and its Majorana-Zero-Mode Implementation
• Transversal Diagonal Logical Operators for Stabiliser Codes
• Classical Coding Problem from Transversal $T$ Gates
• Quantum Pin Codes
• Resource Optimized Quantum Architectures for Surface Code Implementations of Magic-State Distillation
• Designing the Quantum Channels Induced by Diagonal Gates
• Doubled Color Codes
• Power-optimal, stabilized entangling gate between trapped-ion qubits
• Non-Stabilizerness of Sachdev-Ye-Kitaev Model
• Fractional Chern insulator edges and layer-resolved lattice contacts
• Entanglement Purification with Quantum LDPC Codes and Iterative Decoding
• Mitigating Coherent Noise by Balancing Weight-2 $Z$-Stabilizers
• Stabilizer Rényi Entropy and Conformal Field Theory
• On Groups in the Qubit Clifford Hierarchy
• Magic transition in measurement-only circuits
• Compilation of a simple chemistry application to quantum error correction primitives
• Implementing fault-tolerant non-Clifford gates using the [[8,3,2]] color code
• Sufficient condition for universal quantum computation using bosonic circuits
• Geometric Rényi Divergence and its Applications in Quantum Channel Capacities
• Magic State Distillation at Intermediate Size
• An algebraic characterization of binary CSS-T codes and cyclic CSS-T codes for quantum fault tolerance
• Fault-tolerant conversion between adjacent Reed-Muller quantum codes based on gauge fixing
• Low-overhead magic state distillation with color codes
• Fault-tolerant quantum speedup from constant depth quantum circuits
• Local Clustering Decoder as a fast and adaptive hardware decoder for the surface code
• Code switching revisited: Low-overhead magic state preparation using color codes
• Permutation-Invariant Quantum Codes with Transversal Generalized Phase Gates
• Quantum error correction meets continuous symmetries: fundamental trade-offs and case studies
• Climbing the Diagonal Clifford Hierarchy
• Hybrid magic state distillation for universal fault-tolerant quantum computation
• Magic state distillation with punctured polar codes
• Efficient fault-tolerant code switching via one-way transversal CNOT gates
• Operational interpretation of the Stabilizer Entropy
• Quantum computing for genomics: conceptual challenges and practical perspectives
• Small Codes for Magic State Distillation
• Code conversion with the quantum Golay code for a universal transversal gate set
• Auxiliary-assisted energy distillation from quantum batteries
• A new twist on the Majorana surface code: Bosonic and fermionic defects for fault-tolerant quantum computation
• A Universal Circuit Set Using the $S_3$ Quantum Double
• Geometric structure and transversal logic of quantum Reed-Muller codes
• Low-overhead non-Clifford fault-tolerant circuits for all non-chiral abelian topological phases
• Transversal Clifford and T-gate codes of short length and high distance
• Resource optimization for fault-tolerant quantum computing
• LSQCA: Resource-Efficient Load/Store Architecture for Limited-Scale Fault-Tolerant Quantum Computing
• Rigorous noise reduction with quantum autoencoders
• Efficient fault-tolerant implementations of non-Clifford gates with reconfigurable atom arrays
• Fault-tolerant quantum computing with the parity code and noise-biased qubits
• Optimization tools for distance-preserving flag fault-tolerant error correction
• Lower T-count with faster algorithms
• Measurement sequences for magic state distillation
• Measurement-based quantum machine learning
• Signed quantum weight enumerators characterize qubit magic state distillation
• Magic State Injection with Erasure Qubits
• Lattice surgery-based logical state teleportation via noisy links
• Transversal switching between generic stabilizer codes
• Fast algorithms for classical specifications of stabiliser states and Clifford gates
• CSS-T Codes from Reed Muller Codes
• From Magic State Distillation to Dynamical Systems
• Color codes with twists: construction and universal gate set implementation
• Low Overhead Qutrit Magic State Distillation
• Resource comparison of two surface code implementations of small angle Z rotations
• Classical Coding Approaches to Quantum Applications
• The Magic Barrier before Thermalization
• Analyzing the free states of one quantum resource theory as resource states of another
• Describing quantum metrology with erasure errors using weight distributions of classical codes
• Composability of global phase invariant distance and its application to approximation error management
• Machine learning logical gates for quantum error correction
• Secure multi-party quantum computation protocol for quantum circuits: the exploitation of triply-even quantum error-correcting codes
• General entropic constraints on CSS codes within magic distillation protocols
• A graph-state based synthesis framework for Clifford isometries
• Resource-efficient shadow tomography using equatorial stabilizer measurements
• Logical Noise Bias in Magic State Injection
• Scalable Spider Nests (...Or How to Graphically Grok Transversal Non-Clifford Gates)
• Positive and non-positive measurements in energy distillation from quantum batteries
• On the Hardness of Measuring Magic
• Quantum subspace verification for error correction codes
• Measurement-free code-switching for low overhead quantum computation using permutation invariant codes
• High-fidelity initialization a logical qubit with multiple injections
• Noise-Canceling Quantum Feedback: non-Hermitian Dynamics with Applications to State Preparation and Magic State Distillation
• Magic tricycles: Efficient magic state generation with finite block-length quantum LDPC codes
• Coherence-induced deep thermalization transition in random permutation quantum dynamics
• Efficient simulation of logical magic state preparation protocols
• Quantifying magic via quantum $(\alpha ,\beta )$ Jensen-Shannon divergence
• Error-mitigated initialization of surface codes with non-Pauli stabilizers
• Quantum Computation and Communication in Bosonic Systems
• Distilling GHZ States using Stabilizer Codes
• Adaptively secure unitary designs with constant non-Clifford cost
• Power and limitations of distributed quantum state purification
• Planar fault-tolerant circuits for non-Clifford gates on the 2D color code
• Programming quantum computers using 3-D puzzles, coffee cups, and doughnuts
• Fault Tolerant Quantum Simulation via Symplectic Transvections
• Color code with a logical control-$S$ gate using transversal $T$ rotations
• Weakly Fault-Tolerant Computation in a Quantum Error-Detecting Code
• CQM: Cyclic Qubit Mappings