Daniel Litinski · 2019 · Quantum
Paper
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.
Analysis
This paper presents strategies for executing quantum gate circuits in fault-tolerant architectures using surface codes, focusing on space-time trade-offs for efficient qubit utilization across different scales.
Discovery
V. G. Matsos; C. H. Valahu; M. J. Millican; T. Navickas; X. C. Kolesnikow; M. J. Biercuk; T. R. Tan
Tom Peham; Ludwig Schmid; Lucas Berent; Markus Müller; Robert Wille
Bence Hetényi; James R. Wootton
Hayato Goto
Amara Katabarwa; Katerina Gratsea; Athena Caesura; Peter D. Johnson
Paul V. Klimov; Andreas Bengtsson; Chris Quintana; Alexandre Bourassa; Sabrina Hong; A. Dunsworth; Kevin J. Satzinger; William P. Livingston; Volodymyr Sivak; Murphy Yuezhen Niu; Trond I. Andersen; Yaxing Zhang; Desmond Chik; Zijun Chen; Charles Neill; Catherine Erickson; Alejandro Grajales Dau; A. Megrant; P. Roushan; Alexander N. Korotkov; J. Kelly; Vadim Smelyanskiy; Yu Chen; Hartmut Neven
Source record