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

论量子网络的二分纠缠容量

On the Bipartite Entanglement Capacity of Quantum Networks

Gayane Vardoyan, Emily van Milligen, Saikat Guha, Stephanie Wehner, Don Towsley

阅读 PDF
arXiv 页面 ↗HTML 原文 ↗

AI总结：

针对概率性纠缠交换的量子网络，本文将多路径二分纠缠分发建模为广义流最大化，提出MIQCP精确计算网络容量并为非最优路由算法提供上界。

摘要：

我们考虑在由具有非确定性纠缠交换能力的设备组成的量子网络中，向一对节点进行多路径纠缠分发的问题。多路径纠缠分发使网络能够通过任意数量的、具有预先建立的链路级纠缠的可用路径建立端到端纠缠链路。另一方面，概率性纠缠交换限制了节点之间共享的纠缠量；当由于架构和其他实际约束，交换必须在时间上彼此接近地执行时，情况尤其如此。我们将关注范围限制为整个网络中仅生成二分纠缠态的情形，并将该问题表述为希望通信的两个量子端节点之间的广义流最大化的一个实例。我们提出了一个混合整数二次约束规划（MIQCP），以求解任意拓扑网络的这一流问题。随后，我们通过对由概率性纠缠链路存在和不存在所产生的所有可能网络状态求解该流问题，并进一步对所有网络状态容量取平均，计算总体网络容量，其定义为每时间单位分发给用户的EPR态的最大数量。该MIQCP也可应用于具有复用链路的网络。尽管我们计算总体网络容量的方法具有状态总数随链路复用能力呈指数增长这一不理想特性，但它仍给出了精确解，可作为易于实现却非最优的纠缠路由算法吞吐量性能的上界比较基准。我们将容量计算方法应用于若干网络，包括基于SURFnet——荷兰用于研究目的的一个骨干网络——的拓扑。

英文摘要：

We consider the problem of multi-path entanglement distribution to a pair of nodes in a quantum network consisting of devices with non-deterministic entanglement swapping capabilities. Multi-path entanglement distribution enables a network to establish end-to-end entangled links across any number of available paths with pre-established link-level entanglement. Probabilistic entanglement swapping, on the other hand, limits the amount of entanglement that is shared between the nodes; this is especially the case when, due to architectural and other practical constraints, swaps must be performed in temporal proximity to each other. Limiting our focus to the case where only bipartite entangled states are generated across the network, we cast the problem as an instance of generalized flow maximization between two quantum end nodes wishing to communicate. We propose a mixed-integer quadratically constrained program (MIQCP) to solve this flow problem for networks with arbitrary topology. We then compute the overall network capacity, defined as the maximum number of EPR states distributed to users per time unit, by solving the flow problem for all possible network states generated by probabilistic entangled link presence and absence, and subsequently by averaging over all network state capacities. The MIQCP can also be applied to networks with multiplexed links. While our approach for computing the overall network capacity has the undesirable property that the total number of states grows exponentially with link multiplexing capability, it nevertheless yields an exact solution that serves as an upper bound comparison basis for the throughput performance of easily-implementable yet non-optimal entanglement routing algorithms. We apply our capacity computation method to several networks, including a topology based on SURFnet -- a backbone network used for research purposes in the Netherlands.

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

↑