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.
Efficient and high-performance routing of lattice-surgery paths on three-dimensional lattice
The University of Tokyo(东京大学);NTT Computer and Data Science Laboratories, NTT Corporation(日本电信电话公司计算机与数据科学实验室);JST, PRESTO(日本科学技术振兴机构 PRESTO 项目);Center for Quantum Computing, RIKEN(理化学研究所量子计算中心);Faculty of Information Science and Technology, Hokkaido University(北海道大学信息科学技术学院)
Lattice surgery for near-term experimental logical qubit entanglement creation in planar architectures
Institute for Theoretical Nanoelectronics (PGI-2), Forschungszentrum Jülich(于利希研究中心理论纳米电子学研究所);Institute for Quantum Information, RWTH Aachen University(亚琛工业大学量子信息研究所);Department of Physics, ETH Zurich(苏黎世联邦理工学院物理系);ETH Zurich - PSI Quantum Computing Hub, Paul Scherrer Institute(保罗谢勒研究所苏黎世联邦理工学院-PSI量子计算中心);Quantum Center, ETH Zurich(苏黎世联邦理工学院量子中心)
Remote Entanglement in Lattice Surgery: To Distill, or Not to Distill
Duke University(杜克大学);Lawrence Berkeley National Laboratory(劳伦斯伯克利国家实验室);North Carolina State University(北卡罗来纳州立大学);University of California, Berkeley(加州大学伯克利分校)
O3LS: Optimizing Lattice Surgery via Automatic Layout Searching and Loose Scheduling
The Hong Kong University of Science and Technology (Guangzhou)(香港科技大学(广州));College of Computer Science and Technology National University of Defense Technology(国防科技大学计算机学院)