Purification and Entanglement Routing on Quantum Networks
Purification and Entanglement Routing on Quantum Networks
复制标题
量子网络上的净化和纠缠路由
DOI：
--
复制
发表时间：
2020
期刊：
影响因子：
--
通讯作者：
P. Narang
中科院分区：
文献类型：
--
作者：
M. Victora;Stefan Krastanov;Alexander Sanchez de la Cerda;S. Willis;P. Narang
我们提出了一种复杂量子网络体系结构上的纠缠纯化和纠缠路由方法，即具有不完全信道保真度和有限存储时间的量子网络如何在用户之间分配纠缠。我们探讨了网络参数如何影响优化路由所需的路径发现算法的性能，特别是我们探索了量子通道的带宽与净化协议选择之间的相互作用。最后，我们展示了在资源受限的各种网络拓扑上的多路径路由，以努力为未来量子网络配置的设计选择提供参考。我们的工作优化了量子网络上的路径选择和节点之间使用的净化方案的选择。我们不仅考虑了成对产生率，而且优化了所传输的纠缠态的保真度。我们引入了有效的启发式算法，使得快速路径搜索算法能够最大化量子网络上两个节点之间共享的纠缠，其性能可与计算代价高昂的暴力路径搜索相媲美。
We present an approach to purification and entanglement routing on complex quantum network architectures, that is, how a quantum network equipped with imperfect channel fidelities and limited memory storage time can distribute entanglement between users. We explore how network parameters influence the performance of path-finding algorithms necessary for optimizing routing and, in particular, we explore the interplay between the bandwidth of a quantum channels and the choice of purification protocol. Finally, we demonstrate multi-path routing on various network topologies with resource constraints, in an effort to inform future design choices for quantum network configurations. Our work optimizes both the choice of path over the quantum network and the choice of purification schemes used between nodes. We consider not only pair-production rate, but optimize over the fidelity of the delivered entangled state. We introduce effective heuristics enabling fast path-finding algorithms for maximizing entanglement shared between two nodes on a quantum network, with performance comparable to that of a computationally-expensive brute-force path search.