Unveiling the importance of nonshortest paths in quantum networks

• DOI: 10.1126/sciadv.adt2404
• Publication Date: 2025-02-26T18:58:46Z
• Authors: Xinqi Hu; Gaogao Dong; Kim Christensen; Hanlin Sun; Jingfang Fan; Zihao Tian; Jianxi Gao; Shlomo Havlin; Renaud Lambiotte; Xiangyi Meng
• Keywords: Percolation (cognitive psychology); Concurrence; Resilience; Percolation Theory; Directed percolation

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 on hierarchical scale-free networks, ( U , V ) flowers. These allow full analytical control over path through two adjustable path-length parameters, ≤ . This precise enables us to determine critical exponents well beyond current simulation limits, revealing that and concurrence percolations, while both satisfying hyperscaling relation, fall into distinct universality classes. distinction arises from how they “superpose” parallel, nonshortest contributions overall connectivity. Concurrence unlike its counterpart, is sensitive paths shows higher resilience detours as these lengthen. enhanced also observed in real-world hierarchical, internet networks. Our findings highlight crucial principle for QN design: When are abundant, notably enhance what achievable with percolation.