Preskill, John (1998) Reliable quantum computers. Proceedings of the Royal Society A: Mathematical, physical, and engineering sciences, 454 (1969). pp. 385-410. ISSN 1364-5021. doi:10.1098/rspa.1998.0167. https://resolver.caltech.edu/CaltechAUTHORS:20200929-143507282
![[img]](https://authors.library.caltech.edu/style/images/fileicons/application_pdf.png) |
PDF
- Submitted Version
See Usage Policy. 310kB |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20200929-143507282
Abstract
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 10⁶ qubits, with a probability of error per quantum gate of order 10⁻⁶, 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.
| Item Type: | Article | |||||||||
|---|---|---|---|---|---|---|---|---|---|---|
| Related URLs: |
| |||||||||
| ORCID: |
| |||||||||
| Additional Information: | © 1998 The Royal Society. This work has been supported in part by the Department of Energy under Grant No. DE-FG03-92-ER40701, and by DARPA under Grant No. DAAH04-96-1-0386 administered by the Army Research Office. I am grateful to David DiVincenzo and Wojciech Zurek for organizing this stimulating meeting, and I thank Andrew Steane and Christof Zalka for helpful comments on the manuscript. I also thank my collaborators David Beckman, Jarah Evslin, Sham Kakade, and especially Daniel Gottesman for many productive discussions about fault-tolerant quantum computation. | |||||||||
| Funders: |
| |||||||||
| Subject Keywords: | fault-tolerant computation; quantum leaks; reliable quantum computers | |||||||||
| Issue or Number: | 1969 | |||||||||
| DOI: | 10.1098/rspa.1998.0167 | |||||||||
| Record Number: | CaltechAUTHORS:20200929-143507282 | |||||||||
| Persistent URL: | https://resolver.caltech.edu/CaltechAUTHORS:20200929-143507282 | |||||||||
| Official Citation: | Preskill John 1998 Reliable quantum computers Proc. R. Soc. Lond. A. 454:385–410 http://doi.org/10.1098/rspa.1998.0167 | |||||||||
| Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. | |||||||||
| ID Code: | 105650 | |||||||||
| Collection: | CaltechAUTHORS | |||||||||
| Deposited By: | George Porter | |||||||||
| Deposited On: | 30 Sep 2020 15:34 | |||||||||
| Last Modified: | 16 Nov 2021 18:45 |
Repository Staff Only: item control page
