1996
DOI: 10.1103/physrevlett.77.2818
|View full text |Cite|
|
Sign up to set email alerts
|

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

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 analyse 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' pr… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

3
1,157
2
1

Year Published

1997
1997
2012
2012

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 1,131 publications
(1,181 citation statements)
references
References 14 publications
3
1,157
2
1
Order By: Relevance
“…Entanglement distillation 4,5 extracts from several shared copies of weakly entangled mixed states a single copy of a highly entangled state using only local quantum operations and classical communication between the two parties sharing the states. This turned out to be a very challenging task for continuous-variable states, because it was proved that it is impossible to distil Gaussian entangled states by means of the experimentally accessible Gaussian operations 18,19 .…”
mentioning
confidence: 99%
“…Entanglement distillation 4,5 extracts from several shared copies of weakly entangled mixed states a single copy of a highly entangled state using only local quantum operations and classical communication between the two parties sharing the states. This turned out to be a very challenging task for continuous-variable states, because it was proved that it is impossible to distil Gaussian entangled states by means of the experimentally accessible Gaussian operations 18,19 .…”
mentioning
confidence: 99%
“…Popescu's construction [14] did not work for spaces with fewer than 5 2 dimensions, but similar protocols have been found [16][17][18][19] for Werner pairs of spin-1 2 particles. If each one of these pairs is tested separately, the CHSH inequality is satisfied, as we know.…”
mentioning
confidence: 89%
“…[16][17][18][19] for advance copies of their articles, and to N. D. Mermin and S. Popescu for an illuminating exchange of correspondence. This work was supported by the Gerard Swope Fund, and the Fund for Encouragement of Research.…”
mentioning
confidence: 99%
“…This approach combines both the potential for relatively long relaxation times and large degree of design flexibility, and probably represents one of the best, if not the best, hope for realization of a quantum computer of medium complexity. Such a computer, while not being sufficient for factorization of large numbers of practical interest, could be sufficiently complex to perform privacy amplification [12,13] in quantum communication channels.…”
mentioning
confidence: 99%