论文标题
跨量子网络分布图状态
Distributing Graph States Across Quantum Networks
论文作者
论文摘要
图状态是一类重要的多部分纠缠量子状态。我们提出了一种在量子网络上分配图形状态的新方法。我们考虑了一个由节点 - 量词计算机组成的量子网络，其中局部操作是免费的，并且可以在可以不断生成的节点之间共享EPR对。我们证明了在消耗的EPR对数量，所需的时间段的数量以及所需的经典沟通数量的方法上，我们的方法上的上限，所有这些都等于或更好。我们还减少了最大程度地减少使用我们对具有多项式时间复杂性的网络流问题的方法来分配图形状态的时间段数量的问题。
Graph states are an important class of multipartite entangled quantum states. We propose a new approach for distributing graph states across a quantum network. We consider a quantum network consisting of nodes-quantum computers within which local operations are free-and EPR pairs shared between nodes that can continually be generated. We prove upper bounds for our approach on the number of EPR pairs consumed, number of timesteps taken, and amount of classical communication required, all of which are equal to or better than that of prior work. We also reduce the problem of minimizing the number of timesteps taken to distribute a graph state using our approach to a network flow problem having polynomial time complexity.
