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

Asia Communications and Photonics Conference

Time-Scheduled End-to-End Entanglement Establishment in Memory-Cells-Limited Quantum Networks

Yazi Wang, Xiaosong Yu, Yongli Zhao, Avishek Nag, Jie Zhang

Published Nov 4, 2023• 1 citation
Publisher

Abstract

A routing and entangled pairs allocation algorithm was proposed to support remote entangled pairs sharing with finite storage capacity and limited storage time, upon satisfying the time constraint, and the proposed algorithm is further verified via simulation.
DOI
10.1109/acp/poem59049.2023.10368812

Related papers

Time-Scheduled End-to-End Entanglement Establishment in Memory-Cell-Limited Quantum Networks

Yazi Wang, Xiaosong Yu, Yongli Zhao +3 more

Quantum entanglement enables quantum networks to provide end-to-end sharing of entangled particles, establishing multi-hop path-to-path connections between remote parties. Implementing entanglement distribution plays a vital role in increasing the network scale, and practical entanglement algorithms are required to provide end-to-end multi-hop quantum entanglement. We consider the real-time entanglement distribution (R-TED) and pre-established entanglement distribution (P-EED) to meet this requirement. Based on these two types of entanglement distribution, we propose two algorithms, i.e., R-TED-based routing and entangled pairs allocation (REA) algorithm as well as P-EED-based REA algorithm for end-to-end entanglement establishment, where the practical physical factors (e.g., finite storage capacity and limited storage time) are considered. The R-TED-based REA algorithm can orchestrate the nodes in a route and perform entanglement swapping by adopting real-time entanglement. For the P-EED-based REA algorithm, remote entangled particle sharing can be achieved via pre-shared entanglement distribution and hop-by-hop entanglement swapping. This way, the entanglement routing selection satisfies the storage time constraint and allows two far-apart nodes to share long-distance entangled particles with limited memory cells. We evaluate the performance of the proposed algorithms under different network topologies and sizes, based on which we demonstrate that the network size can significantly affect the efficiency advantage achieved by the P-EED-based approach over the R-TED-based approach.

IEEE Transactions on Networking•Apr 30, 2025•2 citations

A Connectionless Entanglement Distribution Protocol Design in Quantum Networks

Zirui Xiao, Jian Li, Kaiping Xue +4 more

Remote entanglement distribution plays a crucial role in quantum networks, which can support many essential and exciting quantum applications. As the network scale expands, it is urgent to design a general and efficient remote entanglement distribution protocol. Nowadays, connection-oriented remote entanglement distribution protocols are available to achieve reliable entanglement distribution. However, in memory-limited quantum networks, connection-oriented entanglement distribution protocols cannot utilize entanglement resources fully and increase the delay of End-to-End (E2E) entanglement connection establishment. To overcome these shortcomings of existing entanglement distribution protocols, we design a connectionless remote entanglement distribution protocol to let Source-Destination (S-D) pairs compete for entanglement resources simultaneously. In our protocol, a fair request scheduling algorithm is proposed to reduce the waiting time without entanglement connections between S-D pairs. Furthermore, a fast scheduling trigger mechanism is proposed to perform entanglement swapping timely to reduce the delay of E2E entanglement connection establishment. The simulation results show that the designed protocol has advantages in terms of resource utilization, throughput, the service completion time of S-D pairs, and the maximum waiting time, compared with the existing remote entanglement distribution protocol.

IEEE Network•Oct 9, 2023•21 citations

Purification-enabled Routing with Guaranteed Fidelity in Entanglement Distribution Networks

Yazi Wang, Xiaosong Yu, Yongli Zhao +1 more

A purification-enabled routing algorithm was proposed to support remote entangled pairs sharing with limited quantum resources, upon satisfying the fidelity threshold for generated remote entanglements, and the proposed algorithm is further verified via simulation.

Opto-Electronics and Communications Conference (OECC)•Jul 2, 2023•2 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

Pre-established entanglement distribution algorithm in quantum networks

Yazi Wang, Xiaosong Yu, Yongli Zhao +2 more

As the basic principle of quantum networks, quantum entanglement can enable important quantum applications such as teleportation and quantum-key distribution. To realize wide-area quantum communication, entanglement establishment between two remote communication parties is vital, and it requires effective entanglement distribution strategies. Entanglement distribution network models of distributed and centralized entangled pair sources are constructed, based on which two entanglement-distribution algorithms are proposed, i.e., the real-time entanglement distribution (R-TED) algorithm and the pre-established entanglement distribution (P-EED) algorithm, to achieve end-to-end multi-hop entanglement establishment. For the former, the objective is to build long-distance entanglements via hop-by-hop entanglement tentatively and entanglement swapping to finally glue them together. For the latter, which uses pre-established entanglement, entanglements can be established in advance to patch multiple link-level entanglements via entanglement swapping. Simulation results show that as the number of time slots increases, the P-EED algorithm is more efficient and has higher entanglement establishment probability than the R-TED algorithm to establish end-to-end entanglement; while there are fewer memory cells in a quantum memory, such as 10, the R-TED algorithm provides more stable entanglement distribution compared to the P-EED algorithm.

Journal of Optical Communications and Networking•Nov 15, 2022•13 citations

Effective routing design for remote entanglement generation on quantum networks

Changhao Li, Tianyi Li, Yi-Xiang Liu +1 more

Abstract Quantum network is a promising platform for many ground-breaking applications that lie beyond the capability of its classical counterparts. Efficient entanglement generation on quantum networks with relatively limited resources such as quantum memories is essential to fully realize the network’s capabilities, the solution to which calls for delicate network design and is currently at the primitive stage. In this study we propose an effective routing scheme to enable automatic responses for multiple requests of entanglement generation between source-terminal stations on a quantum lattice network with finite edge capacities. Multiple connection paths are exploited for each connection request while entanglement fidelity is ensured for each path by performing entanglement purification. The routing scheme is highly modularized with a flexible nature, embedding quantum operations within the algorithmic workflow, whose performance is evaluated from multiple perspectives. In particular, three algorithms are proposed and compared for the scheduling of capacity allocation on the edges of quantum network. Embodying the ideas of proportional share and progressive filling that have been well-studied in classical routing problems, we design another scheduling algorithm, the propagatory update method, which in certain aspects overrides the two algorithms based on classical heuristics in scheduling performances. The general solution scheme paves the road for effective design of efficient routing and flow control protocols on applicational quantum networks.

arXiv:2001.02204•npj Quantum Information•Jan 27, 2021•133 citations
Quantum entanglement enables quantum networks to provide end-to-end sharing of entangled particles, establishing multi-hop path-to-path connections between remote parties. Implementing entanglement distribution plays a vital role in increasing the network scale, and practical entanglement algorithms are required to provide end-to-end multi-hop quantum entanglement. We consider the real-time entanglement distribution (R-TED) and pre-established entanglement distribution (P-EED) to meet this requirement. Based on these two types of entanglement distribution, we propose two algorithms, i.e., R-TED-based routing and entangled pairs allocation (REA) algorithm as well as P-EED-based REA algorithm for end-to-end entanglement establishment, where the practical physical factors (e.g., finite storage capacity and limited storage time) are considered. The R-TED-based REA algorithm can orchestrate the nodes in a route and perform entanglement swapping by adopting real-time entanglement. For the P-EED-based REA algorithm, remote entangled particle sharing can be achieved via pre-shared entanglement distribution and hop-by-hop entanglement swapping. This way, the entanglement routing selection satisfies the storage time constraint and allows two far-apart nodes to share long-distance entangled particles with limited memory cells. We evaluate the performance of the proposed algorithms under different network topologies and sizes, based on which we demonstrate that the network size can significantly affect the efficiency advantage achieved by the P-EED-based approach over the R-TED-based approach.
Remote entanglement distribution plays a crucial role in quantum networks, which can support many essential and exciting quantum applications. As the network scale expands, it is urgent to design a general and efficient remote entanglement distribution protocol. Nowadays, connection-oriented remote entanglement distribution protocols are available to achieve reliable entanglement distribution. However, in memory-limited quantum networks, connection-oriented entanglement distribution protocols cannot utilize entanglement resources fully and increase the delay of End-to-End (E2E) entanglement connection establishment. To overcome these shortcomings of existing entanglement distribution protocols, we design a connectionless remote entanglement distribution protocol to let Source-Destination (S-D) pairs compete for entanglement resources simultaneously. In our protocol, a fair request scheduling algorithm is proposed to reduce the waiting time without entanglement connections between S-D pairs. Furthermore, a fast scheduling trigger mechanism is proposed to perform entanglement swapping timely to reduce the delay of E2E entanglement connection establishment. The simulation results show that the designed protocol has advantages in terms of resource utilization, throughput, the service completion time of S-D pairs, and the maximum waiting time, compared with the existing remote entanglement distribution protocol.
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.
As the basic principle of quantum networks, quantum entanglement can enable important quantum applications such as teleportation and quantum-key distribution. To realize wide-area quantum communication, entanglement establishment between two remote communication parties is vital, and it requires effective entanglement distribution strategies. Entanglement distribution network models of distributed and centralized entangled pair sources are constructed, based on which two entanglement-distribution algorithms are proposed, i.e., the real-time entanglement distribution (R-TED) algorithm and the pre-established entanglement distribution (P-EED) algorithm, to achieve end-to-end multi-hop entanglement establishment. For the former, the objective is to build long-distance entanglements via hop-by-hop entanglement tentatively and entanglement swapping to finally glue them together. For the latter, which uses pre-established entanglement, entanglements can be established in advance to patch multiple link-level entanglements via entanglement swapping. Simulation results show that as the number of time slots increases, the P-EED algorithm is more efficient and has higher entanglement establishment probability than the R-TED algorithm to establish end-to-end entanglement; while there are fewer memory cells in a quantum memory, such as 10, the R-TED algorithm provides more stable entanglement distribution compared to the P-EED algorithm.
Abstract Quantum network is a promising platform for many ground-breaking applications that lie beyond the capability of its classical counterparts. Efficient entanglement generation on quantum networks with relatively limited resources such as quantum memories is essential to fully realize the network’s capabilities, the solution to which calls for delicate network design and is currently at the primitive stage. In this study we propose an effective routing scheme to enable automatic responses for multiple requests of entanglement generation between source-terminal stations on a quantum lattice network with finite edge capacities. Multiple connection paths are exploited for each connection request while entanglement fidelity is ensured for each path by performing entanglement purification. The routing scheme is highly modularized with a flexible nature, embedding quantum operations within the algorithmic workflow, whose performance is evaluated from multiple perspectives. In particular, three algorithms are proposed and compared for the scheduling of capacity allocation on the edges of quantum network. Embodying the ideas of proportional share and progressive filling that have been well-studied in classical routing problems, we design another scheduling algorithm, the propagatory update method, which in certain aspects overrides the two algorithms based on classical heuristics in scheduling performances. The general solution scheme paves the road for effective design of efficient routing and flow control protocols on applicational quantum networks.