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.
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.
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.
Satellite-assisted quantum network (SQN) is emerging as a promising solution to overcome the distance limitations of ground-based fiber quantum network (QN). However, each satellite and ground station has a limited number of transmitters and receivers, respectively, and the Entanglement Distribution Rate (EDR) decreases with the distance between satellites and ground stations, highlighting the need for effective resource allocation to serve requests in the SQN. In this paper, we present a novel optimization problem, termed ESOP, which aims to maximize the total EDR in the network while simultaneously considering the resource capacities of both satellites and ground stations, as well as the fidelity requirements of individual requests. To solve ESOP, we propose a (2 + ϵ)-approximation algorithm, AESOP, which combines a greedy approach with a tailored local search. Simulation results show that AESOP achieves up to 64% improvement in total EDR compared to the existing method.
Quantum Information networks (QIN) aim to interconnect quantum systems via quantum repeaters through end-to-end entanglement of qubits. The integration of both satellites and ground segments is essential to provide global connectivity, even over large distances. In this paper, we study the problem of entanglement routing in large-scale quantum networks -i.e., with a large number of nodes, with a hybrid space-ground architecture. We decompose the routing problem into two subcomponents: request scheduling and path selection, and structure our approach around two phases: a proactive and a reactive step. We design and implement an entanglement routing strategy in an emulated European quantum network, first in a custom Python-based simulator for performance forecasting, and then into the NetSquid quantum network simulator. Our work thus provides a tool allowing for a comparison between terrestrial and satellite segments in terms of successful end-to-end entanglement in a large-scale network and shows that both segments are required for optimal service. Our results indicate that, within the emulated European topology, terrestrial networks can support end-toend entanglement for approximately 35% of user pairs -the remaining pairs are too distant and suffer from prohibitive losses. In contrast, the satellite-based network achieves connectivity for up to 91% of user pairs, although some pairs remain unreachable due to a lack of simultaneous satellite visibility. However, while satellites can outperform terrestrial networks in total photon distribution, they may not be suitable for lowlatency requests if out of visibility, making ground networks essential. This highlights the complementary roles of space and terrestrial segments in quantum networking.
Efficient entanglement routing is a fundamental challenge in quantum networks due to limited memory and channel resources. Existing routing approaches often ignore per-request demand limits and continue allocating resources to requests that are already saturated, artificially inflating their throughput and limiting the ability to serve other requests. This paper formulates the Quantum Routing Problem (QRP) that jointly accounts for memory, channel, and demand limits, and aims to determine how many entangled paths should be established for each request to maximize the overall network throughput. A novel approximation algorithm based on primal-dual and separation oracle techniques is proposed, with a provable performance guarantee. Extensive simulations show that the proposed approach outperforms existing approaches by up to 29%.
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.