Quantum internet: A vision for the road ahead
Open accessThe DOI matches its Crossref record; 100 of the 103 references it cites were found in a registry or an index, and 3 are not checked yet.
Abstract
The stages of a quantum internet: As indispensable as the internet has become in our daily lives, it still has many shortcomings, not least of which is that communication can be intercepted and information stolen. If, however, the internet attained the capability of transmitting quantum information—qubits—many of these security concerns would be addressed. Wehner et al. review what it will take to achieve this so-called quantum internet and propose stages of development that each correspond to increasingly powerful applications. Although a full-blown quantum internet, with functional quantum computers as nodes connected through quantum communication channels, is still some ways away, the first long-range quantum networks are already being planned. Science , this issue p. eaam9288
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
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?
In the citing paper
“In this context, diamond's ability to host paramagnetic, optically active atomic defects [55], such as the nitrogen-vacancy (NV) colour centre [56], has led to its widespread recognition as a promising material for QIP [57].”
From 2022 Roadmap on integrated quantum photonics (2022) · cites this paper as [57]
In the citing paper
“Over the past decade, color centers in diamond have been explored with the goal of utilizing their optically accessible spin for the implementation of quantum photonics and quantum networks [57,58].”
From 2022 Roadmap on integrated quantum photonics (2022) · cites this paper as [57]
In the citing paper
“The highest rate of photon-mediated entanglement between two NV center spins is currently 39 Hz [57,146].”
From 2022 Roadmap on integrated quantum photonics (2022) · cites this paper as [57]
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
Kimble, H. J. (2008) · Nature · doi:10.1038/nature07127 · Cited by 6,023
The security of practical quantum key distribution
Scarani, V., Bechmann-Pasquinucci, H., Cerf, N. J., Dušek, M., Lütkenhaus, N., & Peev, M. (2009) · Reviews of Modern Physics · doi:10.1103/revmodphys.81.1301 · Cited by 3,726
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
Hillery, M., Bužek, V., & Berthiaume, A. (1999) · Physical Review A · doi:10.1103/physreva.59.1829 · Cited by 3,347
Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
Bennett, C. H., Brassard, G., Popescu, S., Schumacher, B., Smolin, J. A., & Wootters, W. K. (1996) · Physical Review Letters · doi:10.1103/physrevlett.76.722 · Cited by 2,961
Loophole-free Bell inequality violation using electron spins separated by 1.3 kilometres
Hensen, B., Bernien, H., Dréau, A. E., Reiserer, A., Kalb, N., Blok, M. S., Ruitenberg, J., Vermeulen, R. F. L., Schouten, R. N., Abellán, C., et al. (2015) · Nature · doi:10.1038/nature15759 · Cited by 2,852
Self-citationMeasurement-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
Research works printed but not linked: 12
- C. H. Bennett G. Brassard International Conference on Computer System and Signal Processing IEEE 1984 (1984) pp. 175–179.
- J. Ribeiro F. Grosshans arXiv:1504.07171 [quant-ph] (2015). · arXiv
- A. Chailloux I. Kerenidis Proceedings of the 52th Annual Symposium on Foundations of Computer Science 10.1109/FOCS.2011.42 (2011). · DOI
- D. Aharonov A. Ta-Shma U. V. Vazirani A. C. Yao Proceedings of the Thirty-second Annual ACM Symposium on Theory of Computing 10.1145/335305.335404 (2000). · DOI
- D. Mayers A. Yao Proceedings of the 39th Annual Symposium on Foundations of Computer Science 1998 (IEEE 1998) pp. 503–509.
- A. M. Childs, Quantum Inf. Comput. 5, 456 (2005).
- D. Aharanov M. Ben-Or E. Eban Proceedings of Innovations in Computer Science (2008) pp. 453–469.
- A. Ambainis H. Buhrman Y. Dodis H. Röhrig Proceedings of IEEE Complexity 10.1109/CCC.2004.1313848 (2004). · DOI
- C. Mochon arXiv:0711.4114 [quant-ph] (2007). · arXiv
- M. Burrows Proceedings of the 7th symposium on Operating systems design and implementation (USENIX Association 2006) pp. 335–350.
- M. Ben-Or A. Hassidim Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005) pp. 481–485.
- R. Courtland, IEEE Spectr. 53, 11 (2016).
Cited by
Items 1,001–1,003 of 1,003
Son, J., Gluza, M., Takagi, R., & Ng, N. H. Y. (2025) · Physical Review Letters · doi:10.1103/physrevlett.134.180602 · Cited by 6
Non-Hermitian interacting quantum walks of correlated photons
Wan, T., & Yang, Z. (2025) · Communications Physics · doi:10.1038/s42005-025-02038-9 · Cited by 3
Towards violations of Local Friendliness with quantum computers
Zeng, W. J., Labib, F., & Russo, V. (2025) · Quantum · doi:10.22331/q-2025-09-05-1851
Metadata
- Authors
- Wehner, S., Elkouss, D., & Hanson, R.
- Affiliations
- QuTech (NL)
- Corresponding author
- Wehner, Stephanie
- Venue
- Science
- Published
- 2018-10-19
- Volume
- 362
- Issue
- 6412
- ISSN
- 0036-8075 (ISSN-L)
- 1095-9203
- OpenAlex
- W2897264299
- Cited by
- 2,467
- References
- 100
- Citations by year
- 2026: 360 · 2025: 477 · 2024: 414 · 2023: 343 · 2022: 290 · 2021: 291 · 2020: 200 · 2019: 87 · 2018: 5
- FWCI
- 17.11
- Type
- journal article
- Language
- en
- Open access
- green
- resolver.tudelft.nl
- Licence
- other-oa
- Locations
- Science (publishedVersion)
- PubMed (publishedVersion)
- Research Repository (Delft University of Technology) (submittedVersion)
- Data Archiving and Networked Services (DANS) (submittedVersion, other-oa)
- Funders
- European Research Council (QINTERNET, QNETWORKS)
- Nederlandse Organisatie voor Wetenschappelijk Onderzoek (VIDI, VICI, Zwaartekracht QSC)
- Topics
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum optics and atomic interactions
- Keywords
- quantum internet, quantum communication, qubits, quantum networks, quantum cryptography, quantum computing, information security
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.