IEEE Transactions on Network and Service Management
Design of Survivable Entanglement Path Provisioning Under Node Failures in Quantum Networks
Eiji Oki, Masaki Maeda, Ryuta Shiraki
Abstract
Quantum networks enable end-to-end quantum communication by leveraging inherently probabilistic processes, such as distributing entanglement between distant nodes and performing entanglement swapping at intermediate repeater nodes. Existing work has focused on maximizing the entanglement path success probability under link failures. However, the occurrence of physical node failures poses a significantly greater challenge to maintaining stable entanglement connections. To tackle this problem, it is necessary to develop a path provisioning design model that can preserve a high end-to-end entanglement success probability despite the occurrence of node failures. This paper proposes a survivable path provisioning design model to determine node- disjoint entanglement paths in quantum networks, which takes into account both the link-level transmission success probabilities and the node-level entanglement swapping success probabilities at nodes. The proposed model aims to maximize the entanglement path success probability for survivability under node failure. We express the proposed design model in the form of an integer linear programming problem. Numerical results show that the proposed model attains greater survivability compared with the baseline algorithms.