Low overhead quantum computation using lattice surgery
Austin G. Fowler, Craig Gidney
备注：
15 pages, 26 figures, download source for algorithm overhead calculation spreadsheet and SketchUp 3D model of two-level state distillation. V2: Source actually contains spreadsheet and no unnecessary files. Spreadsheet and model in anc/ directory in source. V3: minor bug fixed in spreadsheet, runtimes now slightly longer. V4: minor bug fixed in logical Hadamard
When calculating the overhead of a quantum algorithm made fault-tolerant using the surface code, many previous works have used defects and braids for logical qubit storage and state distillation. In this work, we show that lattice surgery reduces the storage overhead by over a factor of 4, and the distillation overhead by nearly a factor of 5, making it possible to run algorithms with $10^8$ T gates using only $3.7\times 10^5$ physical qubits capable of executing gates with error $p\sim 10^{-3}$. These numbers strongly suggest that defects and braids in the surface code should be deprecated in favor of lattice surgery.
Constant-Time Surgery on 2D Hypergraph Product Codes with Near-Constant Space Overhead
IBM Quantum, IBM T. J. Watson Research Center（IBM量子，IBM托马斯·J·沃森研究中心）；Department of Physics, Yale University（耶鲁大学物理系）；Yale Quantum Institute, Yale University（耶鲁大学量子研究所）；Department of Mathematics, Massachusetts Institute of Technology（麻省理工学院数学系）
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（国防科技大学计算机学院）
Efficient magic state cultivation with lattice surgery
The University of Osaka（大阪大学）；Fujitsu Research, Fujitsu Limited（富士通研究所）；Center for Quantum Information and Quantum Biology, The University of Osaka（大阪大学量子信息与量子生物学中心）；RIKEN Center for Quantum Computing (RQC)（理化学研究所量子计算中心）
Parsimonious Quantum Low-Density Parity-Check Code Surgery
Iceberg Quantum（冰山量子）；Condensed Matter Theory Center and Joint Quantum Institute, Department of Physics, University of Maryland（马里兰大学凝聚态理论中心与联合量子研究所物理系）；Department of Mathematics, Massachusetts Institute of Technology（麻省理工学院数学系）；Department of Physics, University of California San Diego（加州大学圣地亚哥分校物理系）；School of Physics, The University of Sydney（悉尼大学物理学院）
Parallel Logical Measurements via Quantum Code Surgery
University of Oxford（牛津大学）；Massachusetts Institute of Technology（麻省理工学院）；IBM Quantum, IBM Almaden Research Center（IBM量子，IBM阿尔马登研究中心）；IBM Quantum, IBM T.J. Watson Research Center（IBM量子，IBM沃森研究中心）
Bounded-depth spacetime lattice surgery for resource-efficient fault-tolerant quantum computation
Graduate School of Information Science and Technology, The University of Tokyo（东京大学大学院信息理工学系研究科）；Center for Quantum Computing, RIKEN（理化学研究所量子计算中心）；Faculty of Information Science and Electrical Engineering, Kyushu University（九州大学情报理工学府）；International Center for Elementary Particle Physics, The University of Tokyo（东京大学国际基本粒子物理中心）
University of Strasbourg（斯特拉斯堡大学）；CNRS, CESQ and ISIS (UMR 7006)（法国国家科学研究中心、CESQ和ISIS联合研究实验室）；aQCess；QPerfect；Institut Universitaire de France (IUF)（法兰西学院）
Genuine Multipartite Entanglement between Logical Qubits via Cross-Code Lattice Surgery
Universität Innsbruck（因斯布鲁克大学）；Technische Universität Wien（维也纳工业大学）；Institute for Theoretical Physics, University of Innsbruck（因斯布鲁克大学理论物理研究所）；neQxt GmbH（neQxt有限公司）；Alpine Quantum Technologies GmbH（阿尔卑斯量子技术有限公司）
