The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Quantum Key Distribution in the Holevo Limit
Open accessAbstract
A theorem by Shannon and the Holevo theorem impose that the efficiency of any protocol for quantum key distribution, E, defined as the number of secret (i.e., allowing eavesdropping detection) bits per transmitted bit plus qubit, is E < or = 1. The problem addressed here is whether the limit E = 1 can be achieved. It is showed that it can be done by splitting the secret bits between several qubits and forcing Eve to have only a sequential access to the qubits, as proposed by Goldenberg and Vaidman. A protocol with E = 1 based on polarized photons and in which Bob's state discrimination can be implemented with linear optical elements is presented.
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
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb01338.x · Cited by 88,486
A Mathematical Theory of Communication
Shannon, C. E. (1948) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1948.tb00917.x · Cited by 48,949
Quantum cryptography based on Bell’s theorem
Ekert, A. K. (1991) · Physical Review Letters · doi:10.1103/physrevlett.67.661 · Cited by 10,777
Experimental quantum teleportation
Bouwmeester, D., Pan, J.-W., Mattle, K., Eibl, M., Weinfurter, H., & Zeilinger, A. (1997) · Nature · doi:10.1038/37539 · Cited by 5,545
A single quantum cannot be cloned
Wootters, W. K., & Zurek, W. H. (1982) · Nature · doi:10.1038/299802a0 · Cited by 5,406
Quantum cryptography using any two nonorthogonal states
Bennett, C. H. (1992) · Physical Review Letters · doi:10.1103/physrevlett.68.3121 · Cited by 3,028
Quantum cryptography without Bell’s theorem
Bennett, C. H., Brassard, G., & Mermin, N. D. (1992) · Physical Review Letters · doi:10.1103/physrevlett.68.557 · Cited by 2,460
Dieks, D. (1982) · Physics Letters A · doi:10.1016/0375-9601(82)90084-6 · Cited by 1,461
Dense Coding in Experimental Quantum Communication
Mattle, K., Weinfurter, H., Kwiat, P. G., & Zeilinger, A. (1996) · Physical Review Letters · doi:10.1103/physrevlett.76.4656 · Cited by 1,342
Bell inequality for position and time
Franson, J. D. (1989) · Physical Review Letters · doi:10.1103/physrevlett.62.2205 · Cited by 1,168
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
Two-step quantum direct communication protocol using the Einstein-Podolsky-Rosen pair block
Deng, F.-G., Long, G. L., & Liu, X.-S. (2003) · Physical Review A · doi:10.1103/physreva.68.042317 · Cited by 1,771
Theoretically efficient high-capacity quantum-key-distribution scheme
Long, G. L., & Liu, X. S. (2002) · Physical Review A · doi:10.1103/physreva.65.032302 · Cited by 1,741
Controlled order rearrangement encryption for quantum key distribution
Deng, F.-G., & Long, G. L. (2003) · Physical Review A · doi:10.1103/physreva.68.042315 · Cited by 468
Symmetric multiparty-controlled teleportation of an arbitrary two-particle entanglement
Deng, F.-G., Li, C.-Y., Li, Y.-S., Zhou, H.-Y., & Wang, Y. (2005) · Physical Review A · doi:10.1103/physreva.72.022338 · Cited by 445
Secure Deterministic Communication without Entanglement
Lucamarini, M., & Mancini, S. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.140501 · Cited by 430
Efficient quantum key distribution over a collective noise channel
Li, X.-H., Deng, F.-G., & Zhou, H.-Y. (2008) · Physical Review A · doi:10.1103/physreva.78.022321 · Cited by 387
A scheme for secure direct communication using EPR pairs and teleportation
Yan, F. L., & Zhang, X. Q. (2004) · The European Physical Journal B · doi:10.1140/epjb/e2004-00296-4 · Cited by 301
Improving the capacity of the Boström-Felbinger protocol
Cai, Q.-Y., & Li, B.-W. (2004) · Physical Review A · doi:10.1103/physreva.69.054301 · Cited by 261
Secure Quantum Key Distribution Network with Bell States and Local Unitary Operations
Chun-Yan, L., Hong-Yu, Z., Yan, W., & Fu-Guo, D. (2005) · Chinese Physics Letters · doi:10.1088/0256-307x/22/5/006 · Cited by 260
Machine learning for precise quantum measurement
Hentschel, A., & Sanders, B. C. (2010) · Physical Review Letters · doi:10.1103/physrevlett.104.063603 · Cited by 197
Metadata
- Authors
- Cabello, A.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 2000-12-25
- Volume
- 85
- Issue
- 26
- Pages
- 5635-5638
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W2108968134
- Cited by
- 634
- References
- 19
- FWCI
- 3.33
- Type
- journal article
- Language
- en
- Open access
- bronze
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.