Fault Tolerant Quantum Computation with Constant Error
arXiv:quant-ph/9611025
Abstract
Recently Shor showed how to perform fault tolerant quantum computation when the error probability is logarithmically small. We improve this bound and describe fault tolerant quantum computation when the error probability is smaller than some constant threshold. The cost is polylogarithmic in time and space, and no measurements are used during the quantum computation. The result holds also for quantum circuits which operate on nearest neighbors only. To achieve this noise resistance, we use concatenated quantum error correcting codes. The scheme presented is general, and works with all quantum codes that satisfy some restrictions, namely that the code is ``proper''. We present two explicit classes of proper quantum codes. The first example of proper quantum codes generalizes classical secret sharing with polynomials. The second uses a known class of quantum codes and converts it to a proper code. This class is defined over a field with p elements, so the elementary quantum particle is not a qubit but a ``qupit''. With our codes, the threshold is about 10^(-6). Hopefully, this paper motivates a search for proper quantum codes with higher thresholds, at which point quantum computation becomes practical.
18 pages, now includes bibliography
References in corpus (8)
- Quantum Mechanics helps in searching for a needle in a haystack
- Quantum Error Correction and Orthogonal Geometry
- Nuclear magnetic resonance spectroscopy: An experimentally accessible paradigm for quantum computing
- Bosonic Quantum Codes for Amplitude Damping
- Quantum Computation in Quantum-Hall Systems
- Threshold Accuracy for Quantum Computation
- Limitations of Noisy Reversible Computation
- Polynomial Simulations of Decohered Quantum Computers
Cited by in corpus (18)
- Fault-tolerant quantum computation by anyons
- Unconditional Security Of Quantum Key Distribution Over Arbitrarily Long Distances
- Simulation of topological field theories by quantum computers
- Quantum Computation in Quantum-Hall Systems
- Simulating Ising Spin Glasses on a Quantum Computer
- A random walk approach to quantum algorithms
- How will quantum computers provide an industrially relevant computational advantage in quantum chemistry?
- Quantum Error Correction with the Semion Code
- Short-Time Decoherence for General System-Environment Interactions
- Constructing optimal quantum error correcting codes from absolute maximally entangled states
- Tutorial: The trapped-ion qubit toolbox
- Quantum computing with spin qubits in semiconductor structures
- VQE Method: A Short Survey and Recent Developments
- Computational Distinguishability of Quantum Channels
- Fibre bundle framework for unitary quantum fault tolerance
- Error correction and symmetrization in quantum computers
- Quantum codes do not fix qubit independent errors
- Using Conditional Measurements to Combat Decoherence