Unveiling the importance of longer paths in quantum networks
<p>The advancement of large-scale quantum technologies necessitates a deeper understanding of the quantum network (QN) design from first principles. Pioneering studies, however, do not fully capture the origin of the stronger connectivity in QN that surpasses classical percolation predictions....
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
American Association for the Advancement of Science
2025
|
| _version_ | 1824459038695358464 |
|---|---|
| author | Hu, X Dong, G Lambiotte, R Christensen, K Fan, J Tian, Z Havlin, S Meng, X |
| author_facet | Hu, X Dong, G Lambiotte, R Christensen, K Fan, J Tian, Z Havlin, S Meng, X |
| author_sort | Hu, X |
| collection | OXFORD |
| description | <p>The advancement of large-scale quantum technologies necessitates a deeper understanding of the quantum network (QN) design from first principles. Pioneering studies, however, do not fully capture the origin of the stronger connectivity in QN that surpasses classical percolation predictions. Here, we apply statistical physics to identify the origin of this stronger connectivity—known as concurrence percolation. Our finding is demonstrated on hierarchical scale-free networks, the (U,V) flowers, which allow full analytical control over path connectivity by adjusting the two distinct path length scales, U ≤ V. This advantage enables us to analytically determine the critical exponents for infinite systems well beyond the current simulation limits. Our analysis reveals for the first time that classical and concurrence percolations, while both satisfying the hyperscaling relation, fall into distinct universality classes. This distinction arises from their different methods for how to “superpose” parallel, non-shortest path contributions into overall connectivity. Notably, we find that concurrence percolation relies on non-shortest paths and shows a higher resilience to detouring when these paths are rerouted and extended. This increased resilience is also evident in real-world hierarchical, scale-free Internet networks. Our findings highlight a critical principle for QN design: non-shortest paths contribute significantly to QN connectivity compared to classical percolation—as long as they are abundant.</p> |
| first_indexed | 2025-02-19T04:35:26Z |
| format | Journal article |
| id | oxford-uuid:d262fab1-5872-4ad8-a7db-67092a64003a |
| institution | University of Oxford |
| language | English |
| last_indexed | 2025-02-19T04:35:26Z |
| publishDate | 2025 |
| publisher | American Association for the Advancement of Science |
| record_format | dspace |
| spelling | oxford-uuid:d262fab1-5872-4ad8-a7db-67092a64003a2025-01-24T14:26:03ZUnveiling the importance of longer paths in quantum networksJournal articlehttp://purl.org/coar/resource_type/c_dcae04bcuuid:d262fab1-5872-4ad8-a7db-67092a64003aEnglishSymplectic ElementsAmerican Association for the Advancement of Science2025Hu, XDong, GLambiotte, RChristensen, KFan, JTian, ZHavlin, SMeng, X<p>The advancement of large-scale quantum technologies necessitates a deeper understanding of the quantum network (QN) design from first principles. Pioneering studies, however, do not fully capture the origin of the stronger connectivity in QN that surpasses classical percolation predictions. Here, we apply statistical physics to identify the origin of this stronger connectivity—known as concurrence percolation. Our finding is demonstrated on hierarchical scale-free networks, the (U,V) flowers, which allow full analytical control over path connectivity by adjusting the two distinct path length scales, U ≤ V. This advantage enables us to analytically determine the critical exponents for infinite systems well beyond the current simulation limits. Our analysis reveals for the first time that classical and concurrence percolations, while both satisfying the hyperscaling relation, fall into distinct universality classes. This distinction arises from their different methods for how to “superpose” parallel, non-shortest path contributions into overall connectivity. Notably, we find that concurrence percolation relies on non-shortest paths and shows a higher resilience to detouring when these paths are rerouted and extended. This increased resilience is also evident in real-world hierarchical, scale-free Internet networks. Our findings highlight a critical principle for QN design: non-shortest paths contribute significantly to QN connectivity compared to classical percolation—as long as they are abundant.</p> |
| spellingShingle | Hu, X Dong, G Lambiotte, R Christensen, K Fan, J Tian, Z Havlin, S Meng, X Unveiling the importance of longer paths in quantum networks |
| title | Unveiling the importance of longer paths in quantum networks |
| title_full | Unveiling the importance of longer paths in quantum networks |
| title_fullStr | Unveiling the importance of longer paths in quantum networks |
| title_full_unstemmed | Unveiling the importance of longer paths in quantum networks |
| title_short | Unveiling the importance of longer paths in quantum networks |
| title_sort | unveiling the importance of longer paths in quantum networks |
| work_keys_str_mv | AT hux unveilingtheimportanceoflongerpathsinquantumnetworks AT dongg unveilingtheimportanceoflongerpathsinquantumnetworks AT lambiotter unveilingtheimportanceoflongerpathsinquantumnetworks AT christensenk unveilingtheimportanceoflongerpathsinquantumnetworks AT fanj unveilingtheimportanceoflongerpathsinquantumnetworks AT tianz unveilingtheimportanceoflongerpathsinquantumnetworks AT havlins unveilingtheimportanceoflongerpathsinquantumnetworks AT mengx unveilingtheimportanceoflongerpathsinquantumnetworks |