Reliable quantum computers
John P. Preskill · Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences · 1998
The new field of quantum error correction has developed spectacularly since its origin less than two years ago. Encoded quantum information can be protected from errors that arise due to uncontrolled interactions with the environment. Recovery from errors can work effectively even if occasional mistakes occur during the recovery procedure. Furthermore, encoded quantum information can be processed without serious propagation of errors. Hence, an arbitrarily long quantum computation can be performed reliably, provided that the average probability of error per quantum gate is less than a certain critical value, the accuracy threshold. A quantum computer storing about 106 qubits, with a probability of error per quantum gate of order 10–6, would be a formidable factoring engine. Even a smaller less–accurate quantum computer would be able to perform many useful tasks. This paper is based on a talk presented at the ITP Conference on Quantum Coherence and Decoherence, 15 to 18 December 1996.
Cited by 994 works. doi:10.1098/rspa.1998.0167 Open-access PDF
Authors
References
- The Theory of Error-Correcting Codes
- A single quantum cannot be cloned
- Algorithms for quantum computation: discrete logarithms and factoring
- Scheme for reducing decoherence in quantum computer memory
- Quantum Computations with Cold Trapped Ions
- Mixed-state entanglement and quantum error correction
- Good quantum error-correcting codes exist
- Measurement of Conditional Phase Shifts for Quantum Logic
- Error Correcting Codes in Quantum Theory
- Demonstration of a Fundamental Quantum Logic Gate