Meng Xiangyi, Hao Bingjie, Ráth Balázs, Kovács István A
Rensselaer Polytechnic Institute, Department of Physics, Applied Physics, and Astronomy, Troy, New York 12180, USA.
Rensselaer Polytechnic Institute, Network Science and Technology Center, Troy, New York 12180, USA.
Phys Rev Lett. 2025 Jan 24;134(3):030803. doi: 10.1103/PhysRevLett.134.030803.
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.
在量子通信网络中，链路表示位于不同节点的量子比特之间的纠缠。即使两个节点没有通过共享纠缠直接相连，它们仍可通过路由协议进行通信。然而，与经典通信不同的是，每次量子通信事件都会移除沿路由路径的所有参与链路，从而扰乱量子通信网络。在此，我们提出一个简单模型，其中随机选择的节点对通过最短路径进行通信。每次使用这样的路径时，所有参与链路都会被消除，导致一个我们称为“路径渗流”的相关渗流过程。我们通过数值和解析方法研究路径渗流，并给出稳态相图作为网络中添加新链路速率的函数。作为一个关键结果，当在不相连的组件之间随机添加新链路时，发现稳态与初始网络拓扑无关。最后，我们讨论了路径渗流和链路补充的扩展及其潜在应用。
