arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2611.06260quant-ph
收藏

基于无后选择的纠缠蒸馏的表面码块连接

Connection of surface code patches based on entanglement distillation without postselection

The University of Tokyo(东京大学);NTT, Inc.(日本电信电话株式会社);RIKEN(理化学研究所)

Moeto Mishima, Toshihiko Sasaki, Yasunari Suzuki, Koji Azuma, Masato Koashi

AI总结:

本文提出一种无需后选择的分布式表面码量子计算方案,利用纠缠蒸馏降低逻辑错误率,还可通过表面码错误不对称性进一步抑制错误,为分布式量子计算提供实用方案。

摘要:

分布式量子计算是克服容错量子计算可扩展性限制的有前景方案,纠缠蒸馏(从噪声纠缠态中提取高保真度纠缠态的过程)在分布式量子计算中起关键作用。然而,简单的蒸馏协议通常依赖后选择,这给实际实现带来挑战。本文提出一种分布式表面码量子计算方案,该方案无需后选择即可利用纠缠蒸馏。数值模拟显示,该方案的逻辑错误率低于无蒸馏的情况;此外,利用表面码中类空与类时错误的不对称性,可进一步降低逻辑错误率。该方案为基于表面码的分布式量子计算提供了实用且简单的方法。

英文摘要:

Distributed quantum computing is a promising approach for overcoming the scalability limitations of fault-tolerant quantum computing. Entanglement distillation, a process that extracts higher-fidelity entangled states from noisy ones, plays a key role in distributed quantum computing. However, simple distillation protocols typically rely on postselection, which poses practical challenges for implementation. Here, we propose a scheme for distributed surface-code quantum computing that benefits from entanglement distillation even without postselection. Numerical simulations show that the logical error rates in the proposed scheme are lower than those in the setting without distillation. Additionally, we demonstrate that the logical error rates can be suppressed further by exploiting the asymmetry between spacelike and timelike errors in the surface code. The proposed scheme offers a practical and simple approach to distributed quantum computing with surface codes.

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

↑