Path Percolation in Quantum Communication Networks

作     者：Xiangyi Meng Bingjie Hao Balázs Ráth István A. Kovács 

作者机构：Department of Physics Applied Physics and Astronomy Rensselaer Polytechnic Institute Troy New York 12180 USA Department of Physics and Astronomy Northwestern University Evanston Illinois 60208 USA Department of Stochastics Institute of Mathematics Budapest University of Technology and Economics H-1111 Budapest Hungary HUN-REN-BME Stochastics Research Group H-1111 Budapest Hungary Alfréd Rényi Institute of Mathematics H-1053 Budapest Hungary Northwestern Institute on Complex Systems Northwestern University Evanston Illinois 60208 USA Department of Engineering Sciences and Applied Mathematics Northwestern University Evanston Illinois 60208 USA 

出 版 物：《Physical Review Letters》 (Phys Rev Lett)

年 卷 期：2025年第134卷第3期

页      面：030803-030803页

核心收录：

学科分类：07[理学] 0702[理学-物理学] 

基　　金：We thank Ravi T.C. Chepuri  Helen S. Ansell  Chana Lyubich  Ruiting (Grace) Xie  Daniel Keliger  Agnes Kaisz  Pierfrancesco Dionigi  and Miklos Abart for helpful comments and discussion. This work greatly benefited from the 2023 Focused Workshop on Networks and Their Limits held at the Erdos Center (part of the Alfrad Ranyi Institute of Mathematics) in Budapest  Hungary. The workshop was supported by the ERC Synergy Grant No. DYNASNET 810115. The work of I.A.K. and X.M. was supported by the National Science Foundation under Grant No. PHY-2310706 of the QIS program in the Division of Physics 

主　　题：Quantum entanglement 

摘      要：In a quantum communication network, links represent entanglement between qubits located at different nodes. Even if two nodes are not directly linked by shared entanglement, they can still communicate via routing protocols. However, in contrast to classical communication, each quantum communication event removes all participating links along the routed path, disrupting the quantum communication network. Here, we propose a simple model, where randomly selected pairs of nodes communicate through the shortest paths. Each time such a path is used, all participating links are eliminated, leading to a correlated percolation process that we call “path percolation. We study path percolation both numerically and analytically and present the phase diagram of the steady states as a function of the rate at which new links are being added to the network. As a key result, the steady state is found to be independent of the initial network topologies when new links are added randomly between disconnected components. We close by discussing extensions of path percolation and link replenishment, along with their potential applications.