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

Globecom

Authorizable Tripartite Entanglement Routing via 3-GHZ State in Quantum Networks

Shao-Min Huang, Ching-Ting Wei, Kai-Xu Zhan, Juliette Chou Le Touze, Jian-Jhih Kuo, Chih-Yu Wang

Published Dec 8, 2024• 1 citation
Publisher

Abstract

Traditional end-to-end entanglement typically operates between two parties. However, such a setup may fall short when three parties are involved. GHZ states, a multi-qubit entangled state, provide an approach to such a problem. A fusion node is first chosen, and then the paths from all end nodes to the fusion node are fused to create an entangled state between all parties. The selection of the fusion node becomes critical since it highly affects the success probability of the whole process. Thus, in this paper, we explore the promising scenario for multiple requests of authorizable tripartite teleportation and introduce a novel optimization problem to maximize the (expected) total profit for 3-GHZ requests. Via extensive simulation results, we show that our algorithm can outperform existing approaches significantly.

DOI
10.1109/globecom52923.2024.10901779

Related papers

Asynchronous Routing for Multipartite Entanglement in Quantum Networks

Chenliang Tian, Zebo Yang, Raj Jain +6 more

In quantum networks, one way to communicate is to distribute entanglements through swapping at intermediate nodes. Most existing work primarily aims to create efficient two-party end-to-end entanglement over long distances. However, some scenarios also require remote multipartite entanglement for applications such as quantum secret sharing and multi-party computation. Our previous study improved end-to-end entanglement rates using an asynchronous, tree-based routing scheme that relies solely on local knowledge of entanglement links, conserving unused entanglement and avoiding synchronous operations. This article extends this approach to multipartite entanglements, particularly the three-party Greenberger-Horne-Zeilinger (GHZ) states. It shows that our asynchronous protocol outperforms traditional synchronous methods in entanglement rates, especially as coherence times increase. This approach can also be extended to four-party and larger multipartite GHZ states, highlighting the effectiveness and adaptability of asynchronous routing for multipartite scenarios across various network topologies.

quant-pharXiv:2603.27551•IEEE Annual Computing and Communication Workshop and Conference (CCWC)•Mar 31, 2026•2 citations

Multipartite Entanglement Routing in Integrated Ground–Satellite Quantum Networks

Xiangxing Guo, Yu Zhang, Lei Fan +4 more

Quantum networks are expected to support a wide range of emerging applications by enabling entanglement routing among remote nodes. Existing studies on quantum entanglement routing primarily focus on either ground-based networks or satellite-assisted networks. Moreover, bipartite and multipartite entanglement demands are typically considered separately, whereas practical quantum networks must simultaneously support heterogeneous entanglement demands. To fill this gap, this paper investigates an integrated ground–satellite quantum network that jointly considers both network architectures and demand types, serving both bipartite (Bell) and multipartite (GHZ) entanglement demands. We propose a unified optimization framework that jointly determines entanglement routing, resource allocation, and fusion-node selection for GHZ demands, with the objective of maximizing the expected entanglement delivery rate. To prevent multipartite entanglement requests from being consistently dominated by Bell demands, we incorporate an ϵ-constraint that enforces a minimum level of GHZ demand admission. Extensive simulation results demonstrate that the proposed approach significantly improves the total expected throughput while ensuring a higher admission rate for GHZ entanglement demands than existing routing schemes.

International Conference on Computer Communications and Networks (ICCCN)•Jul 1, 2026•0 citations

Generation and Distribution of GHZ States in Quantum Networks

Mohammad Ghaderibaneh, Himanshu Gupta, C. R. Ramakrishnan

In quantum networks, multipartite entangled states distributed over the network are useful in implementing and supporting many quantum network applications for communications, sensing, and computing. The focus of our work is to de-velop techniques to efficiently generate distributed Greenberger-Horne-Zeilinger (GHZ) states, a special class of multipartite entanglement states. Prior works on generating GHZ states have focused on the objective of minimizing the number of maximally entangled (bipartite) pairs (EPs), while ignoring the stochastic nature of quantum processes and assuming uniform network links for generating EPs. In contrast, in our work, we take into consideration the stochastic nature of quantum networks, and focus on maximizing the expected generated rate of the GHZ states under given fidelity constraints. In this context, we develop two efficient generation schemes, viz., Fusion - Retain - only and General Fusion, comprised of optimal or near-optimal sub-steps. Both schemes, at a high-level, first determine a way to “connect” the nodes over which the GHZ state is to distributed, and then, determine a sequence of fusion operations on the EPs created over the connections. Using extensive simulations over a quantum network simulator (NetSquid), we demonstrate the effectiveness of our developed techniques and show that our schemes outperform prior work as well as a simple centralized approach by up to orders of magnitude while generating GHZ states of tolerable fidelity.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•21 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

Multiparty entanglement routing in quantum networks

Vaisakh Mannalath, Anirban Pathak

Distributing entanglement among multiple users is a fundamental problem in quantum networks, requiring an efficient solution. In this work, a protocol is proposed for extracting maximally entangled ($|{\text{GHZ}}_{n}\ensuremath{\rangle}$) states for any number of parties in a quantum network. It is based on the graph-state formalism and requires minimal assumptions on the network state. The protocol only requires local measurements at the network nodes and just a single-qubit memory per user. Existing protocols on bipartite entanglement routing are also improved for specific nearest-neighbor network architectures. To this end, the concept of majorization is utilized to establish a hierarchy among different paths in a network based on their efficacy. This approach utilizes the symmetry of the underlying graph state to obtain better-performing algorithms.

arXiv:2211.06690•Physical Review A•Dec 19, 2023•34 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
Traditional end-to-end entanglement typically operates between two parties. However, such a setup may fall short when three parties are involved. GHZ states, a multi-qubit entangled state, provide an approach to such a problem. A fusion node is first chosen, and then the paths from all end nodes to the fusion node are fused to create an entangled state between all parties. The selection of the fusion node becomes critical since it highly affects the success probability of the whole process. Thus, in this paper, we explore the promising scenario for multiple requests of authorizable tripartite teleportation and introduce a novel optimization problem to maximize the (expected) total profit for 3-GHZ requests. Via extensive simulation results, we show that our algorithm can outperform existing approaches significantly.
In quantum networks, one way to communicate is to distribute entanglements through swapping at intermediate nodes. Most existing work primarily aims to create efficient two-party end-to-end entanglement over long distances. However, some scenarios also require remote multipartite entanglement for applications such as quantum secret sharing and multi-party computation. Our previous study improved end-to-end entanglement rates using an asynchronous, tree-based routing scheme that relies solely on local knowledge of entanglement links, conserving unused entanglement and avoiding synchronous operations. This article extends this approach to multipartite entanglements, particularly the three-party Greenberger-Horne-Zeilinger (GHZ) states. It shows that our asynchronous protocol outperforms traditional synchronous methods in entanglement rates, especially as coherence times increase. This approach can also be extended to four-party and larger multipartite GHZ states, highlighting the effectiveness and adaptability of asynchronous routing for multipartite scenarios across various network topologies.
Quantum networks are expected to support a wide range of emerging applications by enabling entanglement routing among remote nodes. Existing studies on quantum entanglement routing primarily focus on either ground-based networks or satellite-assisted networks. Moreover, bipartite and multipartite entanglement demands are typically considered separately, whereas practical quantum networks must simultaneously support heterogeneous entanglement demands. To fill this gap, this paper investigates an integrated ground–satellite quantum network that jointly considers both network architectures and demand types, serving both bipartite (Bell) and multipartite (GHZ) entanglement demands. We propose a unified optimization framework that jointly determines entanglement routing, resource allocation, and fusion-node selection for GHZ demands, with the objective of maximizing the expected entanglement delivery rate. To prevent multipartite entanglement requests from being consistently dominated by Bell demands, we incorporate an ϵ-constraint that enforces a minimum level of GHZ demand admission. Extensive simulation results demonstrate that the proposed approach significantly improves the total expected throughput while ensuring a higher admission rate for GHZ entanglement demands than existing routing schemes.
In quantum networks, multipartite entangled states distributed over the network are useful in implementing and supporting many quantum network applications for communications, sensing, and computing. The focus of our work is to de-velop techniques to efficiently generate distributed Greenberger-Horne-Zeilinger (GHZ) states, a special class of multipartite entanglement states. Prior works on generating GHZ states have focused on the objective of minimizing the number of maximally entangled (bipartite) pairs (EPs), while ignoring the stochastic nature of quantum processes and assuming uniform network links for generating EPs. In contrast, in our work, we take into consideration the stochastic nature of quantum networks, and focus on maximizing the expected generated rate of the GHZ states under given fidelity constraints. In this context, we develop two efficient generation schemes, viz., Fusion - Retain - only and General Fusion, comprised of optimal or near-optimal sub-steps. Both schemes, at a high-level, first determine a way to “connect” the nodes over which the GHZ state is to distributed, and then, determine a sequence of fusion operations on the EPs created over the connections. Using extensive simulations over a quantum network simulator (NetSquid), we demonstrate the effectiveness of our developed techniques and show that our schemes outperform prior work as well as a simple centralized approach by up to orders of magnitude while generating GHZ states of tolerable fidelity.
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.
Distributing entanglement among multiple users is a fundamental problem in quantum networks, requiring an efficient solution. In this work, a protocol is proposed for extracting maximally entangled ($|{\text{GHZ}}_{n}\ensuremath{\rangle}$) states for any number of parties in a quantum network. It is based on the graph-state formalism and requires minimal assumptions on the network state. The protocol only requires local measurements at the network nodes and just a single-qubit memory per user. Existing protocols on bipartite entanglement routing are also improved for specific nearest-neighbor network architectures. To this end, the concept of majorization is utilized to establish a hierarchy among different paths in a network based on their efficacy. This approach utilizes the symmetry of the underlying graph state to obtain better-performing 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.