Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Asia-Pacific Network Operations and Management Symposium (APNOMS)

Modeling and Analysis of Entanglement Path Provisioning for Survivability under Link Failure

Masaki Maeda, Ryuta Shiraki, Eiji Oki

Published Sep 22, 2025• 3 citations
Publisher

Abstract

Quantum networks establish end-to-end quantum communication by utilizing probabilistic quantum processes, including entanglement distribution between remote nodes and entanglement swapping at repeater nodes. While previous studies have aimed to maximize the number of entanglement connections under the probabilistic nature, physical link failures provide an additional challenge to ensuring consistent entanglement connections. To address this issue, a path provisioning model should be designed to maintain a high entanglement path success probability even in the presence of link failure. This paper proposes a provisioning model to find link- disjoint entanglement paths in quantum networks, considering both link-level transmission success probabilities and node-level entanglement swapping success probabilities. The objective of the proposed model is to maximize the entanglement path success probability for survivability under link failure. We formulate this model as an integer linear programming problem. The numerical results indicate that the proposed model achieves higher survivability than baseline algorithms.

DOI
10.23919/apnoms67058.2025.11181318

Related papers

Survivable Entanglement Path Provisioning for Quantum Networks Under Link Failures

Eiji Oki, Masaki Maeda, Ryuta Shiraki

Quantum networks establish end-to-end quantum communication by utilizing probabilistic quantum processes, including entanglement distribution between remote nodes and entanglement swapping at repeater nodes. While previous studies have aimed to maximize the number of entanglement connections under the probabilistic nature, physical link failures provide an additional challenge to ensuring consistent entanglement connections. To address this issue, a path provisioning model should be designed to maintain a high entanglement path success probability even in the presence of link failure. This paper proposes a survivable provisioning model to find link-disjoint entanglement paths in quantum networks, considering both link-level transmission success probabilities and node-level entanglement swapping success probabilities. The objective of the proposed model is to maximize the entanglement path success probability for survivability under link failure. We formulate this model as an integer linear programming problem. We prove that the decision version of the entanglement link-disjoint path finding problem in the proposed model is NP-complete. The numerical results indicate that the proposed model achieves up to 11.8% higher survivability than baseline algorithms. While the proposed model incurs longer computation time than the baselines, the required time is still within a feasible range; in our experiments, the maximum computation time is 4.1 seconds. Network operators perform path provisioning in advance of service initiation.

IEEE Open Journal of the Communications Society•Jan 1, 2026•2 citations

Design of Survivable Entanglement Path Provisioning Under Node Failures in Quantum Networks

Eiji Oki, Masaki Maeda, Ryuta Shiraki

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.

IEEE Transactions on Network and Service Management•Jan 1, 2026•0 citations

Optimal Multipartite Entanglement Routing Model in Quantum Networks

Yudai Ogata, Imran Ahmed, Eiji Oki

Future quantum networks will support not only point-to-point communication but also multiparty applications, such as multiparty quantum key distribution and quantum secret sharing. While bipartite entanglement routing has been studied extensively, multipartite routing with probabilistic link generation and fusion operations has not been previously addressed. This paper proposes a routing model for multipartite entanglement distribution, formulated as an optimization problem using a mixed-integer linear programming problem. This model explicitly incorporates the probabilistic nature of quantum operations, aiming to maximize the probability of successfully distributing a multipartite entangled state, particularly the Greenberger-Horne-Zeilinger state, to all requesting users. Maximizing this probability is essential for ensuring the feasibility and robustness of multiparty quantum communication in practical networks, thereby enabling the reliable execution of multiparty quantum applications. Numerical results show that the proposed model improves the success probability and maintains robustness across diverse network conditions, including scenarios with stringent quantum memory limitations and relatively large terminal sets.

IEEE International Conference on High Performance Switching and Routing (HPSR)•Jun 1, 2026•0 citations

Computing an Optimal Entanglement Path With Throughput and Fidelity Considerations

Guoliang Xue, Nageswara S. V. Rao, Don Towsley +7 more

Entanglement distribution is a core function of quantum networks essential for operations including teleportation, distributed quantum sensing, and multisite computation. Entanglement throughput and fidelity are two critical performance measures that depend on the quantum transmission along the links and swapping operations at the repeaters along the path. We study the problem of computing an end-to-end entanglement path that satisfies both fidelity and throughput requirements, leveraging qubit buffers at the nodes and considering the sequential swapping order. We show that the general problem of simultaneously satisfying both metrics is NP-hard, and develop an algorithm to maximize throughput subject to a given fidelity threshold. We introduce the concepts of entanglement probability distribution and path domination and exploit them in the design of our algorithm. Extensive numerical results show that our algorithm can find optimal solutions in networks with thousands of nodes in less than a second. We also describe practical and possible implementation aspects of this algorithm in terms of devices and architecture support.

IEEE Transactions on Networking•Jan 1, 2026•0 citations

Optimal routing and end-to-end entanglement distribution in quantum networks

Joy Halder, Akhmadjon Rajabov, Riccardo Bassoli +2 more

Quantum networks are designed to transmit quantum bits (qubits) among quantum devices to enable new network resources for the applications. Entanglement distribution and entanglement swapping are fundamental procedures that are required in several network operations. However, they are probabilistic operations, which can lead to severe network performance degradation. This article investigates the engineering problem of resource allocation in quantum networks, considering factors like entanglement distribution probability, quantum memory characteristics, and fidelity. We model this as an optimization model to obtain an optimal solution. In particular, we formulate an integer linear programming (ILP) and develop a heuristic algorithm, aiming to minimize the number of required entangled qubit pairs (Bell pairs or EPR pairs) in any adjacent pair in the quantum network. Extensive simulations are performed to compare the performance of proposed ILP and heuristic. In all the cases, the heuristic produces a comparable solution to the optimal one. Simulation results ensure that the value of maximum utilized Bell pairs in a quantum network highly depends on the value of the probability of entangled pairs established, considering the time in the quantum memory besides the number of incoming requests.

Scientific Reports•Aug 20, 2024•26 citations

Multipartite Entanglement Routing Design in Quantum Networks

Imran Ahmed, Yudai Ogata, Eiji Oki

Quantum networks enable secure communication and distributed quantum computation using entanglement, quantum teleportation, and the no-cloning theorem. Future quantum networks will support multiparty applications such as multiparty quantum key distribution and quantum secret sharing, which require simultaneous entanglement distribution among multiple users. Therefore, efficient routing that accounts for quantum network constraints is crucial for practical multiparty quantum communications. Although bipartite entanglement routing has been studied extensively, multipartite entanglement routing with probabilistic quantum link generation and fusion operations remains inadequately addressed. This paper proposes a routing model for multipartite entanglement distribution that explicitly incorporates the probabilistic nature of quantum operations and maximizes the probability of successfully distributing a Greenberger-Horne-Zeilinger (GHZ) state to all requesting users under practical quantum network constraints. We formulate this model as a mixed-integer linear programming (MILP) problem. We prove that finding the optimal Steiner entanglement tree under the proposed model is NP-hard. For large-scale scenarios where MILP becomes computationally intractable, we develop a heuristic approach. Numerical results demonstrate that the proposed model achieves a higher entanglement tree success probability and greater robustness than baseline methods across diverse network conditions, including scenarios with stringent quantum memory constraints and large terminal sets.

IEEE Transactions on Network and Service Management•Jan 1, 2026•0 citations
Quantum networks establish end-to-end quantum communication by utilizing probabilistic quantum processes, including entanglement distribution between remote nodes and entanglement swapping at repeater nodes. While previous studies have aimed to maximize the number of entanglement connections under the probabilistic nature, physical link failures provide an additional challenge to ensuring consistent entanglement connections. To address this issue, a path provisioning model should be designed to maintain a high entanglement path success probability even in the presence of link failure. This paper proposes a provisioning model to find link- disjoint entanglement paths in quantum networks, considering both link-level transmission success probabilities and node-level entanglement swapping success probabilities. The objective of the proposed model is to maximize the entanglement path success probability for survivability under link failure. We formulate this model as an integer linear programming problem. The numerical results indicate that the proposed model achieves higher survivability than baseline algorithms.
Quantum networks establish end-to-end quantum communication by utilizing probabilistic quantum processes, including entanglement distribution between remote nodes and entanglement swapping at repeater nodes. While previous studies have aimed to maximize the number of entanglement connections under the probabilistic nature, physical link failures provide an additional challenge to ensuring consistent entanglement connections. To address this issue, a path provisioning model should be designed to maintain a high entanglement path success probability even in the presence of link failure. This paper proposes a survivable provisioning model to find link-disjoint entanglement paths in quantum networks, considering both link-level transmission success probabilities and node-level entanglement swapping success probabilities. The objective of the proposed model is to maximize the entanglement path success probability for survivability under link failure. We formulate this model as an integer linear programming problem. We prove that the decision version of the entanglement link-disjoint path finding problem in the proposed model is NP-complete. The numerical results indicate that the proposed model achieves up to 11.8% higher survivability than baseline algorithms. While the proposed model incurs longer computation time than the baselines, the required time is still within a feasible range; in our experiments, the maximum computation time is 4.1 seconds. Network operators perform path provisioning in advance of service initiation.
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.
Future quantum networks will support not only point-to-point communication but also multiparty applications, such as multiparty quantum key distribution and quantum secret sharing. While bipartite entanglement routing has been studied extensively, multipartite routing with probabilistic link generation and fusion operations has not been previously addressed. This paper proposes a routing model for multipartite entanglement distribution, formulated as an optimization problem using a mixed-integer linear programming problem. This model explicitly incorporates the probabilistic nature of quantum operations, aiming to maximize the probability of successfully distributing a multipartite entangled state, particularly the Greenberger-Horne-Zeilinger state, to all requesting users. Maximizing this probability is essential for ensuring the feasibility and robustness of multiparty quantum communication in practical networks, thereby enabling the reliable execution of multiparty quantum applications. Numerical results show that the proposed model improves the success probability and maintains robustness across diverse network conditions, including scenarios with stringent quantum memory limitations and relatively large terminal sets.
Entanglement distribution is a core function of quantum networks essential for operations including teleportation, distributed quantum sensing, and multisite computation. Entanglement throughput and fidelity are two critical performance measures that depend on the quantum transmission along the links and swapping operations at the repeaters along the path. We study the problem of computing an end-to-end entanglement path that satisfies both fidelity and throughput requirements, leveraging qubit buffers at the nodes and considering the sequential swapping order. We show that the general problem of simultaneously satisfying both metrics is NP-hard, and develop an algorithm to maximize throughput subject to a given fidelity threshold. We introduce the concepts of entanglement probability distribution and path domination and exploit them in the design of our algorithm. Extensive numerical results show that our algorithm can find optimal solutions in networks with thousands of nodes in less than a second. We also describe practical and possible implementation aspects of this algorithm in terms of devices and architecture support.
Quantum networks are designed to transmit quantum bits (qubits) among quantum devices to enable new network resources for the applications. Entanglement distribution and entanglement swapping are fundamental procedures that are required in several network operations. However, they are probabilistic operations, which can lead to severe network performance degradation. This article investigates the engineering problem of resource allocation in quantum networks, considering factors like entanglement distribution probability, quantum memory characteristics, and fidelity. We model this as an optimization model to obtain an optimal solution. In particular, we formulate an integer linear programming (ILP) and develop a heuristic algorithm, aiming to minimize the number of required entangled qubit pairs (Bell pairs or EPR pairs) in any adjacent pair in the quantum network. Extensive simulations are performed to compare the performance of proposed ILP and heuristic. In all the cases, the heuristic produces a comparable solution to the optimal one. Simulation results ensure that the value of maximum utilized Bell pairs in a quantum network highly depends on the value of the probability of entangled pairs established, considering the time in the quantum memory besides the number of incoming requests.
Quantum networks enable secure communication and distributed quantum computation using entanglement, quantum teleportation, and the no-cloning theorem. Future quantum networks will support multiparty applications such as multiparty quantum key distribution and quantum secret sharing, which require simultaneous entanglement distribution among multiple users. Therefore, efficient routing that accounts for quantum network constraints is crucial for practical multiparty quantum communications. Although bipartite entanglement routing has been studied extensively, multipartite entanglement routing with probabilistic quantum link generation and fusion operations remains inadequately addressed. This paper proposes a routing model for multipartite entanglement distribution that explicitly incorporates the probabilistic nature of quantum operations and maximizes the probability of successfully distributing a Greenberger-Horne-Zeilinger (GHZ) state to all requesting users under practical quantum network constraints. We formulate this model as a mixed-integer linear programming (MILP) problem. We prove that finding the optimal Steiner entanglement tree under the proposed model is NP-hard. For large-scale scenarios where MILP becomes computationally intractable, we develop a heuristic approach. Numerical results demonstrate that the proposed model achieves a higher entanglement tree success probability and greater robustness than baseline methods across diverse network conditions, including scenarios with stringent quantum memory constraints and large terminal sets.