arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1808.02892quant-phcond-mat.mes-hall
收藏

表面码的博弈:大规模量子计算的格子手术

A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery

Daniel Litinski

摘要:

给定一个量子门电路,如何在容错架构中以尽可能少的开销执行它?在本文中,我们讨论了表面编码量子计算的小,中,大规模的策略。它们是时空权衡的策略,从使用少数量子位的慢速计算到使用许多量子位的快速计算。我们的计划是基于表面代码补丁,这不仅具有较低的空间成本相比,其他表面代码计划,但也是概念上简单,简单到可以被描述为一个基于瓷砖的游戏,一个小的规则集。因此,不需要量子纠错的知识来理解本文中的方案,而只需要量子比特和测量的概念。作为示例,假设物理错误率为$10^{-4}$并且代码周期时间为1 $μ$ s,具有$10^8$的$T$计数和$10^6$的$T$深度的经典难处理的100量子位量子计算可以使用55,000量子位在4小时内、使用120,000量子位在22分钟内、或者使用330,000,000量子位在1秒内执行。

英文摘要:

Given a quantum gate circuit, how does one execute it in a fault-tolerant architecture with as little overhead as possible? In this paper, we discuss strategies for surface-code quantum computing on small, intermediate and large scales. They are strategies for space-time trade-offs, going from slow computations using few qubits to fast computations using many qubits. Our schemes are based on surface-code patches, which not only feature a low space cost compared to other surface-code schemes, but are also conceptually simple, simple enough that they can be described as a tile-based game with a small set of rules. Therefore, no knowledge of quantum error correction is necessary to understand the schemes in this paper, but only the concepts of qubits and measurements. As an example, assuming a physical error rate of $10^{-4}$ and a code cycle time of 1 $μ$s, a classically intractable 100-qubit quantum computation with a $T$ count of $10^8$ and a $T$ depth of $10^6$ can be executed in 4 hours using 55,000 qubits, in 22 minutes using 120,000 qubits, or in 1 second using 330,000,000 qubits.

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

↑