Pith. sign in

REVIEW 1 cited by

Quantum Internet: Networking Challenges in Distributed Quantum Computing

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1810.08421 v2 pith:U53V5HRQ submitted 2018-10-19 quant-ph cs.ETcs.NI

classification quant-phcs.ETcs.NI
keywords quantuminternetclassicaldesignmechanicschallengescomputinginformation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The Quantum Internet is envisioned as the final stage of the quantum revolution, opening fundamentally new communications and computing capabilities, including the distributed quantum computing. 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 teleporting, impose very challenging constraints for the network design. Specifically, classical network functionalities, ranging from error-control mechanisms to overhead-control strategies, are based on the assumption that classical information can be safely read and copied. But this assumption does not hold in the Quantum Internet. As a consequence, the design of the Quantum Internet 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 the open problems of the Quantum Internet design. To this aim, 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 the quantum mechanics. Finally, the key research challenges to design quantum communication networks are described.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A resource- and computationally-efficient protocol for multipartite entanglement distribution in Bell-pair networks

    quant-ph 2024-12 conditional novelty 6.0 of 10

    A greedy star-merging protocol distributes GHZ states over arbitrary Bell-pair networks with O(N) gates, N-1 Bell pairs in the complete case, and a polynomial-time alternative to Steiner-tree-based methods.

Pith tools