arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0904.3556quant-ph
收藏

拓扑码在损失存在下的可解性

Thresholds for topological codes in the presence of loss

Thomas M. Stace, Sean D. Barrett, Andrew C. Doherty

摘要:

量子信息处理的许多建议都受到可检测的丢失错误的影响。在本文中,我们表明,拓扑纠错码,防止计算错误,也是非常强大的损失。我们目前的分析结果表明,最大可容忍的损失率为50%,这是由正方形晶格键逾渗阈值。这使不可克隆定理的约束集饱和。我们的数值结果支持这一点,并显示出一个优雅的计算和损失误差之间的权衡。

英文摘要:

Many proposals for quantum information processing are subject to detectable loss errors. In this paper, we show that topological error correcting codes, which protect against computational errors, are also extremely robust against losses. We present analytical results showing the maximum tolerable loss rate is 50 %, which is determined by the square-lattice bond percolation threshold. This saturates the bound set by the no-cloning theorem. Our numerical results support this, and show a graceful trade-off between computational and loss errors.

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

↑