A fault-tolerant non-Clifford gate for the surface code in two dimensions
Abstract
Fault-tolerant logic gates will consume a large proportion of the resources of a two-dimensional quantum computing architecture. Here we show how to perform a fault-tolerant non-Clifford gate with the surface code; a quantum error-correcting code now under intensive development. This alleviates the need for distillation or higher-dimensional components to complete a universal gate set. The operation uses both local transversal gates and code deformations over a time that scales with the size of the qubit array. An important component of the gate is a just-in-time decoder. These decoding algorithms allow us to draw upon the advantages of three-dimensional models using only a two-dimensional array of live qubits. Our gate is completed using parity checks of weight no greater than four. We therefore expect it to be amenable with near-future technology. As the gate circumvents the need for magic-state distillation, it may reduce the resource overhead of surface-code quantum computation considerably.
Cite
@article{arxiv.1903.11634,
title = {A fault-tolerant non-Clifford gate for the surface code in two dimensions},
author = {Benjamin J. Brown},
journal= {arXiv preprint arXiv:1903.11634},
year = {2021}
}
Comments
17 pages, 10 figures, comments welcome; v2 - final author version. Final version includes more details on resource overheads and a discussion on gauge prefixing with the color code