Fidelity-age-aware scheduling in quantum repeater networks

Erçetin, Özgür and Gedik, Zafer (2026) Fidelity-age-aware scheduling in quantum repeater networks. In: International Conference on Quantum Communications, Networking, and Computing (QCNC), Kobe, Japan

Full text not available from this repository. (Request a copy)

Abstract

Quantum repeater networks distribute entanglement over long distances but must balance fidelity, delay, and resource contention. Prior work optimized throughput and end-to-end fidelity, yet little attention has been paid to the freshness of entanglement-the time since a usable Bell pair was last delivered. We introduce the Fidelity-Age (FA) metric, which measures this interval for states whose fidelity exceeds a threshold Fmin. A renewal formulation links slot-level success probability to long-run average FA, enabling a stochastic control problem that minimizes FA under budget and memory limits. Two lightweight schedulers, FA-THR and FA-INDEX, approximate Lyapunov-drift-optimal control. Simulations on slotted repeater grids show that FA-aware scheduling preserves throughput while reducing extreme-age events by up to two orders of magnitude. FidelityAge thus provides a tractable, physically grounded metric for reliable and timely entanglement delivery in quantum networks.
Item Type: Papers in Conference Proceedings
Divisions: Faculty of Engineering and Natural Sciences
Depositing User: Zafer Gedik
Date Deposited: 03 Jul 2026 11:52
Last Modified: 03 Jul 2026 11:52
URI: https://research.sabanciuniv.edu/id/eprint/54168

Actions (login required)

View Item
View Item