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

Optical Fiber Communication Conference

Multi-User Entanglement Routing for Quantum Mesh Networks

Evan Sutcliffe, Matty J. Hoban, Alejandra Beghelli

Published Mar 1, 2023• 0 citations
Publisher

Abstract

Multipath routing for sharing entanglement between multiple devices was simulated on real network topologies and compared against single-path routing. Results show improved entanglement rates, especially for topologies with a higher average nodal degree. © 2022 The Author(s)
DOI
10.23919/ofc49934.2023.10116876

Related papers

Multi-User Entanglement Routing for Quantum Mesh Networks

Evan Sutcliffe, Matty J. Hoban, Alejandra Beghelli

Multipath routing for sharing entanglement between multiple devices was simulated on real network topologies and compared against single-path routing. Results show improved entanglement rates, especially for topologies with a higher average nodal degree.

Optical Fiber Communication Conference•Jan 1, 2023•1 citation

Multiuser Entanglement Distribution in Quantum Networks Using Multipath Routing

Evan Sutcliffe, Alejandra Beghelli

Quantum networks facilitate numerous applications including secure communication and distributed quantum computation by performing entanglement distribution. For some multi-user quantum applications access to a shared multipartite state is required. We consider the problem of designing protocols for distributing such states, at an increased rate. For this, we propose three protocols that leverage multipath routing to increase the distribution rate for multi-user applications. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation. Simulation results show that the developed protocols achieve an exponential increase in the distribution rate of multipartite states compared to single path routing techniques, with a maximum increase of four orders of magnitude for the cases studied. Further, the relative increase in distribution rate was also found to improve for larger sets of users. When the protocols were tested in scaled-down real-world topologies, it was found that topology had a significant effect on the multipartite state distribution rates achieved by the protocols. Finally, we found that the benefits of multipath routing are maximum for short quantum memory decoherence times and intermediate values of entanglement generation probability. Hence, the protocols developed can benefit NISQ quantum network control and design.

arXiv:2303.03334•IEEE Transactions on Quantum Engineering•Jan 1, 2023•36 citations

Fidelity-Guaranteed Entanglement Routing in Heterogeneous Multi-Domain Quantum Networks

Yazi Wang, Xiaosong Yu, Yongli Zhao +3 more

A fidelity-guaranteed entanglement routing algorithm for sharing entanglement in heterogeneous quantum networks is simulated on network topologies. Results show improved final fidelity, especially for setting with a higher fidelity threshold.

Opto-Electronics and Communications Conference (OECC)•Jun 30, 2024•0 citations

QuNet: Cost vector analysis & multi-path entanglement routing in quantum networks

Hudson Leone, Nathan Miller, Deepesh Singh +2 more

Entanglement distribution will form the backbone of many future distributed quantum technologies, especially the quantum internet. The act of purifying multiple noisy entangled states into a single one of higher quality has no analogue in classical networking and as such, this transforms the way in which we will consider future algorithms for routing entanglement. We outline the differences that arise because of this, demonstrate some elementary formalisms for `multi-path entanglement routing', and discuss the philosophical differences that arise when comparing this regime to conventional digital network theory. We also present a software package, QuNet, that uses novel `quantum cost-vector analysis' to simulate and benchmark routing in multi-user entanglement networks in a way that is is highly scalable in network size and the number of competing users. Our software accommodates both ground- and space-based networks, and implements efficient multi-user time-optimisation for mitigating congestion when quantum memories are available.

•May 2, 2021•13 citations

Multi-Tree Quantum Routing in Realistic Topologies

Zebo Yang, Ali Ghubaish, Raj Kumar Jain +2 more

In entanglement distribution networks, communication between two nodes necessitates the generation of end-to-end entanglement by entanglement swapping at intermediate nodes. Efficiently creating end-to-end entanglements over long distances is a key objective. In our prior study on asynchronous routing, we enhanced these entanglement rates by leveraging solely the local knowledge of the node's entanglement links. This was achieved by creating a tree structure, particularly a destination-oriented directed acyclic graph (DODAG) or a spanning tree, eliminating synchronous operations and conserving unused entanglement links. In this article, we present a multi-tree approach with multiple DODAGs designed to improve end-to-end entanglement rates in large-scale networks, specifically catering to a range of network topologies, including grids and barbells, as well as realistic topologies found in research testbeds like ESnet and Internet2. Our simulations show a marked improvement in end-to-end entanglement rates for specific topologies compared to the single-tree method. This study underscores the promise of asynchronous routing schemes in quantum networks, highlighting the effectiveness of asynchronous routing across different network topologies and proposing a superior routing tactic.

arXiv:2408.06207•IEEE Communications Magazine•Oct 1, 2024•16 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
Quantum networks facilitate numerous applications including secure communication and distributed quantum computation by performing entanglement distribution. For some multi-user quantum applications access to a shared multipartite state is required. We consider the problem of designing protocols for distributing such states, at an increased rate. For this, we propose three protocols that leverage multipath routing to increase the distribution rate for multi-user applications. The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation. Simulation results show that the developed protocols achieve an exponential increase in the distribution rate of multipartite states compared to single path routing techniques, with a maximum increase of four orders of magnitude for the cases studied. Further, the relative increase in distribution rate was also found to improve for larger sets of users. When the protocols were tested in scaled-down real-world topologies, it was found that topology had a significant effect on the multipartite state distribution rates achieved by the protocols. Finally, we found that the benefits of multipath routing are maximum for short quantum memory decoherence times and intermediate values of entanglement generation probability. Hence, the protocols developed can benefit NISQ quantum network control and design.
Entanglement distribution will form the backbone of many future distributed quantum technologies, especially the quantum internet. The act of purifying multiple noisy entangled states into a single one of higher quality has no analogue in classical networking and as such, this transforms the way in which we will consider future algorithms for routing entanglement. We outline the differences that arise because of this, demonstrate some elementary formalisms for `multi-path entanglement routing', and discuss the philosophical differences that arise when comparing this regime to conventional digital network theory. We also present a software package, QuNet, that uses novel `quantum cost-vector analysis' to simulate and benchmark routing in multi-user entanglement networks in a way that is is highly scalable in network size and the number of competing users. Our software accommodates both ground- and space-based networks, and implements efficient multi-user time-optimisation for mitigating congestion when quantum memories are available.
In entanglement distribution networks, communication between two nodes necessitates the generation of end-to-end entanglement by entanglement swapping at intermediate nodes. Efficiently creating end-to-end entanglements over long distances is a key objective. In our prior study on asynchronous routing, we enhanced these entanglement rates by leveraging solely the local knowledge of the node's entanglement links. This was achieved by creating a tree structure, particularly a destination-oriented directed acyclic graph (DODAG) or a spanning tree, eliminating synchronous operations and conserving unused entanglement links. In this article, we present a multi-tree approach with multiple DODAGs designed to improve end-to-end entanglement rates in large-scale networks, specifically catering to a range of network topologies, including grids and barbells, as well as realistic topologies found in research testbeds like ESnet and Internet2. Our simulations show a marked improvement in end-to-end entanglement rates for specific topologies compared to the single-tree method. This study underscores the promise of asynchronous routing schemes in quantum networks, highlighting the effectiveness of asynchronous routing across different network topologies and proposing a superior routing tactic.
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.