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

Optimized Source Placement for Multipartite State Distribution in Quantum Networks

Zheng Zhang, Qiaolun Zhang, Jiaheng Xiong, Alberto Gatto, Raouf Boutaba, Massimo Tornatore

Published Jan 1, 2026• 0 citations
OpenAlex

Abstract

The evolution of quantum networks towards distributed quantum computing and sensing necessitates the efficient distribution of multipartite entangled states among multiple users. However, most existing entanglement routing studies primarily focus on efficient entanglement distribution and typically assume that quantum sources are either fixed or available on all network edges. Due to the scarcity and high cost of quantum sources, some prior studies have focused on optimized source placement strategies, but these existing studies are confined to bipartite state distributions. Consequently, how to jointly optimize quantum source placement and entanglement routing for efficient multipartite state distribution under realistic resource constraints remains an open problem. In this work, we propose an Optimized source Placement and Reactive entanglement Routing (OP-RR) framework to maximize the multipartite state distribution rate given a limited amount of quantum sources. Numerical results on a grid and on the Tokyo topology demonstrate that OP-RR consistently outperforms baseline algorithms with non-optimized source placement, achieving an improvement of up to 16.7× in the multipartite distribution rate, while maintaining robustness under varying operation probabilities and scalability as the size of multipartite states increases.

Related papers

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

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

Integrating All-optical Switching and Entangled Photon Source Placement for Entanglement Routing

Qiucheng Zhu, Yangming Zhao, Hongli Xu +2 more

Entanglement routing plays a vital role in quantum networks. Previous works on entanglement routing did not note that all-optical switching capacity can be used to improve the network throughput or ignored that the placement of Entangled Photon Sources (EPS), another type of precious (and costly) quantum source, which also limits the network throughput. In this paper, we propose OptEPS to jointly optimize all-optical switching and EPS placement in entanglement routing to maximize the quantum network throughput. The main challenge of OptEPS lies in two folds: i). an entanglement may fail to be created; ii). the joint optimization problem suffers from a large time complexity. To overcome these challenges, we first formulate the joint optimization problem as a link-path based model and prune out some candidate paths in order to reduce the time complexity. Then, efficient algorithms are proposed to derive a near-optimal solution in a timely manner. Extensive simulations show that compared with the solutions ignoring EPS placement or without introducing all-optical switching, OptEPS will increase the network throughput by 1557% and 109%, respectively.

International Workshop on Quality of Service•Jun 19, 2023•7 citations

Multiuser Entanglement Distribution in Quantum Networks Using Multipath Routing

Evan Sutcliffe, Alejandra Beghelli

Quantum networks facilitate numerous applications including secure communication and distributed quantum computation by performing entanglement distribution. For some multi-user quantum applications access to a shared multipartite state is required. We consider the problem of designing protocols for distributing such states, at an increased rate. For this, we propose three protocols that leverage multipath routing to increase the distribution rate for multi-user applications. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation. Simulation results show that the developed protocols achieve an exponential increase in the distribution rate of multipartite states compared to single path routing techniques, with a maximum increase of four orders of magnitude for the cases studied. Further, the relative increase in distribution rate was also found to improve for larger sets of users. When the protocols were tested in scaled-down real-world topologies, it was found that topology had a significant effect on the multipartite state distribution rates achieved by the protocols. Finally, we found that the benefits of multipath routing are maximum for short quantum memory decoherence times and intermediate values of entanglement generation probability. Hence, the protocols developed can benefit NISQ quantum network control and design.

arXiv:2303.03334•IEEE Transactions on Quantum Engineering•Jan 1, 2023•45 citations

Scalable Multipartite Entanglement Distribution in Quantum Networks

Nitish K. Panigrahy, Matheus Guedes de Andrade, Shahrooz Pouryousef +2 more

Multipartite entangled states (MES) are useful resources for a wide range of quantum applications, including quantum secret sharing, and quantum sensing. In this work, we propose a scalable architecture for distributing multipartite entangled states (MES) using arbitrary bipartite quantum networks. In particular, we address the problem of joint tree selection and rate allocation in multipartite entanglement distribution networks in order to optimize the weighted aggregate MES generation rate across different user groups. To obtain optimal solutions, we develop a mixed-integer programming (MIP) model and employ a heuristic approach based on the Genetic algorithm (GA) to obtain feasible solutions efficiently.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•5 citations

Beyond Entanglement Routing: Source Assignment and All-Optical Switching-Based Distribution

Qiucheng Zhu, Yangming Zhao, Hongli Xu +2 more

Entanglement routing plays a vital role in distributed quantum computing and quantum networks. Previous works on entanglement routing have addressed several design challenges due to limited quantum resources, failures to establish entanglement, and decoherence of established entanglement, but considered neither the limitations imposed by having a limited number of entangled photon sources (EPSes), nor the benefits of using all-optical (or quantum) switching to distribute entangled photons. In this paper, we first explore the problem of jointly optimizing entanglement routing and EPS assignment, assuming no all-optical switching capability. In other words, a pair of entangled photons generated by one EPS can be distributed to two neighboring quantum nodes. We then relax the above assumption so as to allow a pair of entangled photons generated by one EPS to be distributed to non-adjacent nodes using all-optical switching. We propose two corresponding solutions, namely, entanglement routing and EPS assignment (or ERSA), and ERSA with all-optical switching-based distribution (or ERSA+D) that aim to maximize the number of entanglement connections between the given set of source-destination (SD) pairs while avoiding starvation and achieving fairness among the SD pairs. In order to obtain efficient solutions in a large discrete solution space in a timely manner, we first formulate each optimization problem as an Integer Linear Programming (ILP), and then propose efficient algorithms to derive near-optimal solutions based on relaxation, Lagrangian decomposition, duality iteration, and rounding techniques. Extensive simulations show that ERSA+D can increase network throughput by up to 1652% and 113%, respectively, thanks to EPS assignment optimization, and all-optical switching based entanglement distribution.

IEEE Transactions on Networking•Nov 20, 2024•1 citation
The evolution of quantum networks towards distributed quantum computing and sensing necessitates the efficient distribution of multipartite entangled states among multiple users. However, most existing entanglement routing studies primarily focus on efficient entanglement distribution and typically assume that quantum sources are either fixed or available on all network edges. Due to the scarcity and high cost of quantum sources, some prior studies have focused on optimized source placement strategies, but these existing studies are confined to bipartite state distributions. Consequently, how to jointly optimize quantum source placement and entanglement routing for efficient multipartite state distribution under realistic resource constraints remains an open problem. In this work, we propose an Optimized source Placement and Reactive entanglement Routing (OP-RR) framework to maximize the multipartite state distribution rate given a limited amount of quantum sources. Numerical results on a grid and on the Tokyo topology demonstrate that OP-RR consistently outperforms baseline algorithms with non-optimized source placement, achieving an improvement of up to 16.7× in the multipartite distribution rate, while maintaining robustness under varying operation probabilities and scalability as the size of multipartite states increases.
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.
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.
Entanglement routing plays a vital role in quantum networks. Previous works on entanglement routing did not note that all-optical switching capacity can be used to improve the network throughput or ignored that the placement of Entangled Photon Sources (EPS), another type of precious (and costly) quantum source, which also limits the network throughput. In this paper, we propose OptEPS to jointly optimize all-optical switching and EPS placement in entanglement routing to maximize the quantum network throughput. The main challenge of OptEPS lies in two folds: i). an entanglement may fail to be created; ii). the joint optimization problem suffers from a large time complexity. To overcome these challenges, we first formulate the joint optimization problem as a link-path based model and prune out some candidate paths in order to reduce the time complexity. Then, efficient algorithms are proposed to derive a near-optimal solution in a timely manner. Extensive simulations show that compared with the solutions ignoring EPS placement or without introducing all-optical switching, OptEPS will increase the network throughput by 1557% and 109%, respectively.
Quantum networks facilitate numerous applications including secure communication and distributed quantum computation by performing entanglement distribution. For some multi-user quantum applications access to a shared multipartite state is required. We consider the problem of designing protocols for distributing such states, at an increased rate. For this, we propose three protocols that leverage multipath routing to increase the distribution rate for multi-user applications. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation. Simulation results show that the developed protocols achieve an exponential increase in the distribution rate of multipartite states compared to single path routing techniques, with a maximum increase of four orders of magnitude for the cases studied. Further, the relative increase in distribution rate was also found to improve for larger sets of users. When the protocols were tested in scaled-down real-world topologies, it was found that topology had a significant effect on the multipartite state distribution rates achieved by the protocols. Finally, we found that the benefits of multipath routing are maximum for short quantum memory decoherence times and intermediate values of entanglement generation probability. Hence, the protocols developed can benefit NISQ quantum network control and design.
Multipartite entangled states (MES) are useful resources for a wide range of quantum applications, including quantum secret sharing, and quantum sensing. In this work, we propose a scalable architecture for distributing multipartite entangled states (MES) using arbitrary bipartite quantum networks. In particular, we address the problem of joint tree selection and rate allocation in multipartite entanglement distribution networks in order to optimize the weighted aggregate MES generation rate across different user groups. To obtain optimal solutions, we develop a mixed-integer programming (MIP) model and employ a heuristic approach based on the Genetic algorithm (GA) to obtain feasible solutions efficiently.
Entanglement routing plays a vital role in distributed quantum computing and quantum networks. Previous works on entanglement routing have addressed several design challenges due to limited quantum resources, failures to establish entanglement, and decoherence of established entanglement, but considered neither the limitations imposed by having a limited number of entangled photon sources (EPSes), nor the benefits of using all-optical (or quantum) switching to distribute entangled photons. In this paper, we first explore the problem of jointly optimizing entanglement routing and EPS assignment, assuming no all-optical switching capability. In other words, a pair of entangled photons generated by one EPS can be distributed to two neighboring quantum nodes. We then relax the above assumption so as to allow a pair of entangled photons generated by one EPS to be distributed to non-adjacent nodes using all-optical switching. We propose two corresponding solutions, namely, entanglement routing and EPS assignment (or ERSA), and ERSA with all-optical switching-based distribution (or ERSA+D) that aim to maximize the number of entanglement connections between the given set of source-destination (SD) pairs while avoiding starvation and achieving fairness among the SD pairs. In order to obtain efficient solutions in a large discrete solution space in a timely manner, we first formulate each optimization problem as an Integer Linear Programming (ILP), and then propose efficient algorithms to derive near-optimal solutions based on relaxation, Lagrangian decomposition, duality iteration, and rounding techniques. Extensive simulations show that ERSA+D can increase network throughput by up to 1652% and 113%, respectively, thanks to EPS assignment optimization, and all-optical switching based entanglement distribution.