Unveiling the importance of nonshortest paths in quantum networks.

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 (U, V) flowers. These networks allow full analytical control over path connectivity through two adjustable path-length parameters, ≤V. 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, nonshortest path contributions into ove

SUBMITTER: Hu X 

PROVIDER: S-EPMC11864168 | biostudies-literature | 2025 Feb

REPOSITORIES: biostudies-literature