论文标题

量子网络中的多党纠缠路由

Multiparty Entanglement Routing in Quantum Networks

论文作者

Mannalath, Vaisakh, Pathak, Anirban

论文摘要

在多个用户中分发纠缠是量子网络中的一个基本问题,需要有效的解决方案。在这项工作中,提出了一项协议,以提取任意拓扑量子网络中任何数量各方的最大纠缠(GHZN)状态。它基于图状态形式主义,需要对网络状态的最小假设。该协议仅需要在网络节点上进行本地测量,每个用户只需一个量子存储器。对于特定的最近邻近网络架构,还改善了两分纠缠路由的现有协议。为此,利用大分化的概念来基于网络的功效在不同路径之间建立层次结构。这种方法利用基础图状态的对称性获得表现更好的算法。

Distributing entanglement among multiple users is a fundamental problem in quantum networks, requiring an efficient solution. In this work, a protocol is proposed for extracting maximally entangled (GHZn) states for any number of parties in quantum networks of arbitrary topology. It is based on the graph state formalism and requires minimal assumptions on the network state. The protocol only requires local measurements at the network nodes and just a single qubit memory per user. Existing protocols on bipartite entanglement routing are also improved for specific nearest-neighbor network architectures. To this end, the concept of majorization is utilized to establish a hierarchy among different paths in a network based on their efficacy. This approach utilizes the symmetry of the underlying graph state to obtain better-performing algorithms.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源