The cost of universality: A comparative study of the overhead of state distillation and code switching with color codes
arXiv:2101.02211 · doi:10.1103/PRXQuantum.2.020341
Abstract
Estimating and reducing the overhead of fault tolerance (FT) schemes is a crucial step toward realizing scalable quantum computers. Of particular interest are schemes based on two-dimensional (2D) topological codes such as the surface and color codes which have high thresholds but lack a natural implementation of a non-Clifford gate. In this work, we directly compare two leading FT implementations of the T gate in 2D color codes under circuit noise across a wide range of parameters in regimes of practical interest. We report that implementing the T gate via code switching to a 3D color code does not offer substantial savings over state distillation in terms of either space or space-time overhead. We find a circuit noise threshold of 0.07(1)% for the T gate via code switching, almost an order of magnitude below that achievable by state distillation in the same setting. To arrive at these results, we provide and simulate an optimized code switching procedure, and bound the effect of various conceivable improvements. Many intermediate results in our analysis may be of independent interest. For example, we optimize the 2D color code for circuit noise yielding its largest threshold to date 0.37(1)%, and adapt and optimize the restriction decoder finding a threshold of 0.80(5)% for the 3D color code with perfect measurements under Z noise. Our work provides a much-needed direct comparison of the overhead of state distillation and code switching, and sheds light on the choice of future FT schemes and hardware designs.
arXiv comment69 pages
References in corpus (71)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Surface codes: Towards practical large-scale quantum computation
- Good Quantum Error-Correcting Codes Exist
- Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
- Topological quantum memory
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Quantum Error Correction for Quantum Memories
- Trapped-Ion Quantum Computing: Progress and Challenges
- Reliable Quantum Computers
- Fault-tolerant quantum computation with high threshold in two dimensions
- Topological Quantum Distillation
- Topological fault-tolerance in cluster state quantum computation
- Scalable Designs for Quasiparticle-Poisoning-Protected Topological Quantum Computation with Majorana Zero Modes
- Simple Quantum Error Correcting Codes
- Restrictions on Transversal Encoded Quantum Gate Sets
- Experimental Quantum Computations on a Topologically Encoded Qubit
- Quantum computing with nearest neighbor interactions and error rates over 1%
- Magic state distillation with low overhead
- Active stabilisation, quantum computation and quantum state synthesis
- Analytic and numerical demonstration of quantum self-correction in the 3D Cubic Code
- Fast Decoders for Topological Quantum Codes
- Universal fault-tolerant quantum computation with only transversal gates and error correction
- Quantum memories at finite temperature
- Efficient Algorithms for Maximum Likelihood Decoding in the Surface Code
- Process verification of two-qubit quantum gates by randomized benchmarking
- Magic State Distillation: Not as Costly as You Think
- Topological and subsystem codes on low-degree graphs with flag qubits
- Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
- Quantum computation with realistic magic state factories
- Single-shot fault-tolerant quantum error correction
- Classification of topologically protected gates for local stabilizer codes
- Unfolding the color code
- Exact Topological Quantum Order in D=3 and Beyond: Branyons and Brane-Net Condensates
- Improved magic states distillation for quantum universality
- Universal transversal gates with color codes - a simplified approach
- Lower bounds on the non-Clifford resources for quantum computations
- Multilevel distillation of magic states for quantum computing
- Fault-tolerant logical gates in quantum error-correcting codes
- Using concatenated quantum codes for universal fault-tolerant quantum gates
- A magic state's fidelity can be superior to the operations that created it
- Decoding color codes by projection onto surface codes
- Triangular color codes on trivalent graphs with flag qubits
- Deep neural decoders for near term fault-tolerant experiments
- Efficient Decoders for Qudit Topological Codes
- Fault-tolerant magic state preparation with flag qubits
- Codes and Protocols for Distilling , controlled-, and Toffoli Gates
- Advantages of versatile neural-network decoding for topological codes
- Three-dimensional surface codes: Transversal gates and fault-tolerant architectures
- A fault-tolerant non-Clifford gate for the surface code in two dimensions
- Universal fault-tolerant gates on concatenated stabilizer codes
- Very low overhead fault-tolerant magic state preparation using redundant ancilla encoding and flag qubits
- Cellular-automaton decoders with provable thresholds for topological codes
- Magic State Distillation with Low Space Overhead and Optimal Asymptotic Input Count
- Distillation with sublogarithmic overhead
- Analysing correlated noise on the surface code using adaptive decoding algorithms
- Three-dimensional color code thresholds via statistical-mechanical mapping
- Protected gates for topological quantum field theories
- Kitaev's Z_d-Codes Threshold Estimates
- The disjointness of stabilizer codes and limitations on fault-tolerant logical gates
- Stacked codes: universal fault-tolerant quantum computation in a two-dimensional layout
- Reducing the quantum computing overhead with complex gate distillation
- Linear-time general decoding algorithm for the surface code
- An efficient magic state approach to small angle rotations
- Optimization of the surface code design for Majorana-based qubits
- Cellular automaton decoders for topological quantum codes with noisy measurements and beyond
- Gauge color codes in two dimensions
- Analytic asymptotic performance of topological codes
- Renormalization group decoder for a four-dimensional toric code
- Towers of generalized divisible quantum codes
- Logic Synthesis for Fault-Tolerant Quantum Computers
Cited by in corpus (66)
- Logical quantum processor based on reconfigurable atom arrays
- Demonstration of fault-tolerant universal quantum gate operations
- Focus beyond quadratic speedups for error-corrected quantum advantage
- Encoding a magic state with beyond break-even fidelity
- Factoring 2048-bit RSA Integers in 177 Days with 13436 Qubits and a Multimode Memory
- Universal quantum computing with twist-free and temporally encoded lattice surgery
- Logical blocks for fault-tolerant topological quantum computation
- Simulating key properties of lithium-ion batteries with a fault-tolerant quantum computer
- Topological Order, Quantum Codes and Quantum Computation on Fractal Geometries
- Tailored XZZX codes for biased noise
- Shorter quantum circuits via single-qubit gate approximation
- Morphing quantum codes
- A decoder for the triangular color code by matching on a Möbius strip
- A circuit-level protocol and analysis for twist-based lattice surgery
- Low-Overhead Transversal Fault Tolerance for Universal Quantum Computation
- Efficient color code decoders in dimensions from toric code decoders
- Fault-Tolerant Code Switching Protocols for Near-Term Quantum Processors
- Universal Fault-Tolerant Quantum Computing with Stabiliser Codes
- Looped Pipelines Enabling Effective 3D Qubit Lattices in a Strictly 2D Device
- Magic State Distillation from Entangled States
- Achieving fault tolerance on capped color codes with few ancillas
- Classification of Small Triorthogonal Codes
- Color code decoder with improved scaling for correcting circuit-level noise
- Error correction of transversal CNOT gates for scalable surface code computation
- Fundamental thresholds of realistic quantum error correction circuits from classical spin models
- Distance-preserving stabilizer measurements in hypergraph product codes
- Decoding Merged Color-Surface Codes and Finding Fault-Tolerant Clifford Circuits Using Solvers for Satisfiability Modulo Theories
- Decoding quantum color codes with MaxSAT
- Lifting topological codes: Three-dimensional subsystem codes from two-dimensional anyon models
- Experimental Demonstration of High-Fidelity Logical Magic States from Code Switching
- Cross-cap defects and fault-tolerant logical gates in the surface code and the honeycomb Floquet code
- Improving threshold for fault-tolerant color code quantum computing by flagged weight optimization
- Robust sparse IQP sampling in constant depth
- Low-overhead quantum computing with the color code
- Improved quantum error correction using soft information
- Code switching revisited: Low-overhead magic state preparation using color codes
- Low-overhead magic state distillation with color codes
- Symmetric Clifford twirling for cost-optimal quantum error mitigation in early FTQC regime
- Resource Analysis of Low-Overhead Transversal Architectures for Reconfigurable Atom Arrays
- Lift-Connected Surface Codes
- Non-Pauli Errors in the Three-Dimensional Surface Code
- A Universal Circuit Set Using the Quantum Double
- Geometric structure and transversal logic of quantum Reed-Muller codes
- The domain wall color code
- Optimization tools for distance-preserving flag fault-tolerant error correction
- Coherent control of the causal order of entanglement distillation
- Concatenated Steane code with single-flag syndrome checks
- Lower T-count with faster algorithms
- Characterization of errors in a CNOT between surface code patches
- Efficient fault-tolerant implementations of non-Clifford gates with reconfigurable atom arrays
- Improved performance of the Bacon-Shor code with Steane's syndrome extraction method
- Decoding across transversal Clifford gates in the surface code
- Optimally generating using Pauli strings
- Distributed Realization of Color Codes for Quantum Error Correction
- From Magic State Distillation to Dynamical Systems
- Minimising surface-code failures using a color-code decoder
- Single-shot quantum error correction with the three-dimensional subsystem toric code
- QUITS: A modular Qldpc code circUIT Simulator
- Logical Noise Bias in Magic State Injection
- Efficient simulation of logical magic state preparation protocols
- Measurement-free code-switching for low overhead quantum computation using permutation invariant codes
- Finding the disjointness of stabilizer codes is NP-complete
- Universal quantum computation via scalable measurement-free error correction
- Planar fault-tolerant circuits for non-Clifford gates on the 2D color code
- Streaming Belief Propagation on Mixed-Alphabet Tanner Graphs for Practical Quantum Memory
- Transversal architecture for megaquop-scale quantum simulation with neutral atoms