arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.09562quant-phcs.NI
收藏

量子中继网络中的保真度-年龄感知调度

Fidelity-Age-Aware Scheduling in Quantum Repeater Networks

Faculty of Engineering and Natural Sciences, Sabanci University(萨贝里大学工程与自然科学学院)

Ozgur Ercetin, Zafer Gedik

AI总结:

本文提出保真度-年龄指标,通过轻量级调度器优化量子中继网络中的纠缠分发,减少极端年龄事件并提升可靠性。

摘要:

量子中继网络用于在长距离上分发纠缠,但必须在保真度、延迟和资源竞争之间取得平衡。先前的工作优化了吞吐量和端到端保真度,但很少关注纠缠的 freshness(即可用贝尔对最后一次交付后的时间间隔)。我们引入了保真度-年龄(FA)指标,该指标衡量那些保真度超过阈值Fmin的状态的间隔。一种 renewal 公式将槽级成功概率与长期平均FA联系起来,从而形成一个随机控制问题,该问题在预算和内存限制下最小化FA。两种轻量级调度器,FA-THR和FA-INDEX,近似了Lyapunov漂移最优控制。在分槽中继网格上的模拟显示,FA-aware调度在保持吞吐量的同时,将极端年龄事件减少到最多两个数量级。保真度-年龄因此提供了一个可处理、物理上合理的指标,用于在量子网络中实现可靠且及时的纠缠分发。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑