Roads towards fault-tolerant universal quantum computation
Abstract
Current experiments are taking the first steps toward noise-resilient logical qubits. Crucially, a quantum computer must not merely store information, but also process it. A fault-tolerant computational procedure ensures that errors do not multiply and spread. This review compares the leading proposals for promoting a quantum memory to a quantum processor. We compare magic state distillation, color code techniques and other alternative ideas, paying attention to relative resource demands. We discuss the several no-go results which hold for low-dimensional topological codes and outline the potential rewards of using high-dimensional quantum (LDPC) codes in modular architectures.
Cite
@article{arxiv.1612.07330,
title = {Roads towards fault-tolerant universal quantum computation},
author = {Earl T. Campbell and Barbara M. Terhal and Christophe Vuillot},
journal= {arXiv preprint arXiv:1612.07330},
year = {2018}
}
Comments
A concise review paper. 9 pages + references. V2 includes a correction to Fig1b which had gates Z^b and X^{a+c} interchanged. This version is the one before review and editing by Nature