Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 514

The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.

Quantum Internet: Networking Challenges in Distributed Quantum Computing

Open access
Cacciapuoti, Angela Sara, Caleffi, Marcello, Tafuri, Francesco, Cataliotti, Francesco Saverio, Gherardini, Stefano, Bianchi, Giuseppe · 2020 · IEEE Network

Abstract

The Quantum Internet, a network interconnecting remote quantum devices through quantum links in synergy with classical ones, is envisioned as the final stage of the quantum revolution, opening fundamentally new communications and computing capabilities. But the Quantum Internet is governed by the laws of quantum mechanics. Phenomena with no counterpart in classical networks, such as no-cloning, quantum measurement, entanglement and quantum teleportation, impose new challenging constraints for network design. Specifically, classical network functionalities are based on the assumption that classical information can be safely read and copied. However, this assumption does not hold in the Quantum Internet. As a consequence, its design requires a major network-paradigm shift to harness the quantum mechanics specificities. The goal of this work is to shed light on the challenges and open problems of Quantum Internet design. We first introduce some basic knowledge of quantum mechanics, needed to understand the differences between a classical and a quantum network. Then, we introduce quantum teleportation as the key strategy for transmitting quantum information without physically transferring the particle that stores the quantum information or violating the principles of quantum mechanics. Finally, the key research challenges to design quantum communication networks are discussed.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/mnet.001.1900092

Cites

18 of 18 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Cited by

See all 514

Metadata

Authors
Cacciapuoti, A. S., Caleffi, M., Tafuri, F., Cataliotti, F. S., Gherardini, S., & Bianchi, G.
Venue
IEEE Network
Published
2020-01
Volume
34
Issue
1
Pages
137-143
ISSN
  • 0890-8044 (ISSN-L)
  • 1558-156X
OpenAlex
W2896792097
Cited by
514
References
18
FWCI
16.23
Type
journal article
Language
en
Open access
green

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.