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

Quantum Information Processing

End-to-end entanglement establishment with lower latency in quantum networks

Na Chen, Qi Zhao, Tianqi Dou, Yuheng Xie, Jianjun Tang

Published Jan 27, 2024• 2 citations
Publisher
DOI
10.1007/s11128-023-04241-5

Related papers

Efficient Entanglement Routing for Enhancing Throughput in Quantum Networks

Yaliang Shi, Zhiwei Zhao, Geyong Min +2 more

IEEE Internet of Things Journal•Jan 1, 2026•0 citations

Simulation-Based Analysis of Delay-Reducing Quantum Data Plane Repeater Protocols

Benedikt Baier, Hendrik Bruhse, Carmen Mas Machuca +1 more

Emerging communication systems are expected to integrate new types of communication networks including quantum networks. In contrast to classical networks, the communication in quantum networks is accomplished with qubits and their attribute entanglement. Entanglement is a type of correlation between multiple qubits with no counterpart in classical communication. With the help of entanglement new protocols are developed to perform classical and quantum network tasks more efficiently. The main task of quantum networks is to share entanglement to distant communication partners with the help of intermediate nodes and repeated entanglement swapping, the so called Repeater Protocol. Due to the decoherence of quantum states, establishing entanglement has to be accomplished with minimal delay to preserve the states of qubits. This paper proposes a new Repeater Protocol FRP, which reduces delay by up to 51% and on average by 13% in establishing end-to-end entanglement compared with the direct approach CRP. Additionally, the provided solution lowers hardware requirements for quantum routers. Both protocols, CRP and FRP are evaluated in terms of end-to-end delay and fidelity in extensive simulations with a parameter search on 3 different topologies.

IEEE Future Networks World Forum (FNWF)•Oct 15, 2024•1 citation

Distributed Routing in a Quantum Internet

Kaushik Chakraborty, Filip Rozpędek, Axel Dahlberg +1 more

We develop new routing algorithms for a quantum network with noisy quantum devices such that each can store a small number of qubits. We thereby consider two models for the operation of such a network. The first is a continuous model, in which entanglement between a subset of the nodes is produced continuously in the background. This can in principle allows the rapid creation of entanglement between more distant nodes using the already pre-generated entanglement pairs in the network. The second is an on-demand model, where entanglement production does not commence before a request is made. Our objective is to find protocols, that minimise the latency of the network to serve a request to create entanglement between two distant nodes in the network. We propose three routing algorithms and analytically show that as expected when there is only a single request in the network, then employing them on the continuous model yields a lower latency than on the on-demand one. We study the performance of the routing algorithms in a ring, grid, and recursively generated network topologies. We also give an analytical upper bound on the number of entanglement swap operations the nodes need to perform for routing entangled links between a source and a destination yielding a lower bound on the end to end fidelity of the shared entangled state. We proceed to study the case of multiple concurrent requests and show that in some of the scenarios the on-demand model can outperform the continuous one. Using numerical simulations on ring and grid networks we also study the behaviour of the latency of all the routing algorithms. We observe that the proposed routing algorithms behave far better than the existing classical greedy routing algorithm. The simulations also help to understand the advantages and disadvantages of different types of continuous models for different types of demands.

arXiv:1907.11630•Bulletin of the American Physical Society•Jul 26, 2019•101 citations

Achieving Load-Balanced Entanglement Distribution in Quantum Networks

Zhuoyue Chen, Kechao Cai, Jinbei Zhang +1 more

IEEE Transactions on Communications•Jan 1, 2026•0 citations

Extended entanglement to quantum networks

Sami Ul Haq, Farhan Saif

Optik•Aug 13, 2013•5 citations

Pre-established Entanglement Distribution with Time-Guaranteed Memory Cells Selection in Quantum Networks

Yazi Wang, Yongli Zhao, Xiaosong Yu +2 more

Quantum entanglement enables numerous quantum applications such as secure communication. Based on entanglement-based quantum networks, long-distance entanglement establishment between two distant end nodes is vital to realize practical quantum networks. However, due to the decoherence and imperfect quantum operations such as the non-determinism of entanglement swapping, the latency of remote entanglement distribution will be increased, simultaneously, ongoing quantum operations will be cut off caused by the short coherence time of quantum memory. In this article, we propose a pre-established entanglement distribution algorithm which contains a time-guaranteed memory cells selection algorithm, aiming to choose the maximum time-matching entangled particle in each node to establish end-to-end entanglement. Simulation results show that for the different scales of grid network topologies, all success probability values are increasing with increase the size of the memory cells and the size of the time slots. Considering constructing the large scale of quantum network, it's necessary to consider employing high multi-mode capability and long lifetime quantum memory.

IEEE International Conference on Communication Technology (ICCT)•Nov 11, 2022•1 citation
Emerging communication systems are expected to integrate new types of communication networks including quantum networks. In contrast to classical networks, the communication in quantum networks is accomplished with qubits and their attribute entanglement. Entanglement is a type of correlation between multiple qubits with no counterpart in classical communication. With the help of entanglement new protocols are developed to perform classical and quantum network tasks more efficiently. The main task of quantum networks is to share entanglement to distant communication partners with the help of intermediate nodes and repeated entanglement swapping, the so called Repeater Protocol. Due to the decoherence of quantum states, establishing entanglement has to be accomplished with minimal delay to preserve the states of qubits. This paper proposes a new Repeater Protocol FRP, which reduces delay by up to 51% and on average by 13% in establishing end-to-end entanglement compared with the direct approach CRP. Additionally, the provided solution lowers hardware requirements for quantum routers. Both protocols, CRP and FRP are evaluated in terms of end-to-end delay and fidelity in extensive simulations with a parameter search on 3 different topologies.
We develop new routing algorithms for a quantum network with noisy quantum devices such that each can store a small number of qubits. We thereby consider two models for the operation of such a network. The first is a continuous model, in which entanglement between a subset of the nodes is produced continuously in the background. This can in principle allows the rapid creation of entanglement between more distant nodes using the already pre-generated entanglement pairs in the network. The second is an on-demand model, where entanglement production does not commence before a request is made. Our objective is to find protocols, that minimise the latency of the network to serve a request to create entanglement between two distant nodes in the network. We propose three routing algorithms and analytically show that as expected when there is only a single request in the network, then employing them on the continuous model yields a lower latency than on the on-demand one. We study the performance of the routing algorithms in a ring, grid, and recursively generated network topologies. We also give an analytical upper bound on the number of entanglement swap operations the nodes need to perform for routing entangled links between a source and a destination yielding a lower bound on the end to end fidelity of the shared entangled state. We proceed to study the case of multiple concurrent requests and show that in some of the scenarios the on-demand model can outperform the continuous one. Using numerical simulations on ring and grid networks we also study the behaviour of the latency of all the routing algorithms. We observe that the proposed routing algorithms behave far better than the existing classical greedy routing algorithm. The simulations also help to understand the advantages and disadvantages of different types of continuous models for different types of demands.
Quantum entanglement enables numerous quantum applications such as secure communication. Based on entanglement-based quantum networks, long-distance entanglement establishment between two distant end nodes is vital to realize practical quantum networks. However, due to the decoherence and imperfect quantum operations such as the non-determinism of entanglement swapping, the latency of remote entanglement distribution will be increased, simultaneously, ongoing quantum operations will be cut off caused by the short coherence time of quantum memory. In this article, we propose a pre-established entanglement distribution algorithm which contains a time-guaranteed memory cells selection algorithm, aiming to choose the maximum time-matching entangled particle in each node to establish end-to-end entanglement. Simulation results show that for the different scales of grid network topologies, all success probability values are increasing with increase the size of the memory cells and the size of the time slots. Considering constructing the large scale of quantum network, it's necessary to consider employing high multi-mode capability and long lifetime quantum memory.