Abstract
Conventional quantum error correcting codes require multiple rounds of measurements to detect errors with enough confidence in fault-tolerant scenarios. Here, I show that for suitable topological codes, a single round of local measurements is enough. This feature is generic and is related to self-correction and confinement phenomena in the corresponding quantum Hamiltonian model. Three-dimensional gauge color codes exhibit this single-shot feature, which also applies to initialization and gauge fixing. Assuming the time for efficient classical computations to be negligible, this yields a topological fault-tolerant quantum computing scheme where all elementary logical operations can be performed in constant time.
- Received 23 February 2015
DOI:https://doi.org/10.1103/PhysRevX.5.031043
This article is available under the terms of the Creative Commons Attribution 3.0 License. Further distribution of this work must maintain attribution to the author(s) and the published article’s title, journal citation, and DOI.
Published by the American Physical Society
Popular Summary
Building a quantum computer is one of the greatest scientific and technological challenges of the present time. The key obstacle in this endeavor is noise, which appears, for example, in the form of quantum decoherence caused by interactions with the environment. Originally, it was thought that noise posed an insurmountable difficulty, but this belief was proven incorrect by the theoretical development of fault-tolerant computing techniques. Here, we demonstrate a technique that was once considered impossible: correcting errors using noisy information gathered locally in a given finite time. In order to reliably recover information about errors, the previous paradigm requires longer information-gathering operations as the intended computational precision increases.
We focus on systems containing multiple physical qubits on a lattice, and we investigate operations that can be thought of as containing multiple local operations. We assume that the qubits are linked (i.e., they can exhibit locality). While codes for correcting errors typically require many sequential measurements, we show that a single round of local measurements is sufficient for correcting errors. In achieving fault-tolerant quantum error correction, our new approach gives rise to the possibility of quantum computing with as little as possible (constant) time overhead due to fault tolerance. Moreover, it turns out that our new technique is connected with self-correction, an alternative approach to fault tolerance in which a quantum phase of matter is intrinsically robust against errors.
We expect that our results will pave the way for new fault-tolerant quantum computing techniques.