2018/08/31 by Daniel Litinski · 9 citations
Physics and Astronomy · #quant-ph #cond-mat.mes-hall
paper · pdf · doi:10.22331/q-2019-03-05-128
published as Quantum 3, 128 (2019) · Main text: 29 pages, 36 figures; Appendix: 6 pages, 10 figures; v2: simplified rules of the game
arxiv created 2019/02/03 · arxiv updated 2019/03/07
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 108 and a T depth of 106 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.