The DOI matches its Crossref record; 45 of the 45 references it cites were found in a registry or an index.
Unconditional Security of Quantum Key Distribution over Arbitrarily Long Distances
Open accessAbstract
Quantum key distribution is widely thought to offer unconditional security in communication between two users. Unfortunately, a widely accepted proof of its security in the presence of source, device, and channel noises has been missing. This long-standing problem is solved here by showing that, given fault-tolerant quantum computers, quantum key distribution over an arbitrarily long distance of a realistic noisy channel can be made unconditionally secure. The proof is reduced from a noisy quantum scheme to a noiseless quantum scheme and then from a noiseless quantum scheme to a noiseless classical scheme, which can then be tackled by classical probability theory.
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 · cited 1×
“ity of the noiseless quantum scheme to that of a classical verification scheme. This is highly non-trivial and may even seem paradoxical: It is a well-known result (the EinsteinPodolsky-Rosen paradox) [2,12,15] that entangled quantum mechanical systems generally exhibit subtle correlations which have no classical analo…”
BackgroundQuantum cryptography based on Bell’s theorem
Ekert, A. K. (1991) · Physical Review Letters · doi:10.1103/physrevlett.67.661 · Cited by 10,777
A single quantum cannot be cloned
Wootters, W. K., & Zurek, W. H. (1982) · Nature · doi:10.1038/299802a0 · Cited by 5,406
Mixed-state entanglement and quantum error correction
Bennett, C. H., DiVincenzo, D. P., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review A · doi:10.1103/physreva.54.3824 · Cited by 5,272
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 Repeaters: The Role of Imperfect Local Operations in Quantum Communication
Briegel, H.-J., Dür, W., Cirac, J. I., & Zoller, P. (1998) · Physical Review Letters · doi:10.1103/physrevlett.81.5932 · Cited by 3,481
Concentrating partial entanglement by local operations
Bennett, C. H., Bernstein, H. J., Popescu, S., & Schumacher, B. (1996) · Physical Review A · doi:10.1103/physreva.53.2046 · Cited by 3,111
Quantum cryptography using any two nonorthogonal states
Bennett, C. H. (1992) · Physical Review Letters · doi:10.1103/physrevlett.68.3121 · Cited by 3,028
Error Correcting Codes in Quantum Theory
Steane, A. M. (1996) · Physical Review Letters · doi:10.1103/physrevlett.77.793 · Cited by 2,677
Experimental Test of Local Hidden-Variable Theories
Freedman, S. J., & Clauser, J. F. (1972) · Physical Review Letters · doi:10.1103/physrevlett.28.938 · Cited by 1,999 · cited 1×
“oky action at a distance is a counter-intuitive feature of quantum mechanics that defies any simple classical explanation and puzzled Einstein [26]. However, it has proven to be correct by experiments [27]. In summary, the Einstein-Podolsky-Rosen (EPR) paradox demonstrates that some (but not all) quantum mechanical exp…”
BackgroundExperimental quantum cryptography
Bennett, C. H., Bessette, F., Brassard, G., Salvail, L., & Smolin, J. (1992) · Journal of Cryptology · doi:10.1007/bf00191318 · Cited by 1,614
Wiesner, S. (1983) · ACM SIGACT News · doi:10.1145/1008908.1008920 · Cited by 1,520
Dieks, D. (1982) · Physics Letters A · doi:10.1016/0375-9601(82)90084-6 · Cited by 1,461
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424
Quantum Privacy Amplification and the Security of Quantum Cryptography over Noisy Channels
Deutsch, D., Ekert, A., Jozsa, R., Macchiavello, C., Popescu, S., & Sanpera, A. (1996) · Physical Review Letters · doi:10.1103/physrevlett.77.2818 · Cited by 1,268
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
Unconditionally Secure Quantum Bit Commitment is Impossible
Mayers, D. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.3414 · Cited by 748
Quantum repeaters based on entanglement purification
Dür, W., Briegel, H.-J., Cirac, J. I., & Zoller, P. (1999) · Physical Review A · doi:10.1103/physreva.59.169 · Cited by 721
Knill, E., Laflamme, R., & Zurek, W. H. (1998) · Science · doi:10.1126/science.279.5349.342 · Cited by 663
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
Is Quantum Bit Commitment Really Possible?
Lo, H.-K., & Chau, H. F. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.3410 · Cited by 606
Self-citationInsecurity of quantum secure computations
Lo, H.-K. (1997) · Physical Review A · doi:10.1103/physreva.56.1154 · Cited by 479
Self-citationOptimal eavesdropping in quantum cryptography. I. Information bound and optimal strategy
Fuchs, C. A., Gisin, N., Griffiths, R. B., Niu, C.-S., & Peres, A. (1997) · Physical Review A · doi:10.1103/physreva.56.1163 · Cited by 474
Semiclassical Fourier Transform for Quantum Computation
Griffiths, R. B., & Niu, C.-S. (1996) · Physical Review Letters · doi:10.1103/physrevlett.76.3228 · Cited by 431
"Plug and play" systems for quantum cryptography
Muller, A., Herzog, T., Huttner, B., Tittel, W., Zbinden, H., & Gisin, N. (1996) · Cited by 292
Why quantum bit commitment and ideal quantum coin tossing are impossible
Lo, H.-K., & Chau, H. F. (1998) · Physica D Nonlinear Phenomena · doi:10.1016/s0167-2789(98)00053-0 · Cited by 260
Self-citationIdeal Quantum Communication over Noisy Channels: A Quantum Optical Implementation
van Enk, S. J., Cirac, J. I., & Zoller, P. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.4293 · Cited by 227
Quantum Key Distribution and String Oblivious Transfer in Noisy Channels
Mayers, D. (1996) · Lecture Notes in Computer Science · doi:10.1007/3-540-68697-5_26 · Cited by 199
Why Quantum Bit Commitment And Ideal Quantum Coin Tossing Are Impossible
Lo, H.-K., & Chau, H. F. (1998) · CERN Document Server (European Organization for Nuclear Research) · Cited by 177
Self-citationQuantum cryptography over 23 km in installed under-lake telecom fibre
Muller, A., Zbinden, H., & Gisin, N. (1996) · Europhysics Letters (EPL) · doi:10.1209/epl/i1996-00343-4 · Cited by 167
Security of Quantum Cryptography against Collective Attacks
Biham, E., & Mor, T. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.2256 · Cited by 153
Security against eavesdropping in quantum cryptography
Lütkenhaus, N. (1996) · Physical Review A · doi:10.1103/physreva.54.97 · Cited by 145
Security of quantum protocols against coherent measurements
Yao, A. C.-C. (1995) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/225058.225085 · Cited by 142
Information Gain vs. State Disturbance in Quantum Theory
Fuchs, C. A. (1998) · Fortschritte der Physik · doi:10.1002/(sici)1521-3978(199806)46:4/5<535::aid-prop535>3.0.co;2-0 · Cited by 125
Secure key distribution system based on quantumcryptography
Townsend, P. D. (1994) · Electronics Letters · doi:10.1049/el:19940558 · Cited by 117
Bounds on Information and the Security of Quantum Cryptography
Biham, E., & Mor, T. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.4034 · Cited by 83
Quantum Cryptography over Underground Optical Fibers
Hughes, R., Luther, G. G., Morgan, G. L., Peterson, C. G., & Simmons, C. M. (1996) · Lecture notes in computer science · doi:10.1007/3-540-68697-5_25 · Cited by 75
25 years of quantum cryptography
Brassard, G., & Crépeau, C. (1996) · ACM SIGACT News · doi:10.1145/235666.235669 · Cited by 75
Deutsch, D., EKERT, A. K., Jozsa, R., Macchiavello, C., Popescu, S., & Sanpera, A. (1998) · Physical Review Letters · doi:10.1103/physrevlett.80.2022 · Cited by 59
Parity bit in quantum cryptography
Bennett, C. H., Mor, T., & Smolin, J. A. (1996) · Physical Review A · doi:10.1103/physreva.54.2675 · Cited by 53
Optimal eavesdropping in quantum cryptography. II. A quantum circuit
Griffiths, R. B., & Niu, C.-S. (1997) · Physical Review A · doi:10.1103/physreva.56.1173 · Cited by 33
Secure communications using quantum cryptography
Hughes, R., Buttler, W. T., Kwiat, P. G., Luther, G. G., Morgan, G. L., Nordholt, J. E., Peterson, C. G., & Simmons, C. M. (1997) · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · doi:10.1117/12.277644 · Cited by 24
Quantum communication and the creation of maximally entangled pairs of atoms over a noisy channel
Briegel, H. J., Dür, W., van Enk, S. J., Cirac, J. I., & Zoller, P. (1998) · Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences · doi:10.1098/rsta.1998.0252 · Cited by 10
Cited by
Horodecki, R., Horodecki, P., Horodecki, M., & Horodecki, K. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.865 · Cited by 10,118
Gisin, N., Ribordy, G., Tittel, W., & Zbinden, H. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.145 · Cited by 8,515
The security of practical quantum key distribution
Scarani, V., Bechmann-Pasquinucci, H., Cerf, N. J., Dušek, M., Lütkenhaus, N., & Peev, M. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.1301 · Cited by 3,726
Long-distance quantum communication with atomic ensembles and linear optics
Duan, L.-M., Lukin, M. D., Cirac, J. I., & Zoller, P. (2001) · Nature · doi:10.1038/35106500 · Cited by 3,609
Quantum information and computation
Bennett, C. H., & DiVincenzo, D. P. (2000) · Nature · doi:10.1038/35005001 · Cited by 3,263
Metadata
- Authors
- Lo, H.-K., & Chau, H. F.
- Venue
- Science
- Published
- 1999-03-26
- Volume
- 283
- Issue
- 5410
- Pages
- 2050-2056
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W1970006170
- Cited by
- 1,858
- References
- 45
- FWCI
- 37.43
- 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.