论文标题
量子网络中的纠缠分布，一种基于多商品流的方法
Entanglement Distribution in a Quantum Network, a Multi-Commodity Flow-Based Approach
论文作者
论文摘要
我们考虑了优化量子互联网中多个源用途对之间可实现的EPR -PAIR分布率的问题，在量子互联网上，中继器可能会执行概率的铃铛状态测量，我们可能会要求最低端到端的忠诚度。我们构建了一个有效的线性编程公式，该公式计算最大可实现的纠缠分布率，满足多项式时间（网络中的节点数量）中的端到端忠诚度约束。我们还提出了一种有效的算法，该算法将线性编程求解器的输出作为输入，并在多项式时间（以节点数为单位）运行，以产生用于实现纠缠分布率的路径集。此外，我们指出了一个实用的纠缠生成协议，可以实现这些费率。
We consider the problem of optimising the achievable EPR-pair distribution rate between multiple source-destination pairs in a quantum internet, where the repeaters may perform a probabilistic bell-state measurement and we may impose a minimum end-to-end fidelity as a requirement. We construct an efficient linear programming formulation that computes the maximum total achievable entanglement distribution rate, satisfying the end-to-end fidelity constraint in polynomial time (in the number of nodes in the network). We also propose an efficient algorithm that takes the output of the linear programming solver as an input and runs in polynomial time (in the number of nodes) to produce the set of paths to be used to achieve the entanglement distribution rate. Moreover, we point out a practical entanglement generation protocol which can achieve those rates.
