Efficient Quantum Network Communication Using Optimized Entanglement Swapping Trees

Efficient Quantum Network Communication Using Optimized Entanglement Swapping Trees
复制标题

DOI:
10.1109/tqe.2022.3168784
复制
发表时间:
2021-12
影响因子:
--
通讯作者:
Mohammad Ghaderibaneh;Caitao Zhan;Himanshu Gupta;C. Ramakrishnan
Mohammad Ghaderibaneh;Caitao Zhan;Himanshu Gupta;C. Ramakrishnan
中科院分区:
--
文献类型:
--
作者:
Mohammad Ghaderibaneh;Caitao Zhan;Himanshu Gupta;C. Ramakrishnan

文献摘要

相似文献

量子网络通信具有挑战性,因为量子体系中的不可克隆定理使得许多经典技术不适用;特别是,由于不可恢复的错误,长距离直接传输量子比特状态是不可行的。对于未知量子态的远距离通信,唯一可行的通信方法(假设局域操作和经典通信)是量子态的隐形传态,这需要量子比特的纠缠对(EP)的先验分布。由于底层物理过程的成功概率很低,因此跨远程节点建立EP可能会导致显著的延迟。我们工作的重点是开发有效的技术,最大限度地减少EP生成延迟。以前的工作都集中在选择纠缠路径,相比之下,我们选择纠缠交换树-一个更准确的表示纠缠生成结构。我们开发了一个动态规划算法来选择一个最佳的交换树的单对节点,在给定的容量和保真度的约束。对于一般设置,我们开发了一个有效的迭代算法来计算一组交换树。我们目前的模拟结果表明,我们的解决方案优于以前的方法的数量级,是可行的长距离纠缠产生。
Quantum network communication is challenging, as the no-cloning theorem in the quantum regime makes many classical techniques inapplicable; in particular, the direct transmission of qubit states over long distances is infeasible due to unrecoverable errors. For the long-distance communication of unknown quantum states, the only viable communication approach (assuming local operations and classical communications) is the teleportation of quantum states, which requires a prior distribution of the entangled pairs (EPs) of qubits. The establishment of EPs across remote nodes can incur significant latency due to the low probability of success of the underlying physical processes. The focus of our work is to develop efficient techniques that minimize EP generation latency. Prior works have focused on selecting entanglement paths; in contrast, we select entanglement swapping trees—a more accurate representation of the entanglement generation structure. We develop a dynamic programming algorithm to select an optimal swapping tree for a single pair of nodes, under the given capacity and fidelity constraints. For the general setting, we develop an efficient iterative algorithm to compute a set of swapping trees. We present simulation results, which show that our solutions outperform the prior approaches by an order of magnitude and are viable for long-distance entanglement generation.