Long-Distance Trust-Free Quantum Key Distribution
The DOI matches its Crossref record; 38 of the 40 references it cites were found in a registry or an index, and 1 are not checked yet.
Abstract
The feasibility of trust-free long-haul quantum key distribution (QKD) is addressed. We combine measurement-device-independent QKD, as an access technology, with a quantum repeater setup, at the core of future quantum communication networks. This will provide a quantum link none of whose intermediary nodes need to be trusted, or, in our terminology, a trust-free QKD link. As the main figure of merit, we calculate the secret key generation rate when a particular probabilistic quantum repeater protocol is in use. We assume the users are equipped with imperfect single photon sources, which can possibly emit two single photons, or laser sources to implement decoy-state techniques. We consider apparatus imperfection, such as quantum efficiency and dark count of photodetectors, path loss of the channel, and writing and reading efficiencies of quantum memories. By optimizing different system parameters, we estimate the maximum distance over which users can share secret keys when a finite number of memories are employed in the repeater setup.
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
Quantum cryptography based on Bell’s theorem
Ekert, A. K. (1991) · Physical Review Letters · doi:10.1103/physrevlett.67.661 · Cited by 10,777 · cited 1×
“In the future generations of quantum networks, this trust requirement can be removed by relying on entanglement in QKD protocols [8], [9].”
MethodKimble, H. J. (2008) · Nature · doi:10.1038/nature07127 · Cited by 6,023
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 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 · cited 1×
“In order to go farther we need to develop efficient tools for purification and deterministic BSMs as was initially envisaged in [25].”
MethodMeasurement-Device-Independent Quantum Key Distribution
Lo, H.-K., Curty, M., & Qi, B. (2012) · Physical Review Letters · doi:10.1103/physrevlett.108.130503 · Cited by 2,239
Decoy state quantum key distribution
Lo, H.-K., Ma, X., & Chen, K. (2005) · Physical Review Letters · doi:10.1103/physrevlett.94.230504 · Cited by 2,138
Quantum repeaters based on atomic ensembles and linear optics
Sangouard, N., Simon, C., de Riedmatten, H., & Gisin, N. (2011) · Reviews of Modern Physics · doi:10.1103/revmodphys.83.33 · Cited by 1,888
Field test of quantum key distribution in the Tokyo QKD Network
Sasaki, M., Fujiwara, M., Ishizuka, H., Klaus, W., Wakui, K., Takeoka, M., Miki, S., Yamashita, T., Wang, Z., Tanaka, A., et al. (2011) · Optics Express · doi:10.1364/oe.19.010387 · Cited by 1,082
The SECOQC quantum key distribution network in Vienna
Peev, M., Pacher, C., Alléaume, R., Barreiro, C., Bouda, J., Boxleitner, W., Debuisschert, T., Diamanti, E., Dianati, M., Dynes, J. F., et al. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/7/075001 · Cited by 845
All-photonic quantum repeaters
Azuma, K., Tamaki, K., & Lo, H.-K. (2015) · Nature Communications · doi:10.1038/ncomms7787 · Cited by 583 · cited 3×
“proposed no-memory ones [15], [26], [27], in which, by using extensive error correction, one can literally transfer quantum”
BackgroundMethod
Cited by
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
Self-citationQuantum Machine Learning for 6G Communication Networks: State-of-the-Art and Vision for the Future
Nawaz, S. J., Sharma, S. K., Wyne, S., Patwary, M. N., & Asaduzzaman, M. (2019) · IEEE Access · doi:10.1109/access.2019.2909490 · Cited by 658
The Evolution of Quantum Key Distribution Networks: On the Road to the Qinternet
Cao, Y., Zhao, Y., Wang, Q., Zhang, J., Ng, S. X., & Hanzo, L. (2022) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2022.3144219 · Cited by 505
A Survey on Quantum Channel Capacities
Gyongyosi, L., Imre, S., & Nguyen, H. V. (2018) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2786748 · Cited by 337
Quantum Computing and Communications: An Engineering Approach
Imre, S., & Balázs, F. (2004) · Wiley eBooks · doi:10.1002/9780470869048 · Cited by 163
Metadata
- Authors
- Piparo, N. L., & Razavi, M.
- Affiliations
- University of Leeds (GB)
- ORCID
- Razavi, Mohsen
- Venue
- IEEE Journal of Selected Topics in Quantum Electronics
- Published
- 2015-05
- Volume
- 21
- Issue
- 3
- Pages
- 123-130
- ISSN
- 1077-260X (ISSN-L)
- 1558-4542
- OpenAlex
- W2092674034
- Cited by
- 41
- References
- 40
- Citations by year
- 2026: 1 · 2025: 1 · 2024: 2 · 2023: 2 · 2022: 5 · 2021: 5 · 2020: 3 · 2019: 3 · 2018: 4 · 2017: 9 · 2016: 3 · 2015: 1
- FWCI
- 4.65
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- IEEE Journal of Selected Topics in Quantum Electronics (publishedVersion)
- Funders
- European Community’s Seventh Framework Programme (277110)
- UK Engineering and Physical Sciences Research Council (EP/J005762/1)
- Topics
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum optics and atomic interactions
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Semiconductor Quantum Structures and Devices
- Keywords
- quantum key distribution, measurement-device-independent QKD, quantum repeaters, secret key rate, decoy-state QKD, quantum memory, quantum efficiency, path loss, quantum communication networks
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: Long-Distance Trust-Free Quantum Key Distribution. https://app.cochat.ai/papers/10.1109/jstqe.2014.2364129
- The paper
- Piparo, N. L., & Razavi, M. (2015). Long-Distance Trust-Free Quantum Key Distribution. IEEE Journal of Selected Topics in Quantum Electronics. https://doi.org/10.1109/jstqe.2014.2364129
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.