A magic state's fidelity can be superior to the operations that created it

Abstract

The leading approach to fault tolerant quantum computing requires a continual supply of magic states. When a new magic state is first encoded, its initial fidelity will be too poor for use in the computation. This necessitates a resource-intensive distillation process that occupies the majority of the computer's hardware; creating magic states with a high initial fidelity minimises this cost and is therefore crucial for practical quantum computing. Here we present the surprising and encouraging result that raw magic states can have a fidelity significantly better than that of the two-qubit gate operations used to construct them. Our protocol exploits post-selection without significantly slowing the rate of generation and tolerates finite error rates in initialisations, measurements and single-qubit gates. This approach may dramatically reduce the size of the hardware needed for a given quantum computing task.

arXiv comment5 pages, 4 figures

References in corpus (21)

• Fault-tolerant quantum computation by anyons
• Surface codes: Towards practical large-scale quantum computation
• 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
• High threshold universal quantum computation on the surface code
• Restrictions on Transversal Encoded Quantum Gate Sets
• A fault-tolerant one-way quantum computer
• Magic state distillation with low overhead
• Universal fault-tolerant quantum computation with only transversal gates and error correction
• Enhanced fault-tolerant quantum computing in $d$-level systems
• 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
• Surface code implementation of block code state distillation
• Using concatenated quantum codes for universal fault-tolerant quantum gates
• Fidelity threshold for long-range entanglement in quantum networks
• Long-distance quantum communication over noisy networks without long-time quantum memory
• Long-distance entanglement generation with scalable and robust two-dimensional quantum network

Cited by in corpus (60)

• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• The Future of Quantum Computing with Superconducting Qubits
• Blueprint for a Scalable Photonic Fault-Tolerant Quantum Computer
• Magic State Distillation: Not as Costly as You Think
• Erasure conversion for fault-tolerant quantum computing in alkaline earth Rydberg atom arrays
• Quantum computation with realistic magic state factories
• Efficient magic state factories with a catalyzed |CCZ> to 2|T> transformation
• Quantum error mitigation as a universal error-minimization technique: applications from NISQ to FTQC eras
• Resource costs for fault-tolerant linear optical quantum computing
• Encoding a magic state with beyond break-even fidelity
• Fault-tolerant error correction with the gauge color code
• Fault-tolerant resource estimate for quantum chemical simulations: Case study on Li-ion battery electrolyte molecules
• The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
• Error mitigation for universal gates on encoded qubits
• Fault-tolerant magic state preparation with flag qubits
• Quantum Computing with Majorana Fermion Codes
• Applying quantum algorithms to constraint satisfaction problems
• Logical blocks for fault-tolerant topological quantum computation
• Optimized compiler for Distributed Quantum Computing
• Robust quantum compilation and circuit optimisation via energy minimisation
• Boundaries for the Honeycomb Code
• Scaling and logic in the color code on a superconducting quantum processor
• Universal fault-tolerant measurement-based quantum computation
• Partially Fault-tolerant Quantum Computing Architecture with Error-corrected Clifford Gates and Space-time Efficient Analog Rotations
• Low-Overhead Transversal Fault Tolerance for Universal Quantum Computation
• Hierarchical surface code for network quantum computing with modules of arbitrary size
• High-Fidelity Magic-State Preparation with a Biased-Noise Architecture
• Constraints on magic state protocols from the statistical mechanics of Wigner negativity
• Optimal local unitary encoding circuits for the surface code
• Towards early fault tolerance on a 2$\times$N array of qubits equipped with shuttling
• Fault-tolerant Post-Selection for Low Overhead Magic State Preparation
• One-dimensional quantum computing with a 'segmented chain' is feasible with today's gate fidelities
• Fault-tolerant fermionic quantum computation based on color code
• Noise threshold and resource cost of fault-tolerant quantum computing with Majorana fermions in hybrid systems
• Realistic Cost to Execute Practical Quantum Circuits using Direct Clifford+T Lattice Surgery Compilation
• 3-Fermion topological quantum computation
• Mitigating errors in logical qubits
• TISCC: A Surface Code Compiler and Resource Estimator for Trapped-Ion Processors
• Code switching revisited: Low-overhead magic state preparation using color codes
• Fault-tolerant quantum speedup from constant depth quantum circuits
• Unlocking early fault-tolerant quantum computing with mitigated magic dilution
• Logical entanglement distribution between distant 2D array qubits
• Constant Overhead Entanglement Distillation via Scrambling
• Magic State Injection with Erasure Qubits
• Almost fault-tolerant quantum machine learning with drastic overhead reduction
• Magic State Injection on IBM Quantum Processors Above the Distillation Threshold
• Prospects for NMR Spectral Prediction on Fault-Tolerant Quantum Computers
• Low-density parity-check representation of fault-tolerant quantum circuits
• From Magic State Distillation to Dynamical Systems
• Error-mitigated initialization of surface codes with non-Pauli stabilizers
• Fault-tolerant interfaces for modular quantum computing on diverse qubit platforms
• Noise-Agnostic Unbiased Quantum Error Mitigation for Logical Qubits
• Unfolded distillation: very low-cost magic state preparation for biased-noise qubits
• Efficient simulation of logical magic state preparation protocols
• High-fidelity initialization a logical qubit with multiple injections
• Entanglement boosting: Low-volume logical Bell pair preparation for distributed fault-tolerant quantum computation
• Quantum-Processing-Assisted Classical Communications
• Accelerating Fault-Tolerant Quantum Computation with Good qLDPC Codes
• iSwitch: QEC on Demand via In-Situ Encoding of Bare Qubits for Ion Trap Architectures
• Scalable and fault-tolerant preparation of encoded k-uniform states