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

IEEE International Conference on Quantum Computing and Engineering (QCE)

Scalable Multipartite Entanglement Distribution in Quantum Networks

Nitish K. Panigrahy, Matheus Guedes de Andrade, Shahrooz Pouryousef, Don Towsley, Leandros Tassiulas

Published Sep 17, 2023• 5 citations
Publisher

Abstract

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.

DOI
10.1109/qce57702.2023.10297

Related papers

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

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

Distributing Multipartite Entanglement over Noisy Quantum Networks

Luís Bugalho, Bruno Coelho Coutinho, Francisco A. Monteiro +1 more

A quantum internet aims at harnessing networked quantum technologies, namely by distributing bipartite entanglement between distant nodes. However, multipartite entanglement between the nodes may empower the quantum internet for additional or better applications for communications, sensing, and computation. In this work, we present an algorithm for generating multipartite entanglement between different nodes of a quantum network with noisy quantum repeaters and imperfect quantum memories, where the links are entangled pairs. Our algorithm is optimal for GHZ states with 3 qubits, maximising simultaneously the final state fidelity and the rate of entanglement distribution. Furthermore, we determine the conditions yielding this simultaneous optimality for GHZ states with a higher number of qubits, and for other types of multipartite entanglement. Our algorithm is general also in the sense that it can optimise simultaneously arbitrary parameters. This work opens the way to optimally generate multipartite quantum correlations over noisy quantum networks, an important resource for distributed quantum technologies.

arXiv:2103.14759•Quantum•Feb 9, 2023•83 citations

Optimized Source Placement for Multipartite State Distribution in Quantum Networks

Zheng Zhang, Qiaolun Zhang, Jiaheng Xiong +3 more

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.

•Jan 1, 2026•0 citations

Optimized Distribution of Entanglement Graph States in Quantum Networks

Xiaojie Fan, Caitao Zhan, Himanshu Gupta +1 more

Building large-scale quantum computers, essential to demonstrating quantum advantage, is a key challenge. Quantum networks can help address this challenge by enabling the construction of large, robust, and more capable quantum computing platforms by connecting smaller quantum computers. Moreover, unlike classical systems, quantum networks can enable fully secured long-distance communication. Thus, quantum networks lie at the heart of the success of future quantum information technologies. In quantum networks, multipartite entangled states distributed over the network help implement and support many quantum network applications for communications, sensing, and computing. Our work focuses on developing optimal techniques to generate and distribute multipartite entanglement states efficiently. Prior works on generating general multipartite entanglement states have focused on the objective of minimizing the number of maximally entangled pairs while ignoring the heterogeneity of the network nodes and links as well as the stochastic nature of underlying processes. In this work, we develop a hypergraph-based linear programming framework that delivers optimal (under certain assumptions) generation schemes for general multipartite entanglement represented by graph states, under the network resources, decoherence, and fidelity constraints, while considering the stochasticity of the underlying processes. We illustrate our technique by developing generation schemes for the special cases of path and tree graph states and discuss optimized generation schemes for more general classes of graph states. Using extensive simulations over a quantum network simulator, we demonstrate the effectiveness of our developed techniques and show that they outperform prior known schemes by up to orders of magnitude.

arXiv:2405.00222•IEEE Transactions on Quantum Engineering•Jan 1, 2025•32 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 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.
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.
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.
A quantum internet aims at harnessing networked quantum technologies, namely by distributing bipartite entanglement between distant nodes. However, multipartite entanglement between the nodes may empower the quantum internet for additional or better applications for communications, sensing, and computation. In this work, we present an algorithm for generating multipartite entanglement between different nodes of a quantum network with noisy quantum repeaters and imperfect quantum memories, where the links are entangled pairs. Our algorithm is optimal for GHZ states with 3 qubits, maximising simultaneously the final state fidelity and the rate of entanglement distribution. Furthermore, we determine the conditions yielding this simultaneous optimality for GHZ states with a higher number of qubits, and for other types of multipartite entanglement. Our algorithm is general also in the sense that it can optimise simultaneously arbitrary parameters. This work opens the way to optimally generate multipartite quantum correlations over noisy quantum networks, an important resource for distributed quantum technologies.
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.
Building large-scale quantum computers, essential to demonstrating quantum advantage, is a key challenge. Quantum networks can help address this challenge by enabling the construction of large, robust, and more capable quantum computing platforms by connecting smaller quantum computers. Moreover, unlike classical systems, quantum networks can enable fully secured long-distance communication. Thus, quantum networks lie at the heart of the success of future quantum information technologies. In quantum networks, multipartite entangled states distributed over the network help implement and support many quantum network applications for communications, sensing, and computing. Our work focuses on developing optimal techniques to generate and distribute multipartite entanglement states efficiently. Prior works on generating general multipartite entanglement states have focused on the objective of minimizing the number of maximally entangled pairs while ignoring the heterogeneity of the network nodes and links as well as the stochastic nature of underlying processes. In this work, we develop a hypergraph-based linear programming framework that delivers optimal (under certain assumptions) generation schemes for general multipartite entanglement represented by graph states, under the network resources, decoherence, and fidelity constraints, while considering the stochasticity of the underlying processes. We illustrate our technique by developing generation schemes for the special cases of path and tree graph states and discuss optimized generation schemes for more general classes of graph states. Using extensive simulations over a quantum network simulator, we demonstrate the effectiveness of our developed techniques and show that they outperform prior known schemes by up to orders of magnitude.
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.