EUVIMEDEUVIMED entdecken
Open Access

Unveiling the importance of nonshortest paths in quantum networks

Xinqi Hu iD, Gaogao Dong iD, Kim Christensen, Hanlin Sun iD, Jingfang Fan iD, Zihao Tian iD, Jianxi Gao iD, Shlomo Havlin iD, Renaud Lambiotte iD, Xiangyi Meng iD

Science Advances · 28.02.2025 · 11 (9)

DOI: 10.1126/sciadv.adt2404 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Science Advances, erschienen am 28.02.2025. Verfasst von Xinqi Hu und 9 weiteren Autor:innen. Beteiligte Einrichtung: School of Mathematical Sciences, Jiangsu University, Zhenjiang, Jiangsu 212013, China. Die Arbeit wurde bisher 19-mal zitiert (Crossref) und nennt 55 Literaturangaben. Der Volltext ist frei in PubMed Central verfügbar.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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 overall connectivity. Concurrence percolation, unlike its classical counterpart, is sensitive to nonshortest 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 nonshortest paths are abundant, they notably enhance QN connectivity beyond what is achievable with classical percolation.

Autor:innen und Institutionen

  • School of Mathematical Sciences, Jiangsu University, Zhenjiang, Jiangsu 212013, China.
  • Key Laboratory for NSLSCS, Ministry of Education, School of Mathematical Sciences, Nanjing Normal University, Nanjing 210023, China.
  • Blackett Laboratory and Centre for Complexity Science, Imperial College London, London SW7 2AZ, UK.
  • Nordita, KTH Royal Institute of Technology and Stockholm University, Hannes Alfvéns väg 12, SE-106 91 Stockholm, Sweden.
  • School of Systems Science and Institute of Nonequilibrium Systems, Beijing Normal University, Beijing 100875, China.
  • School of Management and Engineering, Nanjing University, Nanjing 210093, China.

ORCID-Profile: Xinqi Hu, Gaogao Dong, Hanlin Sun, Jingfang Fan, Zihao Tian, Jianxi Gao, Shlomo Havlin, Renaud Lambiotte, Xiangyi Meng

Zitieren

APA

Hu, X., Dong, G., Christensen, K., Sun, H., Fan, J., Tian, Z., Gao, J., Havlin, S., Lambiotte, R., & Meng, X. (2025). Unveiling the importance of nonshortest paths in quantum networks. Science Advances, 11(9). https://doi.org/10.1126/sciadv.adt2404

Vancouver

Hu X, Dong G, Christensen K, Sun H, Fan J, Tian Z, et al. Unveiling the importance of nonshortest paths in quantum networks. Science Advances. 2025;11(9). doi:10.1126/sciadv.adt2404

BibTeX
@article{Hu2025,
  author = {Hu, Xinqi and Dong, Gaogao and Christensen, Kim and Sun, Hanlin and Fan, Jingfang and Tian, Zihao and Gao, Jianxi and Havlin, Shlomo and Lambiotte, Renaud and Meng, Xiangyi},
  title = {Unveiling the importance of nonshortest paths in quantum networks},
  journal = {Science Advances},
  year = {2025},
  volume = {11},
  number = {9},
  doi = {10.1126/sciadv.adt2404}
}
Kostenlos starten →