Pith. sign in

REVIEW 1 cited by

Robustness of Noisy Quantum Networks

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 2103.03266 v1 pith:SVSJVDMG submitted 2021-03-04 quant-ph cond-mat.dis-nnmath-phmath.MP

classification quant-phcond-mat.dis-nnmath-phmath.MP
keywords quantumnetworknetworksnodesconnectivityinternetlinksloss
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Quantum networks are a new paradigm of complex networks, allowing us to harness networked quantum technologies and to develop a quantum internet. But how robust is a quantum network when its links and nodes start failing? We show that quantum networks based on typical noisy quantum-repeater nodes are prone to discontinuous phase transitions with respect to the random loss of operating links and nodes, abruptly compromising the connectivity of the network, and thus significantly limiting the reach of its operation. Furthermore, we determine the critical quantum-repeater efficiency necessary to avoid this catastrophic loss of connectivity as a function of the network topology, the network size, and the distribution of entanglement in the network. In particular, our results indicate that a scale-free topology is a crucial design principle to establish a robust large-scale quantum internet.

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