aiqbench analysis
This paper treats link recalibration as a scheduling problem in quantum networks. Each link must trade fidelity decay during activation against unavailability during calibration, and the authors derive an analytical allocation for linear repeater chains and propose a heuristic for general topologies. Readers working on quantum networking should note that the gains are shown through simulation and comparison with theoretical bounds, not hardware experiments.
Optimal Calibration of Quantum Network Links
arXiv:2606.18167v2 Announce Type: replace Abstract: The reliable distribution of entanglement is essential for the effective operation of quantum networks. Due to fundamental differences between quantum and classical communication systems, it is necessary to develop specialised algorithms and protocols that also account for quantum-specific constraints. In this work, we focus on the issue of recalibration. As suggested by recent experimental studies, the process of local entanglement generation in a quantum link degrades over time due to environmental changes that have to be estimated and compensated via a fixed-duration calibration operation, during which the link is not available. Therefore, in such a quantum network, every link alternates between an activation period, during which it operates normally, and a calibration period, during which it cannot participate in the end-to-end entanglement distribution, thereby creating a trade-off between link quality (the initial fidelity of generated pairs, which decays during activation) and availability (the fraction of time the link is usable, which calibration reduces). We develop analytically a protocol for optimally assigning activation periods to each link in linear quantum repeater chains, subject to any general end-to-end fidelity requirements and local initial fidelity thresholds. Building on this foundation, we extend to general quantum networks, where multiple paths may cross at common links. To this, we propose a heuristic approach, evaluate it through simulations, and compare its performance with a benchmark, a numerical approach and theoretical bounds, confirming the analytical ordering of their performance.
Abstract:The reliable distribution of entanglement is essential for the effective operation of quantum networks. Due to fundamental differences between quantum and classical communication systems, it is necessary to develop specialised algorithms and protocols that also account for quantum-specific constraints. In this work, we focus on the issue of recalibration. As suggested by recent experimental studies, the process of local entanglement generation in a quantum link degrades over time due to environmental changes that have to be estimated and compensated via a fixed-duration calibration operation, during which the link is not available. Therefore, in such a quantum network, every link alternates between an activation period, during which it operates normally, and a calibration period, during which it cannot participate in the end-to-end entanglement distribution, thereby creating a trade-off between link quality (the initial fidelity of generated pairs, which decays during activation) and availability (the fraction of time the link is usable, which calibration reduces). We develop analytically a protocol for optimally assigning activation periods to each link in linear quantum repeater chains, subject to any general end-to-end fidelity requirements and local initial fidelity thresholds. Building on this foundation, we extend to general quantum networks, where multiple paths may cross at common links. To this, we propose a heuristic approach, evaluate it through simulations, and compare its performance with a benchmark, a numerical approach and theoretical bounds, confirming the analytical ordering of their performance.
Quantum Physics (quant-ph); Performance (cs.PF)
arXiv:2606.18167 [quant-ph]
(or arXiv:2606.18167v2 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2606.18167 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 · 326 words
