Quantum computing: pro and con
Open accessThe DOI matches its Crossref record; 35 of the 35 references it cites were found in a registry or an index.
Abstract
I assess the potential of quantum computation. Broad and important applications must be found to justify construction of a quantum computer; I review some of the known quantum algorithms and consider the prospects for finding new ones. Quantum computers are notoriously susceptible to making errors; I discuss recently developed fault–tolerant procedures that enable a quantum computer with noisy gates to perform reliably. Quantum computing hardware is still in its infancy; I comment on the specifications that should be met by future hardware. Over the past few years, work on quantum computation has erected a new classification of computational complexity, has generated profound insights into the nature of decoherence, and has stimulated the formulation of new techniques in high–precision experimental physics. A broad interdisciplinary effort will be needed if quantum computers are to fulfil their destiny as the world's fastest computing devices. This paper is an expanded version of remarks that were prepared for a panel discussion at the ITP Conference on Quantum Coherence and Decoherence, December 1996.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A fast quantum mechanical algorithm for database search
Grover, L. K. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237866 · Cited by 8,830
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713
Simulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
A single quantum cannot be cloned
Wootters, W. K., & Zurek, W. H. (1982) · Nature · doi:10.1038/299802a0 · Cited by 5,406 · cited 1×
“Though quantum key distribution may be secure in principle, it has a serious limitation: the signal becomes attenuated in the communication channel (such as an optical (cid:12)bre), and it cannot be ampli(cid:12)ed , because of the no-cloning theorem (Wootters & Zurek 1982).”
BackgroundDynamics of the dissipative two-state system
Leggett, A. J., Chakravarty, S., Dorsey, A. T., Fisher, M. P. A., Garg, A., & Zwerger, W. (1987) · Reviews of Modern Physics · doi:10.1103/revmodphys.59.1 · Cited by 5,109
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479
Quantum Computations with Cold Trapped Ions
Cirac, J. I., & Zoller, P. (1995) · Physical Review Letters · doi:10.1103/physrevlett.74.4091 · Cited by 3,733 · cited 1×
“1996; Gershenfeld & Chuang 1997), and will soon be followed by experiments with ion trap computers (Cirac & Zoller 1995).”
Lloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 4×
“Particularly notable is the problem of understanding the capacity of noisy quantum channels for sending either quantum or classical information (Lloyd 1996; Bennett et al. 1996; Shor & Smolin 1996; Schumacher & Nielsen 1996; Barnum et al. 1997; Bennett et al. 1997; Holevo 1996; Fuchs 1997).”
InfluentialGood quantum error-correcting codes exist
Calderbank, A. R., & Shor, P. W. (1996) · Physical Review A · doi:10.1103/physreva.54.1098 · Cited by 2,516 · cited 1×
“It has been a truly stunning discovery that, using quantum error correction, it is actually possible to restandardize a coherent quantum signal (Shor 1995; Steane 1996 a; b ; Calderbank & Shor 1996).”
Quantum State Transfer and Entanglement Distribution among Distant Nodes in a Quantum Network
Cirac, J. I., Zoller, P., Kimble, H. J., & Mabuchi, H. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.3221 · Cited by 2,215 · cited 1×
“In the case of a cavity QED device, a promising suggestion for distributing entanglement was made by Cirac et al .”
Observing the Progressive Decoherence of the “Meter” in a Quantum Measurement
Brune, M., Hagley, E., Dreyer, J., Maître, X., Maali, A., Wunderlich, C., Raimond, J. M., & Haroche, S. (1996) · Physical Review Letters · doi:10.1103/physrevlett.77.4887 · Cited by 1,651
Demonstration of a Fundamental Quantum Logic Gate
Monroe, C., Meekhof, D. M., King, B. E., Itano, W. M., & Wineland, D. J. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.4714 · Cited by 1,586
Bulk Spin-Resonance Quantum Computation
Gershenfeld, N. A., & Chuang, I. L. (1997) · Science · doi:10.1126/science.275.5298.350 · Cited by 1,528
Strengths and Weaknesses of Quantum Computing
Bennett, C. H., Bernstein, E., Brassard, G., & Vazirani, U. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796300933 · Cited by 1,470 · cited 1×
“In this connection, an important result was obtained by Bennett, Bernstein, Brassard, and Vazirani (1997a) , who showed that Grover’s algorithm for the database search problem is actually optimal; no quantum algorithm can solve the problem faster than time of order p N. This result suggests that quantum computers may…”
Measurement of Conditional Phase Shifts for Quantum Logic
Turchette, Q. A., Hood, C. J., Lange, W., Mabuchi, H., & Kimble, H. J. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.4710 · Cited by 1,409
On the Power of Quantum Computation
Simon, D. R. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539796298637 · Cited by 1,295
Bernstein, E., & Vazirani, U. (1993) · Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 · doi:10.1145/167088.167097 · Cited by 1,284
Multiple-particle interference and quantum error correction
(1996) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1996.0136 · Cited by 1,284
The capacity of the quantum channel with general signal states
Holevo, A. S. (1998) · IEEE Transactions on Information Theory · doi:10.1109/18.651037 · Cited by 1,176
Optimal frequency measurements with maximally correlated states
Bollinger, J. J., Itano, W. M., Wineland, D. J., & Heinzen, D. J. (1996) · Physical Review A · doi:10.1103/physreva.54.r4649 · Cited by 1,167
Generation of Nonclassical Motional States of a Trapped Atom
Meekhof, D. M., Monroe, C., King, B. E., Itano, W. M., & Wineland, D. J. (1996) · Physical Review Letters · doi:10.1103/physrevlett.76.1796 · Cited by 1,135
Improvement of Frequency Standards with Quantum Entanglement
Huelga, S. F., Macchiavello, C., Pellizzari, T., Ekert, A. K., Plenio, M. B., & Cirac, J. I. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.3865 · Cited by 999 · cited 1×
“y However, the improvement in precision that can be attained by using entangled states will be severely limited by decoherence eects|while entangled states oscillate faster than unentangled states, they also decohere more rapidly ( Huelga et al. 1997 ).”
Preskill, J. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0167 · Cited by 994
Self-citationA Potentially Realizable Quantum Computer
Lloyd, S. (1993) · Science · doi:10.1126/science.261.5128.1569 · Cited by 649 · cited 1×
“For example, as Lloyd (1993) has advocated, a molecular machine is likely to operate more like a quantum cellular automaton than like the quantum gate circuits that most theorists usually envision.”
Fault-tolerant quantum computation with constant error
Aharonov, D., & Ben-Or, M. (1997) · Proceedings of the twenty-ninth annual ACM symposium on Theory of computing - STOC '97 · doi:10.1145/258533.258579 · Cited by 631
On the power of quantum computation
Simon, D. R. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365701 · Cited by 491 · cited 2×
“For example, few-body correlations in the ground state can usually be computed in polynomial time on a classical computer. y Daniel Simon (1994) actually paved the way for Shor’s factoring algorithm, by exhibiting the (cid:12)rst example of a quantum algorithm that e(cid:14)ciently solves an interesting hard problem.…”
Codes for the quantum erasure channel
Grassl, M., Beth, T., & Pellizzari, T. (1997) · Physical Review A · doi:10.1103/physreva.56.33 · Cited by 374 · cited 1×
“After the replacement, a leakage error becomes an error in a known location that can easily be dealt with using standard error-correction procedures (Grassl et al. 1996).”
Capacities of Quantum Erasure Channels
Bennett, C. H., DiVincenzo, D. P., & Smolin, J. A. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.3217 · Cited by 365 · cited 1×
“Particularly notable is the problem of understanding the capacity of noisy quantum channels for sending either quantum or classical information (Lloyd 1996; Bennett et al. 1996; Shor & Smolin 1996; Schumacher & Nielsen 1996; Barnum et al. 1997; Bennett et al. 1997b; Holevo 1996; Fuchs 1997).”
Resilient quantum computation: error models and thresholds
Knill, E., Laflamme, R., & Zurek, W. H. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0166 · Cited by 346
Quantum Error Correction with Imperfect Gates
Kitaev, A. Y. (1997) · Quantum Communication, Computing, and Measurement · doi:10.1007/978-1-4615-5923-8_19 · Cited by 214 · cited 1×
“Kitaev (1997) has also made the ingenious suggestion that fault-tolerant quantum gates might be realized in a suitable medium by exchanging quasiparticles that obey an exotic version of two-dimensional quantum statistics.”
Simulating quantum mechanics on a quantum computer
Boghosian, B. M., & Taylor, W. (1998) · Physica D: Nonlinear Phenomena · doi:10.1016/s0167-2789(98)00042-6 · Cited by 120 · cited 2×
“…detail how quantum computers would be used as quantum simulators, so that we can better assess the advantages that quantum computers will enjoy over future classical computers (Lloyd 1996; Zalka 1996 a ; Wiesner 1996; Meyer 1996; Lidar & Biham 1996; Abrams & Lloyd 1997; Boghosian & Taylor 1997).”
Quantum mechanics of lattice gas automata: One-particle plane waves and potentials
Meyer, D. A. (1997) · Physical Review E · doi:10.1103/physreve.55.5261 · Cited by 101
Enforcing Coherent Evolution in Dissipative Quantum Dynamics
Cirac, J. I., Pellizzari, T., & Zoller, P. (1996) · Science · doi:10.1126/science.273.5279.1207 · Cited by 89 · cited 1×
“Of the 'current' quantum computing technologies, those based on cavity QED probably have the best long-term potential (Cirac et al. 1996).”
Polynomial simulations of decohered quantum computers
Aharonov, D., & Ben-Or, M. (2002) · Proceedings of 37th Conference on Foundations of Computer Science · doi:10.1109/sfcs.1996.548463 · Cited by 41 · cited 1×
“1996, 1997; Aharonov & Ben-Or 1996 a ; Kitaev 1996 b ; Gottesman et al .”
Cited by
Gottesman, D., & Chuang, I. L. (1999) · Nature · doi:10.1038/46503 · Cited by 1,860
Conditions for a class of entanglement transformations
Nielsen, M. A. (1999) · Physical Review Letters · doi:10.1103/physrevlett.83.436 · Cited by 1,036
Preskill, J. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0167 · Cited by 994
Self-citationComplete quantum teleportation using nuclear magnetic resonance
Nielsen, M. A., Knill, E., & Laflamme, R. (1998) · Nature · doi:10.1038/23891 · Cited by 548
Universal Fault-Tolerant Quantum Computation on Decoherence-Free Subspaces
Bacon, D., Kempe, J., Lidar, D. A., & Whaley, K. B. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.1758 · Cited by 362
Metadata
- Authors
- Preskill, J.
- Venue
- Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
- Publisher
- The Royal Society
- Published
- 1998-01-08
- Volume
- 454
- Issue
- 1969
- Pages
- 469-486
- ISSN
- 1364-5021 (ISSN-L)
- 1471-2946
- OpenAlex
- W2164921316
- Cited by
- 126
- References
- 35
- FWCI
- 11.38
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.