aiqbench analysis
This paper is about quantum repeater networking: how entanglement-swapping timing affects QKD secret-key rates in a simulated four-hop chain. Its use of reinforcement-learned link controllers is a supporting tool rather than the focus, so the core contribution sits in quantum communication. The results are idealized (Werner-state noise, simulated hardware) and the closed-form condition is the most reusable takeaway for anyone designing quantum network protocols.
Sequential vs. Synchronized Entanglement Swapping: QKD Secret-Key Rate under Optimized Link-Layer Control
arXiv:2605.04047v2 Announce Type: replace Abstract: Quantum repeater chains build long-distance entanglement for quantum key distribution (QKD) by creating pairs on short links and joining them through entanglement swapping. Because stored pairs lose fidelity while they wait, swap timing can affect the secret-key rate. We study how network-layer swap scheduling affects six-state QKD on a simulated four-hop chain under an idealized Werner-state noise model. We compare a sequential (swap-and-wait) discipline, which builds and stores partial chains, with a synchronized (wait-and-swap) discipline, which waits until all links are ready before swapping. Both use the same reinforcement-learned link controllers, isolating the effect of the swapping discipline. When stored pairs cannot retain sufficient fidelity for one network time step, our sequential implementation produces no key, while synchronized retains a small key rate from simultaneous link deliveries. Once sequential becomes viable, it outperforms synchronized by up to 19.1% in the homogeneous chains studied, with the advantage decreasing as memory lifetime increases. We predict the synchronized short-memory pair-delivery rate from link-delivery statistics and derive a closed-form condition for when sequential can preserve progress across time steps. We also examine chains with one slower link, where partial chains can wait and decay at the bottleneck. In this setting, synchronized slightly outperforms sequential at longer memory lifetimes. Moving the slow link has little effect on key rate away from the transition region but strongly affects sequential link-buffer occupancy. Choosing a swapping discipline therefore depends not only on whether memories can preserve partial progress, but also on how the link configuration determines where that progress must wait and decay.
Title:Sequential vs. Synchronized Entanglement Swapping: QKD Secret-Key Rate under Optimized Link-Layer Control
Abstract:Quantum repeater chains build long-distance entanglement for quantum key distribution (QKD) by creating pairs on short links and joining them through entanglement swapping. Because stored pairs lose fidelity while they wait, swap timing can affect the secret-key rate. We study how network-layer swap scheduling affects six-state QKD on a simulated four-hop chain under an idealized Werner-state noise model. We compare a sequential (swap-and-wait) discipline, which builds and stores partial chains, with a synchronized (wait-and-swap) discipline, which waits until all links are ready before swapping. Both use the same reinforcement-learned link controllers, isolating the effect of the swapping discipline. When stored pairs cannot retain sufficient fidelity for one network time step, our sequential implementation produces no key, while synchronized retains a small key rate from simultaneous link deliveries. Once sequential becomes viable, it outperforms synchronized by up to 19.1% in the homogeneous chains studied, with the advantage decreasing as memory lifetime increases. We predict the synchronized short-memory pair-delivery rate from link-delivery statistics and derive a closed-form condition for when sequential can preserve progress across time steps. We also examine chains with one slower link, where partial chains can wait and decay at the bottleneck. In this setting, synchronized slightly outperforms sequential at longer memory lifetimes. Moving the slow link has little effect on key rate away from the transition region but strongly affects sequential link-buffer occupancy. Choosing a swapping discipline therefore depends not only on whether memories can preserve partial progress, but also on how the link configuration determines where that progress must wait and decay.
Quantum Physics (quant-ph); Networking and Internet Architecture (cs.NI)
arXiv:2605.04047 [quant-ph]
(or arXiv:2605.04047v2 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2605.04047 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 364 words
Related coverage

News
Quantum Computing Report · Jul 25, 2026
News Archive 2026
Quantum Computing Report · Jul 25, 2026

France deploys a quantum key distribution network
Quantum Zeitgeist · Sep 30, 2026

Classiq and QuEra Reduce CZ-Depth for Neutral-Atom Processors
Quantum Zeitgeist · Oct 13, 2026