Threshold Accuracy for Quantum Computation

Abstract

We have previously (quant-ph/9608012) shown that for quantum memories and quantum communication, a state can be transmitted over arbitrary distances with error $\epsilon$ provided each gate has error at most $c\epsilon$. We discuss a similar concatenation technique which can be used with fault tolerant networks to achieve any desired accuracy when computing with classical initial states, provided a minimum gate accuracy can be achieved. The technique works under realistic assumptions on operational errors. These assumptions are more general than the stochastic error heuristic used in other work. Methods are proposed to account for leakage errors, a problem not previously recognized.

20 pages. 10/15/96: Added references to threshold results by Aharanov and Ben-Or and by Kitaev

Cited by in corpus (51)

• Fault-tolerant quantum computation by anyons
• A Theory of Fault-Tolerant Quantum Computation
• Quantum Error Correction for Beginners
• Simulation of topological field theories by quantum computers
• Internal Consistency of Fault-Tolerant Quantum Error Correction in Light of Rigorous Derivations of the Quantum Markovian Limit
• Fault-tolerant quantum computation with few qubits
• A random walk approach to quantum algorithms
• Fault-Tolerant Quantum Computation with Local Gates
• On Universal and Fault-Tolerant Quantum Computing
• Calibrated decoders for experimental quantum error correction
• An Introduction to Quantum Complexity Theory
• An Introduction to Quantum Error Correction
• Performance of quantum error correction with coherent errors
• Toward fault-tolerant quantum computation without concatenation
• Fault-Tolerant Operation of a Quantum Error-Correction Code
• Quantum Error Correction with the Semion Code
• Limitations of Noisy Reversible Computation
• Continuous groups of transversal gates for quantum error correcting codes from finite clock reference frames
• Tricolored Lattice Gauge Theory with Randomness: Fault-Tolerance in Topological Color Codes
• Quantum Lego: Building Quantum Error Correction Codes from Tensor Networks
• Fault Tolerant Quantum Computation with Constant Error
• Quantum Computing: Lecture Notes
• Optimal Universal Quantum Error Correction via Bounded Reference Frames
• Determining quantum phase diagrams of topological Kitaev-inspired models on NISQ quantum hardware
• Universal Fault-Tolerant Quantum Computing with Stabiliser Codes
• Self-Testing of Universal and Fault-Tolerant Sets of Quantum Gates
• Achieving fault tolerance against amplitude-damping noise
• Demonstration of Shor encoding on a trapped-ion quantum computer
• Magic State Distillation from Entangled States
• Symmetries for a High Level Neural Decoder on the Toric Code
• Achieving fault tolerance on capped color codes with few ancillas
• Towers of generalized divisible quantum codes
• Quantum Pin Codes
• Designing the Quantum Channels Induced by Diagonal Gates
• Fault-tolerant quantum error correction using error weight parities
• Quantum Computation and the localization of Modular Functors
• Transversality versus Universality for Additive Quantum Codes
• Purifying Quantum States: Quantum and Classical Algorithms
• Alibaba Cloud Quantum Development Platform: Surface Code Simulations with Crosstalk
• On Quantum and Classical Error Control Codes: Constructions and Applications
• Simulation of the five-qubit quantum error correction code on superconducting qubits
• Simulating the Effects of Quantum Error-correction Schemes
• An Introduction to Error-Correcting Codes: From Classical to Quantum
• Noisy Probabilistic Error Cancellation and Generalized Physical Implementability
• Classical Coding Approaches to Quantum Applications
• Quantum LDPC codes from intersecting subsets
• Oscillator-to-oscillator codes do not have a threshold
• Sampling and the complexity of nature
• The Study of Entangled States in Quantum Computation and Quantum Information Science
• Protecting Information Against Computational Errors and Quantum Erasures via Concatenation
• Performance and Error Analysis of Knill's Postselection Scheme in a Two-Dimensional Architecture