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
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Quantum information processing: cryptography, computation, and teleportation. https://app.cochat.ai/papers/10.1109/5.546399
- The paper
- Spiller, T. P. (1996). Quantum information processing: cryptography, computation, and teleportation. Proceedings of the IEEE. https://doi.org/10.1109/5.546399
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.