Cited by 1,268Quantum Information and CryptographyQuantum Computing Algorithms and ArchitectureCryptography and Data Security

Quantum Privacy Amplification and the Security of Quantum Cryptography over Noisy Channels

Open access
Deutsch, David, Ekert, Artur, Jozsa, Richard, Macchiavello, Chiara, Popescu, Sandu, Sanpera, Anna·1996·Physical Review Letters

Abstract

Existing quantum cryptographic schemes are not, as they stand, operable in the presence of noise on the quantum communication channel. Although they become operable if they are supplemented by classical privacy-amplification techniques, the resulting schemes are difficult to analyze and have not been proved secure. We introduce the concept of quantum privacy amplification and a cryptographic scheme incorporating it which is provably secure over a noisy channel. The scheme uses an ``entanglement purification'' procedure which, because it requires only a few quantum controlled-not and single-qubit operations, could be implemented using technology that is currently being developed.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physrevlett.77.2818

Cites

4 of 4 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Entanglement distillation, concentration and purification are important tools to overcome noise in the quantum communication channel.

    “An important tool to overcome the noise in the quantum communication channel is entanglement distillation, concentration and purification, proposed by Bennett et al. (1996aBennett et al. ( , 1996bBennett et al. ( , 1996c) ) and Deutsch et al. (1996).”

    From Multiphoton entanglement and interferometry (2012) · cites this paper as Deutsch et al. (1996)

    The Abstract (p. 1) describes an entanglement-purification procedure in a cryptographic scheme secure over a noisy quantum channel; the discussion on p. 4 explains how it produces nearly pure, maximally entangled pairs from mixed pairs. This supports purification as a way to address channel noise, but our copy does not establish entanglement concentration as a separate tool proposed by Deutsch et al. (LLM, conf=0.84)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 2

  1. [1][1] C.H. Bennett and G. Brassard, in Proceedings of IEEE International Conference on Computers, Systems and Signal Processing , Bangalore, India (IEEE, 1984) p. 175. -
  2. [4][4] C.H. Bennett, G. Brassard, and J.-M. Robert, SIAM J. Comp. 17 , 210 (1988); C.H. Bennett, G. Brassard, C. Cr´ epeau, and U.M. Maurer, 'Generalized privacy amplification', IEEE Trans. on Information Theory, Vol. IT-41, no. 6, November 1995, in press. -

Cited by

Sorted by citations

Authors
Deutsch, D., Ekert, A., Jozsa, R., Macchiavello, C., Popescu, S., & Sanpera, A.
Affiliations
  • University of Oxford (GB)
  • University of Plymouth (GB)
  • Boston University (US)
Venue
Physical Review Letters
Published
1996-09-23
Volume
77
Issue
13
Pages
2818-2821
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W2063635674
Cited by
1,268
References
4
Citations by year
2026: 47 · 2025: 90 · 2024: 52 · 2023: 53 · 2022: 39 · 2021: 54 · 2020: 35 · 2019: 43 · 2018: 33 · 2017: 44 · 2016: 45 · 2015: 40 · 2014: 54 · 2013: 42 · 2012: 58
FWCI
31.54
Type
journal article
Language
en
Open access
Locations
  • Physical Review Letters (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
  • Bristol Research (University of Bristol) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
Keywords
quantum cryptography, noisy quantum channels, entanglement distillation, provable security, CNOT gate, single-qubit operations, quantum key distribution

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