An official website of the United States government
Abstract Quantum networks describe communication networks that are based on quantum entanglement. A concurrence percolation theory has been recently developed to determine the required entanglement to enable communication between two distant stations in an arbitrary quantum network. Unfortunately, concurrence percolation has been calculated only for very small networks or large networks without loops. Here, we develop a set of mathematical tools for approximating the concurrence percolation threshold for unprecedented large-scale quantum networks by estimating the path-length distribution, under the assumption that all paths between a given pair of nodes have no overlap. We show that our approximate method agrees closely with analytical results from concurrence percolation theory. The numerical results we present include 2D square lattices of 2002nodes and complex networks of up to 104nodes. The entanglement percolation threshold of a quantum network is a crucial parameter for constructing a real-world communication network based on entanglement, and our method offers a significant speed-up for the intensive computations involved.
more »
« less
This content will become publicly available on February 28, 2026
Unveiling the importance of nonshortest paths in quantum networks
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.
more »
« less
- Award ID(s):
- 2047488
- PAR ID:
- 10586474
- Publisher / Repository:
- AAAS
- Date Published:
- Journal Name:
- Science Advances
- Volume:
- 11
- Issue:
- 9
- ISSN:
- 2375-2548
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Quantum networks have experienced rapid advancements in both theoretical and experimental domains over the last decade, making it increasingly important to understand their large-scale features from the viewpoint of statistical physics. This review paper discusses a fundamental question: how can entanglement be effectively and indirectly (e.g., through intermediate nodes) distributed between distant nodes in an imperfect quantum network, where the connections are only partially entangled and subject to quantum noise? We survey recent studies addressing this issue by drawing exact or approximate mappings to percolation theory, a branch of statistical physics centered on network connectivity. Notably, we show that the classical percolation frameworks do not uniquely define the network’s indirect connectivity. This realization leads to the emergence of an alternative theory called “concurrence percolation”, which uncovers a previously unrecognized quantum advantage that emerges at large scales, suggesting that quantum networks are more resilient than initially assumed within classical percolation contexts, offering refreshing insights into future quantum network design.more » « less
-
Abstract Understanding mechanistic causes of non‐Fickian transport in fractured media is important for many hydrogeologic processes and subsurface applications. This study elucidates the effects of dead‐end fractures on non‐Fickian transport in three‐dimensional (3D) fracture networks. Although dead‐end fractures have been identified as low‐velocity regions that could delay solute transport, the direct relation between dead‐end fractures and non‐Fickian transport has been elusive. We systematically generate a large number of 3D discrete fracture networks with different fracture length distributions and fracture densities. We then identify dead‐end fractures using a novel graph‐based method. The effect of dead‐end fractures on solute residence time maximizes at the critical fracture density of the percolation threshold, leading to strong late‐time tailing. As fracture density increases beyond the percolation threshold, the network connectivity increases, and dead‐end fractures diminish. Consequently, the increase in network connectivity leads to a reduction in the degree of late‐time tailing. We also show that dead‐end fractures can inform about main transport paths, such as the mean tortuosity of particle trajectories. This study advances our mechanistic understanding of solute transport in 3D fracture networks.more » « less
-
null (Ed.)How can we manipulate the topological connectivity of a three-dimensional prismatic assembly to control the number of internal degrees of freedom and the number of connected components in it? To answer this question in a deterministic setting, we use ideas from elementary number theory to provide a hierarchical deterministic protocol for the control of rigidity and connectivity. We then show that it is possible to also use a stochastic protocol to achieve the same results via a percolation transition. Together, these approaches provide scale-independent algorithms for the cutting or gluing of three-dimensional prismatic assemblies to control their overall connectivity and rigidity.more » « less
-
Percolation theory is essential for understanding disease transmission patterns on the temporal mobility networks. However, the traditional approach of the percolation process can be inefficient when analysing a large-scale, dynamic network for an extended period. Not only is it time-consuming but it is also hard to identify the connected components. Recent studies demonstrate that spatial containers restrict mobility behaviour, described by a hierarchical topology of mobility networks. Here, we leverage crowd-sourced, large-scale human mobility data to construct temporal hierarchical networks composed of over 175 000 block groups in the USA. Each daily network contains mobility between block groups within a Metropolitan Statistical Area (MSA), and long-distance travels across the MSAs. We examine percolation on both levels and demonstrate the changes of network metrics and the connected components under the influence of COVID-19. The research reveals the presence of functional subunits even with high thresholds of mobility. Finally, we locate a set of recurrent critical links that divide components resulting in the separation of core MSAs. Our findings provide novel insights into understanding the dynamical community structure of mobility networks during disruptions and could contribute to more effective infectious disease control at multiple scales. This article is part of the theme issue ‘Data science approaches to infectious disease surveillance’.more » « less
