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

Ising任意子的连续纠错

Continuous error correction for Ising anyons

Adrian Hutter, James R. Wootton

摘要:

拓扑量子计算中的量子门是通过编织非阿贝尔任意子来实现的。这些编织过程可能以非常低的错误率进行。然而,要使拓扑量子计算架构真正可扩展,即使是罕见的错误也需要纠正。对非阿贝尔任意子的纠错是复杂的,因为它需要在连续的基础上进行,并且在我们纠正现有错误的同时可能会出现更多的错误。在这里,我们提供了这个问题的第一个研究,并证明其可行性,建立非阿贝尔任意子作为一个可行的平台,可扩展的量子计算。因此,我们专注于伊辛任意子作为最突出的例子,非阿贝尔任意子,并表明,对于这些有限的错误率确实可以不断纠正。存在阈值错误率$p_c>0$,使得对于所有错误率$p<p_c$,可以使每个时间步长的逻辑错误的概率在逻辑量子比特的距离上呈指数地小。

英文摘要:

Quantum gates in topological quantum computation are performed by braiding non-Abelian anyons. These braiding processes can presumably be performed with very low error rates. However, to make a topological quantum computation architecture truly scalable, even rare errors need to be corrected. Error correction for non-Abelian anyons is complicated by the fact that it needs to be performed on a continuous basis and further errors may occur while we are correcting existing ones. Here, we provide the first study of this problem and prove its feasibility, establishing non-Abelian anyons as a viable platform for scalable quantum computation. We thereby focus on Ising anyons as the most prominent example of non-Abelian anyons and show that for these a finite error rate can indeed be corrected continuously. There is a threshold error rate $p_c>0$ such that for all error rates $p<p_c$ the probability of a logical error per time-step can be made exponentially small in the distance of a logical qubit.

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

↑