二维无纠缠实现通用容错量子计算
Universal fault tolerant quantum computation in 2D without getting tied in knots
AI总结:
该研究通过二维非阿贝尔拓扑相与表面码的结合,实现了容错量子计算,并建立了三维码与二维拓扑相之间的新联系。
摘要:
我们展示了如何在二维空间中通过在表面码和非阿贝尔拓扑码之间引入域墙,实现可扩展的容错非克利夫顿门。我们提出了一个路径积分框架,既提供了不同逻辑门的宏观图景,又为推导相关的微观电路提供了方法。我们还展示了我们的方法与先前提案之间的等价性,其中二维量子比特数组在时间上再现了三维稳定器码中的横向门作用,从而建立了三维码与二维非阿贝尔拓扑相之间的新联系。我们证明了在局部随机电路噪声下,我们的协议阈值定理成立,使用即时解码器纠正非阿贝尔码。
英文摘要:
We show how to perform scalable fault-tolerant non-Clifford gates in two dimensions by introducing domain walls between the surface code and a non-Abelian topological code whose codespace is stabilized by Clifford operators. We formulate a path integral framework which provides both a macroscopic picture for different logical gates as well as a way to derive the associated microscopic circuits. We also show an equivalence between our approach and prior proposals where a 2D array of qubits reproduces the action of a transversal gate in a 3D stabilizer code over time, thus, establishing a new connection between 3D codes and 2D non-Abelian topological phases. We prove a threshold theorem for our protocols under local stochastic circuit noise using a just-in-time decoder to correct the non-Abelian code.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。