Deterministic entanglement scheduling for latency reduction in connectionless quantum networks

The scalability of quantum networks critically depends on minimizing latency in entanglement distribution, which underpins essential applications such as quantum communications and distributed quantum computing. Existing sequential entanglement distribution schemes—though suitable for connectionless or packet-switched networks—suffer from prohibitive delays due to the inherently stochastic waiting times of probabilistic entanglement generation. Here, we address this problem by employing deterministic sequential entanglement generation to dramatically suppress entanglement distribution latency. By eliminating the unpredictable idle periods of conventional probabilistic sequential approaches, our method significantly accelerates end-to-end entanglement establishment. For paths exceeding 45 links with low per-link success probabilities and deterministic entanglement swapping, our scheme achieves an order-of-magnitude reduction in total distribution time. It also mitigates cumulative quantum memory dephasing error and qubit occupancy. Simulations in a packet-switched quantum key distribution setting confirm a substantial improvement in the secret key rate. As a system-agnostic and human-designed strategy, our method offers a universally applicable solution, paving the way for the realization of fast, high-fidelity, and scalable quantum networks.

Authors

Institutions

Publication Details

Journal
Applied Physics Reviews
Published
2026-11-17
DOI
https://doi.org/10.1063/5.0325693
Primary Topic
Quantum Information and Cryptography
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Deterministic entanglement scheduling for latency reduction in connectionless quantum networks

Hao Zhang, Yu Luo, Xuan Mao, Tao Huang et al.
1 links
Applied Physics Reviews
Quantum Information and Cryptography
article

Deterministic entanglement scheduling for latency reduction in connectionless quantum networks

Hao Zhang, Yu Luo, Xuan Mao, Tao Huang, Chen Zhang
article en

Abstract

The scalability of quantum networks critically depends on minimizing latency in entanglement distribution, which underpins essential applications such as quantum communications and distributed quantum computing. Existing sequential entanglement distribution schemes—though suitable for connectionless or packet-switched networks—suffer from prohibitive delays due to the inherently stochastic waiting times of probabilistic entanglement generation. Here, we address this problem by employing deterministic sequential entanglement generation to dramatically suppress entanglement distribution latency. By eliminating the unpredictable idle periods of conventional probabilistic sequential approaches, our method significantly accelerates end-to-end entanglement establishment. For paths exceeding 45 links with low per-link success probabilities and deterministic entanglement swapping, our scheme achieves an order-of-magnitude reduction in total distribution time. It also mitigates cumulative quantum memory dephasing error and qubit occupancy. Simulations in a packet-switched quantum key distribution setting confirm a substantial improvement in the secret key rate. As a system-agnostic and human-designed strategy, our method offers a universally applicable solution, paving the way for the realization of fast, high-fidelity, and scalable quantum networks.

Applied Physics ReviewsVol. 13(4)
Beijing University of Posts and Telecommunications (CN), Nanyang Technological University (SG), Purple Mountain Laboratories (CN), State Key Laboratory of Networking and Switching Technology (CN), Nanjing University of Aeronautics and Astronautics (CN)
Quantum Information and Cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon