Error-detection-based quantum fault tolerance against discrete Pauli noise
arXiv:quant-ph/0612004
Abstract
A quantum computer -- i.e., a computer capable of manipulating data in quantum superposition -- would find applications including factoring, quantum simulation and tests of basic quantum theory. Since quantum superpositions are fragile, the major hurdle in building such a computer is overcoming noise. Developed over the last couple of years, new schemes for achieving fault tolerance based on error detection, rather than error correction, appear to tolerate as much as 3-6% noise per gate -- an order of magnitude better than previous procedures. But proof techniques could not show that these promising fault-tolerance schemes tolerated any noise at all. With an analysis based on decomposing complicated probability distributions into mixtures of simpler ones, we rigorously prove the existence of constant tolerable noise rates ("noise thresholds") for error-detection-based schemes. Numerical calculations indicate that the actual noise threshold this method yields is lower-bounded by 0.1% noise per gate.
195 pages, Ph.D. thesis, University of California, Berkeley
References in corpus (10)
- Fault-Tolerant Quantum Computation For Local Non-Markovian Noise
- A Simple Proof that Toffoli and Hadamard are Quantum Universal
- Local Fault-tolerant Quantum Computation
- Both Toffoli and Controlled-NOT need little help to do universal quantum computation
- Fault-Tolerant Postselected Quantum Computation: Schemes
- Fault-Tolerant Postselected Quantum Computation: Threshold Analysis
- Classical simulatability, entanglement breaking, and quantum computation thresholds
- Threshold Error Penalty for Fault Tolerant Computation with Nearest Neighbour Communication
- Improved ancilla preparation scheme increases fault-tolerant threshold
- Quantum error correction of systematic errors using a quantum search framework
Cited by in corpus (7)
- Fault-tolerant quantum computation versus Gaussian noise
- Accuracy threshold for postselected quantum computation
- Fault-Tolerant Quantum Computation
- Fibonacci schemes of fault-tolerant quantum computation
- An upper bound on quantum fault tolerant thresholds
- The Study of Entangled States in Quantum Computation and Quantum Information Science
- Approximate quantum error correction for correlated noise