近程量子网络协议的设计与分析：基于马尔可夫决策过程
On the design and analysis of near-term quantum network protocols using Markov decision processes
AI总结：
本研究基于马尔可夫决策过程建立近程量子网络协议理论，证明记忆截止策略最优，并扩展到两个基本链路，通过线性规划优化端到端链路的保真度与等待时间。
摘要：
量子互联网是量子信息科学研究的前沿之一。它将彻底改变我们的通信方式及执行其他任务的方式，并使得利用当前经典互联网无法实现的任务成为可能。量子互联网的骨干是全局分布的纠缠，以便在长距离上执行此类新颖应用。目前，实验进展正在实现小规模的量子网络，但为了理解如何最佳地分配纠缠，尤其是在考虑近程量子技术的局限性的情况下，仍需要大量的理论工作。这项工作朝这一目标迈出了初步的一步。在本工作中，我们基于马尔可夫决策过程（MDPs）提出了近程量子网络的理论，并证明MDPs为近程量子网络的协议建模提供了一个精确且系统的数学框架，该框架与具体的实现平台无关。我们首先简化了先前工作中引入的基本链路MDP，并为基本链路的策略提供了新的结果。特别是，我们证明了众所周知的记忆截止策略是最优的。然后，我们展示了如何使用基本链路MDP来分析一种量子网络协议，在该协议中，我们等待所有基本链路都激活后再创建端到端链路。接着，我们将MDP形式主义扩展到两个基本链路，这对于分析更复杂的量子网络协议很有用。在这里，作为新的结果，我们推导出线性规划，这些规划在端到端链路的期望保真度和等待时间方面给出了最优稳态策略。
英文摘要：
The quantum internet is one of the frontiers of quantum information science research. It will revolutionize the way we communicate and do other tasks, and it will allow for tasks that are not possible using the current, classical internet. The backbone of a quantum internet is entanglement distributed globally in order to allow for such novel applications to be performed over long distances. Experimental progress is currently being made to realize quantum networks on a small scale, but much theoretical work is still needed in order to understand how best to distribute entanglement, especially with the limitations of near-term quantum technologies taken into account. This work provides an initial step towards this goal. In this work, we lay out a theory of near-term quantum networks based on Markov decision processes (MDPs), and we show that MDPs provide a precise and systematic mathematical framework to model protocols for near-term quantum networks that is agnostic to the specific implementation platform. We start by simplifying the MDP for elementary links introduced in prior work, and by providing new results on policies for elementary links. In particular, we show that the well-known memory-cutoff policy is optimal. Then we show how the elementary link MDP can be used to analyze a quantum network protocol in which we wait for all elementary links to be active before creating end-to-end links. We then provide an extension of the MDP formalism to two elementary links, which is useful for analyzing more sophisticated quantum network protocols. Here, as new results, we derive linear programs that give us optimal steady-state policies with respect to the expected fidelity and waiting time of the end-to-end link.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
