Quantum information processing: cryptography, computation, and teleportation
The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Abstract
Present information technology is based on the laws of classical physics. However, advances in quantum physics have stimulated interest in its potential impact on such technology. This article is an introductory review of three aspects of quantum information processing, cryptography, computation, and teleportation. The author serves up hors d'oeuvres on the relevant parts of quantum physics and the sorts of quantum systems which might form the building blocks for quantum processors. Quantum cryptography utilizes states of individual quantum systems for the transfer of conventional classical bits of information. The impossibility of measuring quantum systems without disturbing them guarantees the detection of eavesdropping and hence secure information transfer is possible. In a sense, teleportation is the inverse of cryptography, using more robust classical bits to faithfully transfer a quantum state through a noisy environment. Quantum computation utilizes the evolving quantum state of a complex system, which consists of many interacting individuals. If such a machine could be built, it would be capable of solving some problems which are intractable on any conventional computer; he illustrates this with Shor's (see Proc. 35th IEEE Symposium on Foundations of Computer Science, p.124, 1994) quantum factoring algorithm. Details are given of the current experimental achievements, proposals, and prospects for the future and of the patents granted to date.
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
Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
Einstein, A., Podolsky, B., & Rosen, N. (1935) · Physical Review · doi:10.1103/physrev.47.777 · Cited by 16,654
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703
On the Einstein Podolsky Rosen paradox
Bell, J. S. (1964) · Physics Physique Fizika · doi:10.1103/physicsphysiquefizika.1.195 · Cited by 12,252
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
Quantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2014) · Theoretical Computer Science · doi:10.1016/j.tcs.2014.05.025 · Cited by 8,299
Quantum cryptography: Public key distribution and coin tossing
Bennett, C. H., & Brassard, G. (2020) · arXiv · doi:10.48550/arxiv.2003.06557 · Cited by 8,299
On computable numbers, with an application to the entscheidungsproblem
Turing, A. M. (1937) · Proceedings of the London Mathematical Society · doi:10.1112/plms/s2-42.1.230 · Cited by 8,283
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
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
Elementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311
Experimental Test of Bell's Inequalities Using Time- Varying Analyzers
Aspect, A., Dalibard, J., & Roger, G. (1982) · Physical Review Letters · doi:10.1103/physrevlett.49.1804 · Cited by 3,942
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
Logical Reversibility of Computation
Bennett, C. H. (1973) · IBM Journal of Research and Development · doi:10.1147/rd.176.0525 · Cited by 3,679
On the Problem of Hidden Variables in Quantum Mechanics
BELL, J. S. (1966) · Reviews of Modern Physics · doi:10.1103/revmodphys.38.447 · Cited by 2,845
Good 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
The thermodynamics of computation—a review
Bennett, C. H. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02084158 · Cited by 2,006
Fredkin, E., & Toffoli, T. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf01857727 · Cited by 1,896
DiVincenzo, D. P. (1995) · Science · doi:10.1126/science.270.5234.255 · 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
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
Quantum computation and Shor's factoring algorithm
Ekert, A., & Jozsa, R. (1996) · Reviews of Modern Physics · doi:10.1103/revmodphys.68.733 · Cited by 1,354
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
Quantum computational networks
Deutsch, D. E. (1989) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1989.0099 · Cited by 1,270
Benioff, P. (1980) · Journal of Statistical Physics · doi:10.1007/bf01011339 · Cited by 1,244
Two-bit gates are universal for quantum computation
DiVincenzo, D. P. (1995) · Physical Review A · doi:10.1103/physreva.51.1015 · Cited by 1,069
Feynman, R. P. (1985) · Optics News · doi:10.1364/on.11.2.000011 · Cited by 1,023
Shih, Y. H., & Alley, C. O. (1988) · Physical Review Letters · doi:10.1103/physrevlett.61.2921 · Cited by 917
Quantum computers and dissipation
(1996) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1996.0029 · Cited by 899
Violation of Bell's Inequality and Classical Probability in a Two-Photon Correlation Experiment
Ou, Z. Y., & Mandel, L. (1988) · Physical Review Letters · doi:10.1103/physrevlett.61.50 · Cited by 879
Observation of Berry's Topological Phase by Use of an Optical Fiber
Tomita, A., & Chiao, R. Y. (1986) · Physical Review Letters · doi:10.1103/physrevlett.57.937 · Cited by 810
Almost Any Quantum Logic Gate is Universal
Lloyd, S. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.346 · Cited by 690
A Potentially Realizable Quantum Computer
Lloyd, S. (1993) · Science · doi:10.1126/science.261.5128.1569 · Cited by 649
Experimental violation of Bell’s inequality based on phase and momentum
Rarity, J. G., & Tapster, P. R. (1990) · Physical Review Letters · doi:10.1103/physrevlett.64.2495 · Cited by 612
Manifestations of Berry's Topological Phase for the Photon
Chiao, R. Y., & Wu, Y.-S. (1986) · Physical Review Letters · doi:10.1103/physrevlett.57.933 · Cited by 482
Quantum mechanical Hamiltonian models of Turing machines
Benioff, P. (1982) · Journal of Statistical Physics · doi:10.1007/bf01342185 · Cited by 402
Practical quantum cryptography based on two-photon interferometry
Ekert, A. K., Rarity, J. G., Tapster, P. R., & Massimo Palma, G. (1992) · Physical Review Letters · doi:10.1103/physrevlett.69.1293 · Cited by 340
A New Proof of the Quantum Noiseless Coding Theorem
Jozsa, R., & Schumacher, B. (1994) · Journal of Modern Optics · doi:10.1080/09500349414552191 · Cited by 304
Quantum Computers, Factoring, and Decoherence
Chuang, I. L., Laflamme, R., Shor, P. W., & Zurek, W. H. (1995) · Science · doi:10.1126/science.270.5242.1633 · Cited by 289
Structural basis of multistationary quantum systems. II. Effective few-particle dynamics
Teich, W. G., Obermayer, K., & Mahler, G. (1988) · Physical Review B · doi:10.1103/physrevb.37.8111 · Cited by 64
Cited by
Steane, A. (1998) · Reports on Progress in Physics · doi:10.1088/0034-4885/61/2/002 · Cited by 1,391
Steane, A. (1997) · arXiv · doi:10.48550/arxiv.quant-ph/9708022 · Cited by 1,390
Josephson Persistent-Current Qubit
Mooij, J. E., Orlando, T. P., Levitov, L., Tian, L., van der Wal, C. H., & Lloyd, S. (1999) · Science · doi:10.1126/science.285.5430.1036 · Cited by 1,373
Superconducting persistent-current qubit
Orlando, T. P., Mooij, J. E., Tian, L., van der Wal, C. H., Levitov, L. S., Lloyd, S., & Mazo, J. J. (1999) · Physical Review B · doi:10.1103/physrevb.60.15398 · Cited by 756
Fiber Optical Parametric Amplifiers, Oscillators and Related Devices
Marhic, M. E. (2007) · Cambridge University Press eBooks · doi:10.1017/cbo9780511600265 · Cited by 360
Metadata
- Authors
- Spiller, T. P.
- Venue
- Proceedings of the IEEE
- Published
- 1996
- Volume
- 84
- Issue
- 12
- Pages
- 1719-1746
- ISSN
- 0018-9219 (ISSN-L)
- OpenAlex
- W2111785678
- Cited by
- 78
- References
- 41
- FWCI
- 9.61
- Type
- journal article
- Language
- en
- Open access
- closed
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.