arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2005.14304quant-ph
收藏

量子网络中的纠缠分布:一种基于多商品流的方法

Entanglement Distribution in a Quantum Network, a Multi-Commodity Flow-Based Approach

Kaushik Chakraborty, David Elkouss, Bruno Rijsman, Stephanie Wehner

摘要:

我们考虑优化量子互联网中多个源-目的地对之间可实现的EPR对分布速率的问题,其中中继器可以执行概率钟形状态测量,并且我们可以将最小端到端保真度作为要求。我们构建了一个有效的线性规划公式,计算最大的总可实现的纠缠分发率,满足端到端的保真度约束在多项式时间(在网络中的节点数)。我们还提出了一种有效的算法,该算法将线性规划求解器的输出作为输入,并在多项式时间(节点数)内运行,以产生用于实现纠缠分布率的路径集。此外,我们指出了一个实用的纠缠产生协议,可以实现这些速率。

英文摘要:

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.

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

↑