Unveiling the Importance of Nonshortest Paths in Quantum Networks
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866916662264987648 |
|---|---|
| author | Hu, Xinqi Dong, Gaogao Christensen, Kim Sun, Hanlin Fan, Jingfang Tian, Zihao Gao, Jianxi Havlin, Shlomo Lambiotte, Renaud Meng, Xiangyi |
| author_facet | Hu, Xinqi Dong, Gaogao Christensen, Kim Sun, Hanlin Fan, Jingfang Tian, Zihao Gao, Jianxi Havlin, Shlomo Lambiotte, Renaud Meng, Xiangyi |
| contents | 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, $U \leq 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, 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_15462 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Unveiling the Importance of Nonshortest Paths in Quantum Networks Hu, Xinqi Dong, Gaogao Christensen, Kim Sun, Hanlin Fan, Jingfang Tian, Zihao Gao, Jianxi Havlin, Shlomo Lambiotte, Renaud Meng, Xiangyi Quantum Physics 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, $U \leq 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, 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. |
| title | Unveiling the Importance of Nonshortest Paths in Quantum Networks |
| topic | Quantum Physics |
| url | https://arxiv.org/abs/2402.15462 |