arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2306.16671cs.NI
收藏

使用 Greenberger-Horne-Zeilinger 测量的量子网络纠缠路由

Entanglement Routing over Quantum Networks Using Greenberger-Horne-Zeilinger Measurements

Yiming Zeng, Jiarui Zhang, Ji Liu, Zhenhua Liu, Yuanyuan Yang

AI总结:

本文提出基于 Greenberger-Horne-Zeilinger 测量的 n-fusion 纠缠路由算法,通过融合多条纠缠链路最大化多用户对纠缠率,显著提升量子网络性能。

摘要:

生成长距离量子纠缠是量子网络支持量子通信和计算应用的最基本功能之一。在概率纠缠过程中,成功的纠缠率随距离增加而急剧下降,纠缠交换是解决此问题的广泛应用技术。现有大多数纠缠路由协议使用基于 Bell State 测量的经典纠缠交换方法,该方法只能融合两条成功的纠缠链路。本文采用一种更通用且高效的交换方法,即基于 Greenberger-Horne-Zeilinger 测量的 n-fusion,它能融合 n 条成功的纠缠链路,以最大化量子网络中多对量子用户对的纠缠率。我们提出了高效纠缠路由算法,利用 n-fusion 的特性处理一般拓扑的量子网络。评估结果表明,与现有算法相比,我们提出的基于 n-fusion 的算法能大幅提升网络性能。

英文摘要:

Generating a long-distance quantum entanglement is one of the most essential functions of a quantum network to support quantum communication and computing applications. The successful entanglement rate during a probabilistic entanglement process decreases dramatically with distance, and swapping is a widely-applied quantum technique to address this issue. Most existing entanglement routing protocols use a classic entanglement-swapping method based on Bell State measurements that can only fuse two successful entanglement links. This paper appeals to a more general and efficient swapping method, namely n-fusion based on Greenberger-Horne-Zeilinger measurements that can fuse n successful entanglement links, to maximize the entanglement rate for multiple quantum-user pairs over a quantum network. We propose efficient entanglement routing algorithms that utilize the properties of n-fusion for quantum networks with general topologies. Evaluation results highlight that our proposed algorithm under n-fusion can greatly improve the network performance compared with existing ones.

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

↑