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

WITHDRAWN: Concurrent Multi-path quantum entanglement routing based on segment routing in quantum hybrid networks

Ling Zhang

Published Sep 20, 2022• 3 citations
Publisher

Abstract

Abstract In the future, quantum networks will be an important development direction. Quantum networks should be studied in light of quantum's unique physical properties. In quantum networks with limited resources, decoherence will lead to qubits loss, which restricts the time that data qubits can be stored in memory before use. To realize the network function, it is very important to transmit data qubits as quickly as possible. In order to ensure timeliness and make use of entanglement resources as much as possible, this paper proposes a concurrent multi-path entanglement routing scheme based on segment routing for quantum hybrid networks. Compared with single-path routing, this scheme has obvious advantages in traffic diversion, reducing transmission time and providing redundancy.

DOI
10.21203/rs.3.rs-2066733/v1

Related papers

WITHDRAWN: Concurrent Multi-path quantum entanglement routing based on segment routing in quantum hybrid networks

Abstract The full text of this preprint has been withdrawn, as it was submitted in error. Therefore, the authors do not wish this work to be cited as a reference. Questions should be directed to the corresponding author.

•Mar 13, 2023•0 citations

Multipath concurrent entanglement routing in quantum networks based on virtual circuit

Ling Zhang, Shu-Xiang Ye, Qin Liu +1 more

Quantum network is one of the important development directions of network in the future. Consideration should be given to the unique physical properties of quantum. In quantum networks with relatively limited resources (such as quantum memory), decoherence will lead to qubits loss, which restricts the time that data qubits can be stored in memory before use. Therefore, transmitting data qubits as soon as possible is very important to realize the network function. In order to ensure timeliness, this paper proposes a multipath concurrent entanglement routing scheme based on virtual circuit in quantum networks. Compared with the single path method, this scheme has obvious advantages in reducing the time required to establish the quantum entanglement channel and to transmit the measurement outcomes.

International Conference on Advances in Computer Technology, Information Science and Communications (CTISC)•Apr 22, 2022•8 citations

Concurrent Entanglement Routing for Quantum Networks

Shouqian Shi, 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.

ACM SIGCOMM Conference (SIGCOMM)•Jul 30, 2020•193 citations

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 Entanglement-Based Routing

Jincheng Zhang

This paper proposes a novel approach to network routing leveraging the unique properties of quantum entanglement. Traditional network routing relies on physical distances and delays, presenting inherent limitations in bandwidth and latency. This research posits that quantum entanglement can be harnessed to overcome these constraints, enabling ultra-high bandwidth and low-latency data routing. The core concept involves constructing a "quantum network" composed of entangled qubits, enabling efficient data transmission and routing via precise control of the entangled states. We explore and develop algorithms designed to minimize entanglement loss and latency, crucial factors in realizing the full potential of this technology. The theoretical framework presented here introduces a fundamentally new paradigm for network architecture, moving beyond classical constraints and towards a quantum-enhanced communication infrastructure. The primary focus is on the theoretical design and optimization of routing protocols specifically tailored for entangled quantum networks. We outline a methodology for simulating and optimizing quantum routing algorithms, acknowledging the challenges associated with decoherence and entanglement degradation. This work establishes a foundation for future research and development in quantum networking and routing.

•Aug 31, 2026•0 citations

Online Entanglement Routing in Quantum Networks

Lan Yang, Yangming Zhao, Hongli Xu +1 more

Quantum Data Networks (QDNs) typically leverage teleportation to reliably send data quantum bits (called qubits) to their destinations. To teleport a data qubit from Alice to Bob, one entanglement connection between Alice and Bob needs to be established. Accordingly, we have to establish as many entanglement connections as possible with limited quantum resources in order to maximize the network throughput. Conventional methods assume a known traffic matrix and calculate the paths to establish entanglement connections in one batch using a centralized algorithm. However, these methods are not scalable in large scale QDNs since it is time consuming to optimize the entanglement paths for a batch of requests, which may result in a long time slot duration and significantly reduce the network throughput. To address this issue, we propose an Online Entanglement Routing (OER) scheme which determines the entanglement paths for each request when it arrives. In addition, OER pursues work conservation and fairness among all requests in the QDNs. Through extensive simulations, we demonstrate that OER not only outperforms two representative heuristics by up to 61.27% and 52.79%, respectively, in terms of average request completion time, but also achieves a better fairness performance than these two counterparts.

International Workshop on Quality of Service•Jun 10, 2022•40 citations
Abstract In the future, quantum networks will be an important development direction. Quantum networks should be studied in light of quantum's unique physical properties. In quantum networks with limited resources, decoherence will lead to qubits loss, which restricts the time that data qubits can be stored in memory before use. To realize the network function, it is very important to transmit data qubits as quickly as possible. In order to ensure timeliness and make use of entanglement resources as much as possible, this paper proposes a concurrent multi-path entanglement routing scheme based on segment routing for quantum hybrid networks. Compared with single-path routing, this scheme has obvious advantages in traffic diversion, reducing transmission time and providing redundancy.
Quantum network is one of the important development directions of network in the future. Consideration should be given to the unique physical properties of quantum. In quantum networks with relatively limited resources (such as quantum memory), decoherence will lead to qubits loss, which restricts the time that data qubits can be stored in memory before use. Therefore, transmitting data qubits as soon as possible is very important to realize the network function. In order to ensure timeliness, this paper proposes a multipath concurrent entanglement routing scheme based on virtual circuit in quantum networks. Compared with the single path method, this scheme has obvious advantages in reducing the time required to establish the quantum entanglement channel and to transmit the measurement outcomes.
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.
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.
This paper proposes a novel approach to network routing leveraging the unique properties of quantum entanglement. Traditional network routing relies on physical distances and delays, presenting inherent limitations in bandwidth and latency. This research posits that quantum entanglement can be harnessed to overcome these constraints, enabling ultra-high bandwidth and low-latency data routing. The core concept involves constructing a "quantum network" composed of entangled qubits, enabling efficient data transmission and routing via precise control of the entangled states. We explore and develop algorithms designed to minimize entanglement loss and latency, crucial factors in realizing the full potential of this technology. The theoretical framework presented here introduces a fundamentally new paradigm for network architecture, moving beyond classical constraints and towards a quantum-enhanced communication infrastructure. The primary focus is on the theoretical design and optimization of routing protocols specifically tailored for entangled quantum networks. We outline a methodology for simulating and optimizing quantum routing algorithms, acknowledging the challenges associated with decoherence and entanglement degradation. This work establishes a foundation for future research and development in quantum networking and routing.
Quantum Data Networks (QDNs) typically leverage teleportation to reliably send data quantum bits (called qubits) to their destinations. To teleport a data qubit from Alice to Bob, one entanglement connection between Alice and Bob needs to be established. Accordingly, we have to establish as many entanglement connections as possible with limited quantum resources in order to maximize the network throughput. Conventional methods assume a known traffic matrix and calculate the paths to establish entanglement connections in one batch using a centralized algorithm. However, these methods are not scalable in large scale QDNs since it is time consuming to optimize the entanglement paths for a batch of requests, which may result in a long time slot duration and significantly reduce the network throughput. To address this issue, we propose an Online Entanglement Routing (OER) scheme which determines the entanglement paths for each request when it arrives. In addition, OER pursues work conservation and fairness among all requests in the QDNs. Through extensive simulations, we demonstrate that OER not only outperforms two representative heuristics by up to 61.27% and 52.79%, respectively, in terms of average request completion time, but also achieves a better fairness performance than these two counterparts.