Unveiling the Importance of Nonshortest Paths in Quantum Networks
arXiv:2402.15462 · doi:10.1126/sciadv.adt2404
Abstract
Quantum networks (QNs) exhibit stronger connectivity than predicted by classical percolation, yet the origin of this phenomenon remains unexplored. We apply a statistical physics model -- concurrence percolation -- to uncover the origin of stronger connectivity on hierarchical scale-free networks, the () flowers. These networks allow full analytical control over path connectivity through two adjustable path-length parameters, . This precise control enables us to determine critical exponents well beyond current simulation limits, revealing that classical and concurrence percolations, while both satisfying the hyperscaling relation, fall into distinct universality classes. This distinction arises from how they "superpose" parallel, non-shortest path contributions into overall connectivity. Concurrence percolation, unlike its classical counterpart, is sensitive to non-shortest paths and shows higher resilience to detours as these paths lengthen. This enhanced resilience is also observed in real-world hierarchical, scale-free Internet networks. Our findings highlight a crucial principle for QN design: when non-shortest paths are abundant, they notably enhance QN connectivity beyond what is achievable with classical percolation.
arXiv comment22 pages, 4 figures, 2 tables. Supplementary materials added
References in corpus (32)
- Fundamental Limits of Repeaterless Quantum Communications
- General Benchmarks for Quantum Repeaters
- On the Theory of Quantum Secret Sharing
- Origins of fractality in the growth of complex networks
- Griffiths phases and the stretching of criticality in brain networks
- Statistical Mechanics of Multiplex Ensembles: Entropy and Overlap
- Percolation Critical Exponents in Scale-Free Networks
- A Short Review of Loop Quantum Gravity
- End-to-end capacities of a quantum communication network
- Relating the Resource Theories of Entanglement and Quantum Coherence
- Quantum criticality with two length scales
- Entanglement Percolation in Quantum Networks
- Network resilience
- Distributed Quantum Computing: a Survey
- Scaling theory of transport in complex networks
- Fractal and Transfractal Recursive Scale-Free Nets
- Explosive Phenomena in Complex Networks
- Universal Formulae for Percolation Thresholds
- Ordinary Percolation with Discontinuous Transitions
- Ground states of a frustrated quantum spin chain with long-range interactions
- Percolation in Hierarchical Scale-Free Nets
- Perfect Quantum Network Communication Protocol Based on Classical Network Coding
- Topological Percolation on Hyperbolic Simplicial Complexes
- Statistical properties of the quantum internet
- Design and Implementation of the Illinois Express Quantum Metropolitan Area Network
- Complex Quantum Networks: a Topical Review
- Designing Noise-Robust Quantum Networks Coexisting in the Classical Fiber Infrastructure
- Concurrence Percolation in Quantum Networks
- Percolation on branching simplicial and cell complexes and its relation to interdependent percolation
- Renormalization group for link percolation on planar hyperbolic manifolds
- Aggregating Quantum Networks
- Renormalization group theory of percolation on pseudo-fractal simplicial and cell complexes