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 Distributed Computing Systems (ICDCS)

Multi-User Entanglement Routing Design over Quantum Internets

Yiming Zeng, Jiarui Zhang, Xiaojun Shang, Ji yin Liu, Zhenhua Liu, Yuanyuan Yang

Published Jul 23, 2024• 6 citations
Publisher

Abstract

Quantum Internet has potential capabilities far beyond the traditional Internet and is thus a promising future platform for communication and computation. Entanglement is a cornerstone of quantum mechanics and forms the basis of numerous quantum applications in the quantum Internet. While existing studies primarily focus on two-user entanglement, a plethora of applications necessitates the leap to multi-user entanglement. This paper tackles the fundamental problem of multi-user entanglement routing in the quantum Internet, aiming to entangle multiple quantum users with a high entanglement rate. We abstract the problem as a novel graph routing problem, which is not readily addressed by existing graph problem solutions due to the unique characteristics of the quantum Internet. To address this problem, we first consider a sufficient condition ensuring a feasible solution's existence and design an algorithm with the optimal solution. Given the NP-Completeness and NP- Hardness of determining a feasible solution's existence and deriving an optimal solution in general cases, respectively, we propose two heuristic algorithms to offer efficient solutions, which are shown, via extensive simulations, to outperform the existing algorithms in terms of entanglement rates.

DOI
10.1109/icdcs60910.2024.00033

Related papers

Multi-Entanglement Routing Design over Quantum Networks

Yiming Zeng, Jiarui Zhang, Ji yin Liu +2 more

Quantum networks are considered as a promising future platform for quantum information exchange and quantum applications, which have capabilities far beyond the traditional communication networks. Remote quantum entanglement is an essential component of a quantum network. How to efficiently design a multi-routing entanglement protocol is a fundamental yet challenging problem. In this paper, we study a quantum entanglement routing problem to simultaneously maximize the number of quantum-user pairs and their expected throughput. Our approach is to formulate the problem as two sequential integer programming steps. We propose efficient entanglement routing algorithms for the two integer programming steps and analyze their time complexity and performance bounds. Results of evaluation highlight that our approach outperforms existing solutions in both served quantum-user pairs numbers and the network expected throughput.

arXiv:2205.15501•IEEE Conference on Computer Communications (INFOCOM)•May 2, 2022•64 citations

Entanglement Routing Design Over Quantum Networks

Yiming Zeng, Jiarui Zhang, Ji yin Liu +2 more

Quantum networks have emerged as a future platform for quantum information exchange and applications, with promising capabilities far beyond traditional communication networks. Remote quantum entanglement is an essential component of a quantum network. How to efficiently design a multi-routing entanglement protocol is a fundamental yet challenging problem. In this paper, we study a quantum entanglement routing problem to simultaneously maximize the number of quantum-user pairs and their expected throughput. Our approach is to formulate the problem as two sequential integer programming problems. We propose efficient entanglement routing algorithms for these two optimization problems and analyze their time complexity and performance bounds. Evaluation results highlight that our approach outperforms existing solutions in both the number of quantum-user pairs served and network throughput.

IEEE/ACM Transactions on Networking•Jun 19, 2023•37 citations

Entanglement Management through Swapping over Quantum Internets

Yiming Zeng, Jiarui Zhang, Zhenhua Liu +1 more

Quantum Internet has the potential to support a wide range of applications in quantum communication and quantum computing by generating, distributing, and processing quantum information. Generating a long-distance quantum entanglement is one of the most essential functions of a quantum Internet to facilitate these applications. However, entanglement is a probabilistic process, and its success rate drops significantly as distance increases. Entanglement swapping is an efficient technique used to address this challenge. How to efficiently manage the entanglement through swapping is a fundamental yet challenging problem. In this paper, we will consider two swapping methods: (1) BSM: a classic entanglement-swapping method based on Bell State measurements that fuse two successful quantum links, (2) nfusion: a more general and efficient swapping method based on Greenberger-Horne-Zeilinger measurements, capable of fusing n successful quantum links. Our goal is to maximize the entanglement rate for multiple quantum-user pairs over the quantum Internet with an arbitrary topology. We propose efficient entanglement management algorithms that utilized the unique properties of BSM and n-fusion. Evaluation results highlight that our approach outperforms existing routing protocols.

ACM SIGMETRICS Performance Evaluation Review•Sep 28, 2023•2 citations

Mi-Co: Models and Algorithms for Cost-efficient Entanglement Distribution in the Quantum Internet

Huayue Gu, Zhouyu Li, Xiaojian Wang +3 more

Operating a quantum network incurs high capital and operational expenditures, which are expected to be compensated by the high value of enabled quantum applications. However, existing mechanisms mainly focus on maximizing the entanglement distribution rate and neglect the cost incurred on users. This paper aims to address how to utilize quantum network resources in a cost-efficient manner while sustaining high-quantity entanglement distribution. We first consider how to establish a steady stream of entanglements between remote nodes with the minimum cost. Utilizing a recent flow-based abstraction and a novel graph representation, we design an optimal algorithm for min-cost remote entanglement distribution. Our algorithm provides rigorous tools for supporting high-performance quantum network applications with financial consideration and offers longterm data transmission in remote distances. Extensive simulation results validate the advantageous performance compared to existing solutions and heuristics.

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Mar 31, 2025•1 citation

Quantum Network Routing Design with Dynamic Requests Scheduling in Multi-User Environments

Xinrui Liu, Ruidong Li

Scheduling in quantum networks involves strategically allocating quantum resources to maximize entanglement distribution efficiency and overall performance. Unlike classical networks, quantum systems lack conventional buffering mechanisms, making traditional scheduling paradigms less effective. Existing quantum network algorithms predominantly focus on routing algorithms to identify optimal entanglement paths, often neglecting timeslot scheduling for mitigating resource contention and transmission latency, particularly under multi-user environments. To address these challenges, we propose a routing algorithm tightly integrated with priority-based dynamic scheduling. The algorithm not only discovers efficient entanglement paths but also optimizes resource utilization for concurrent requests. Simulation results confirm that this approach conserves quantum resources, reduces latency, and substantially boosts network performance, providing a robust solution for multi-user quantum environments.

International Wireless Communications and Mobile Computing Conference (IWCMC)•May 12, 2025•1 citation

Concurrent Entanglement Routing for Quantum Networks: Model and Designs

Shouqian Shi, Xiaoxue Zhang, Chen Qian

Quantum entanglement enables important computing applications such as quantum key distribution. Based on quantum entanglement, quantum networks are built to provide long-distance secret sharing between two remote communication parties. Establishing a multi-hop quantum entanglement exhibits a high failure rate, and existing quantum networks rely on trusted repeater nodes to transmit quantum bits. However, when the scale of a quantum network increases, it requires end-to-end multi-hop quantum entanglements in order to deliver secret bits without letting the repeaters know the secret bits. This work focuses on the entanglement routing problem, whose objective is to build long-distance entanglements via untrusted repeaters for concurrent source-destination pairs through multiple hops. Different from existing work that analyzes the traditional routing techniques on special network topologies, we present a comprehensive entanglement routing model that reflects the differences between quantum networks and classical networks as well as a new entanglement routing algorithm that utilizes the unique properties of quantum networks. Evaluation results show that the proposed algorithm Q-CAST increases the number of successful long-distance entanglements by a big margin compared to other methods. The model and simulator developed by this work may encourage more network researchers to study the entanglement routing problem.

IEEE/ACM Transactions on Networking•Jan 5, 2024•71 citations
Quantum Internet has potential capabilities far beyond the traditional Internet and is thus a promising future platform for communication and computation. Entanglement is a cornerstone of quantum mechanics and forms the basis of numerous quantum applications in the quantum Internet. While existing studies primarily focus on two-user entanglement, a plethora of applications necessitates the leap to multi-user entanglement. This paper tackles the fundamental problem of multi-user entanglement routing in the quantum Internet, aiming to entangle multiple quantum users with a high entanglement rate. We abstract the problem as a novel graph routing problem, which is not readily addressed by existing graph problem solutions due to the unique characteristics of the quantum Internet. To address this problem, we first consider a sufficient condition ensuring a feasible solution's existence and design an algorithm with the optimal solution. Given the NP-Completeness and NP- Hardness of determining a feasible solution's existence and deriving an optimal solution in general cases, respectively, we propose two heuristic algorithms to offer efficient solutions, which are shown, via extensive simulations, to outperform the existing algorithms in terms of entanglement rates.
Quantum networks are considered as a promising future platform for quantum information exchange and quantum applications, which have capabilities far beyond the traditional communication networks. Remote quantum entanglement is an essential component of a quantum network. How to efficiently design a multi-routing entanglement protocol is a fundamental yet challenging problem. In this paper, we study a quantum entanglement routing problem to simultaneously maximize the number of quantum-user pairs and their expected throughput. Our approach is to formulate the problem as two sequential integer programming steps. We propose efficient entanglement routing algorithms for the two integer programming steps and analyze their time complexity and performance bounds. Results of evaluation highlight that our approach outperforms existing solutions in both served quantum-user pairs numbers and the network expected throughput.
Quantum networks have emerged as a future platform for quantum information exchange and applications, with promising capabilities far beyond traditional communication networks. Remote quantum entanglement is an essential component of a quantum network. How to efficiently design a multi-routing entanglement protocol is a fundamental yet challenging problem. In this paper, we study a quantum entanglement routing problem to simultaneously maximize the number of quantum-user pairs and their expected throughput. Our approach is to formulate the problem as two sequential integer programming problems. We propose efficient entanglement routing algorithms for these two optimization problems and analyze their time complexity and performance bounds. Evaluation results highlight that our approach outperforms existing solutions in both the number of quantum-user pairs served and network throughput.
Quantum Internet has the potential to support a wide range of applications in quantum communication and quantum computing by generating, distributing, and processing quantum information. Generating a long-distance quantum entanglement is one of the most essential functions of a quantum Internet to facilitate these applications. However, entanglement is a probabilistic process, and its success rate drops significantly as distance increases. Entanglement swapping is an efficient technique used to address this challenge. How to efficiently manage the entanglement through swapping is a fundamental yet challenging problem. In this paper, we will consider two swapping methods: (1) BSM: a classic entanglement-swapping method based on Bell State measurements that fuse two successful quantum links, (2) nfusion: a more general and efficient swapping method based on Greenberger-Horne-Zeilinger measurements, capable of fusing n successful quantum links. Our goal is to maximize the entanglement rate for multiple quantum-user pairs over the quantum Internet with an arbitrary topology. We propose efficient entanglement management algorithms that utilized the unique properties of BSM and n-fusion. Evaluation results highlight that our approach outperforms existing routing protocols.
Operating a quantum network incurs high capital and operational expenditures, which are expected to be compensated by the high value of enabled quantum applications. However, existing mechanisms mainly focus on maximizing the entanglement distribution rate and neglect the cost incurred on users. This paper aims to address how to utilize quantum network resources in a cost-efficient manner while sustaining high-quantity entanglement distribution. We first consider how to establish a steady stream of entanglements between remote nodes with the minimum cost. Utilizing a recent flow-based abstraction and a novel graph representation, we design an optimal algorithm for min-cost remote entanglement distribution. Our algorithm provides rigorous tools for supporting high-performance quantum network applications with financial consideration and offers longterm data transmission in remote distances. Extensive simulation results validate the advantageous performance compared to existing solutions and heuristics.
Scheduling in quantum networks involves strategically allocating quantum resources to maximize entanglement distribution efficiency and overall performance. Unlike classical networks, quantum systems lack conventional buffering mechanisms, making traditional scheduling paradigms less effective. Existing quantum network algorithms predominantly focus on routing algorithms to identify optimal entanglement paths, often neglecting timeslot scheduling for mitigating resource contention and transmission latency, particularly under multi-user environments. To address these challenges, we propose a routing algorithm tightly integrated with priority-based dynamic scheduling. The algorithm not only discovers efficient entanglement paths but also optimizes resource utilization for concurrent requests. Simulation results confirm that this approach conserves quantum resources, reduces latency, and substantially boosts network performance, providing a robust solution for multi-user quantum environments.
Quantum entanglement enables important computing applications such as quantum key distribution. Based on quantum entanglement, quantum networks are built to provide long-distance secret sharing between two remote communication parties. Establishing a multi-hop quantum entanglement exhibits a high failure rate, and existing quantum networks rely on trusted repeater nodes to transmit quantum bits. However, when the scale of a quantum network increases, it requires end-to-end multi-hop quantum entanglements in order to deliver secret bits without letting the repeaters know the secret bits. This work focuses on the entanglement routing problem, whose objective is to build long-distance entanglements via untrusted repeaters for concurrent source-destination pairs through multiple hops. Different from existing work that analyzes the traditional routing techniques on special network topologies, we present a comprehensive entanglement routing model that reflects the differences between quantum networks and classical networks as well as a new entanglement routing algorithm that utilizes the unique properties of quantum networks. Evaluation results show that the proposed algorithm Q-CAST increases the number of successful long-distance entanglements by a big margin compared to other methods. The model and simulator developed by this work may encourage more network researchers to study the entanglement routing problem.