The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Fundamental rate-loss tradeoff for optical quantum key distribution
Open accessAbstract
Since 1984, various optical quantum key distribution (QKD) protocols have been proposed and examined. In all of them, the rate of secret key generation decays exponentially with distance. A natural and fundamental question is then whether there are yet-to-be discovered optical QKD protocols (without quantum repeaters) that could circumvent this rate-distance tradeoff. This paper provides a major step towards answering this question. Here we show that the secret key agreement capacity of a lossy and noisy optical channel assisted by unlimited two-way public classical communication is limited by an upper bound that is solely a function of the channel loss, regardless of how much optical power the protocol may use. Our result has major implications for understanding the secret key agreement capacity of optical channels—a long-standing open problem in optical quantum information theory—and strongly suggests a real need for quantum repeaters to perform QKD at high rates over long distances. An open question in quantum key distribution (QKD) is whether there exist protocols avoiding the exponential decay of the secret key generation rate with distance. Takeoka et al.show a fundamental tradeoff between the secret-key generation rate and the channel loss for optical repeater-less QKD protocols.
Overview
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.
Integrity signals
Registry
Cites
Statistics
Verification
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.
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
Quantum cryptography based on Bell’s theorem
Ekert, A. K. (1991) · Physical Review Letters · doi:10.1103/physrevlett.67.661 · Cited by 10,777
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
All-photonic quantum repeaters
Azuma, K., Tamaki, K., & Lo, H.-K. (2015) · Nature Communications · doi:10.1038/ncomms7787 · Cited by 583
Relative entropy and the Wigner-Yanase-Dyson-Lieb concavity in an interpolation theory
Uhlmann, A. (1977) · Communications in Mathematical Physics · doi:10.1007/bf01609834 · Cited by 431
Capacities of Quantum Erasure Channels
Bennett, C. H., DiVincenzo, D. P., & Smolin, J. A. (1997) · Physical Review Letters · doi:10.1103/physrevlett.78.3217 · Cited by 365
Cited by
Quantum internet: a vision for the road ahead
Wehner, S., Elkouss, D., & Hanson, R. (2018) · Science · doi:10.1126/science.aam9288 · Cited by 2,467
Advances in quantum cryptography
Pirandola, S., Andersen, U. L., Banchi, L., Berta, M., Bunandar, D., Colbeck, R., Englund, D., Gehring, T., Lupo, C., Ottaviani, C., et al. (2020) · Advances in Optics and Photonics · doi:10.1364/aop.361502 · Cited by 2,033
Secure quantum key distribution with realistic devices
Xu, F., Ma, X., Zhang, Q., Lo, H.-K., & Pan, J.-W. (2020) · Reviews of Modern Physics · doi:10.1103/revmodphys.92.025002 · Cited by 1,543
Overcoming the rate–distance limit of quantum key distribution without quantum repeaters
Lucamarini, M., Yuan, Z. L., Dynes, J. F., & Shields, A. J. (2018) · Nature · doi:10.1038/s41586-018-0066-6 · Cited by 1,247
High-rate measurement-device-independent quantum cryptography
Pirandola, S., Ottaviani, C., Spedalieri, G., Weedbrook, C., Braunstein, S. L., Lloyd, S., Gehring, T., Jacobsen, C. S., & Andersen, U. L. (2015) · Nature Photonics · doi:10.1038/nphoton.2015.83 · Cited by 476
Metadata
- Authors
- Takeoka, M., Guha, S., & Wilde, M. M.
- Venue
- Nature Communications
- Published
- 2014-10-24
- Volume
- 5
- Issue
- 1
- Pages
- 5235-5235
- ISSN
- 2041-1723 (ISSN-L)
- OpenAlex
- W2087526127
- Cited by
- 456
- References
- 5
- FWCI
- 18.16
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Fundamental rate-loss tradeoff for optical quantum key distribution. https://app.cochat.ai/papers/10.1038/ncomms6235
- The paper
- Takeoka, M., Guha, S., & Wilde, M. M. (2014). Fundamental rate-loss tradeoff for optical quantum key distribution. Nature Communications. https://doi.org/10.1038/ncomms6235
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.