Quick Navigation
Topics
Entanglement Theory Quantum Correlations
Quantum Communication Networks
Quantum Compilation Routing Architecture
Quantum State Geometry Fidelity
Fidelity-Age-Aware Scheduling in Quantum Repeater Networks
arXiv
Authors: Ozgur Ercetin, Zafer Gedik
Year
2026
Paper ID
189
Status
Preprint
Abstract Read
~2 min
Abstract Words
133
Citations
N/A
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. Fidelity-Age thus provides a tractable, physically grounded metric for reliable and timely entanglement delivery in quantum networks.
Why This Paper Matters
- This paper contributes to the Entanglement Theory & Quantum Correlations research area in the Quantum Articles archive.
- It adds a 2026 reference point for readers tracking recent quantum research.
- Quantum repeater networks distribute entanglement over long distances but must balance fidelity, delay, and resource contention.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.