We introduce a classification of quantum phases of mixed states based on the ability to preserve and fault tolerantly transfer information. We formulate phase equivalence between sets of states that encode logical quantum information and are connected by shallow local channel circuits assisted by local measurements and global classical communication of measurement outcomes, where all quantum operations, including measurements, must be robust to noise. We show that the existence of a recovery threshold for local noise is a property of an entire phase. We prove that any two sets of states with nonzero thresholds that are related by finite-depth local channel circuits belong to the same fault tolerant phase. Our approach leads to a classification of subsystem codes without favoring any state of the gauge subsystem, and we demonstrate phase equivalence between 2D and 3D color codes using dimensional jumps within the 3D gauge color code. Lastly, we study how syndrome structure affects fault tolerance in circuits with measurements. We show that qudit stabilizer codes with extended syndromes permit single-shot state preparation, whereas a broad class of shallow circuits measuring point-like syndromes, including state preparation for 2D topological codes and non-Abelian topological orders with solvable anyon theories, is not fault tolerant.
AI Summary
The paper asks how to classify mixed-state quantum phases when transformations must preserve encoded information despite noisy gates and measurements. It defines fault-tolerant quantum-local (FTQL) equivalence between convex sets of states using two-way, information-preserving circuits of range-depth $r\ell=O(\operatorname{polylog} n)$, with local quantum operations and unrestricted classical feedforward. Fault tolerance requires circuit noise to become controlled residual noise at the output, recoverable by an ideal recovery channel.
A nonzero recovery threshold for local stochastic noise is invariant within a phase. LDPC stabilizer codes with distance $\Omega(n^a)$, $a>0$, satisfy this stability condition, whereas nontrivial information confined to $O(1)$ sites does not. Bounding noise propagation through locally reversible channels establishes that finite-depth LC equivalence of stable sets implies FTQL equivalence. Existing single-shot gauge-fixing and dimensional-jump protocols place compatible 2D and 3D color-code spaces in the same FTQL phase; logical-operator support bounds separate their LC phases.
The paper also extends single-shot error correction and state preparation to qudit stabilizer codes with suitable extended-syndrome structure and general channel noise. Conversely, it proves that a specified class of measure-and-correct circuits with range $O(\log\log n)$ is not fault tolerant for pointlike syndromes, covering conventional preparations of several topological codes and sequential-gauging constructions for solvable non-Abelian orders.
The no-go result does not exclude other shallow preparation protocols. Recovery need not be efficient or shallow. Noise is temporally uncorrelated; general temporal correlations can invalidate composition arguments. The LC implication requires finite depth, and higher-dimensional color-code extensions are asserted through generalization of existing protocols.
No sign of AI-generated textStrong assumptions
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
We introduce a classification of quantum phases of mixed states based on the ability to preserve and fault tolerantly transfer information. We formulate phase equivalence between sets of states that encode logical quantum information and are connected by shallow local channel circuits assisted by local measurements and global classical communication of measurement outcomes, where all quantum operations, including measurements, must be robust to noise. We show that the existence of a recovery threshold for local noise is a property of an entire phase. We prove that any two sets of states with nonzero thresholds that are related by finite-depth local channel circuits belong to the same fault tolerant phase. Our approach leads to a classification of subsystem codes without favoring any state of the gauge subsystem, and we demonstrate phase equivalence between 2D and 3D color codes using dimensional jumps within the 3D gauge color code. Lastly, we study how syndrome structure affects fault tolerance in circuits with measurements. We show that qudit stabilizer codes with extended syndromes permit single-shot state preparation, whereas a broad class of shallow circuits measuring point-like syndromes, including state preparation for 2D topological codes and non-Abelian topological orders with solvable anyon theories, is not fault tolerant.
The paper asks how to classify mixed-state quantum phases when transformations must preserve encoded information despite noisy gates and measurements. It defines fault-tolerant quantum-local (FTQL) equivalence between convex sets of states using two-way, information-preserving circuits of range-depth rℓ=O(polylogn), with local quantum operations and unrestricted classical feedforward. Fault tolerance requires circuit noise to become controlled residual noise at the output, recoverable by an ideal recovery channel.
A nonzero recovery threshold for local stochastic noise is invariant within a phase. LDPC stabilizer codes with distance Ω(na), a>0, satisfy this stability condition, whereas nontrivial information confined to O(1) sites does not. Bounding noise propagation through locally reversible channels establishes that finite-depth LC equivalence of stable sets implies FTQL equivalence. Existing single-shot gauge-fixing and dimensional-jump protocols place compatible 2D and 3D color-code spaces in the same FTQL phase; logical-operator support bounds separate their LC phases.
The paper also extends single-shot error correction and state preparation to qudit stabilizer codes with suitable extended-syndrome structure and general channel noise. Conversely, it proves that a specified class of measure-and-correct circuits with range O(loglogn) is not fault tolerant for pointlike syndromes, covering conventional preparations of several topological codes and sequential-gauging constructions for solvable non-Abelian orders.
The no-go result does not exclude other shallow preparation protocols. Recovery need not be efficient or shallow. Noise is temporally uncorrelated; general temporal correlations can invalidate composition arguments. The LC implication requires finite depth, and higher-dimensional color-code extensions are asserted through generalization of existing protocols.
We present and analyze protocols for fault-tolerant quantum computing using color codes. We present circuit-level schemes for extracting the error syndrome of these codes fault-tolerantly. We further present an integer-program-based decoding algorithm for identifying the most likely error given the syndrome. We simulated our syndrome extraction and decoding algorithms against three physically-motivated noise models using Monte Carlo methods, and used the simulations to estimate the corresponding accuracy thresholds for fault-tolerant quantum error correction. We also used a self-avoiding walk analysis to lower-bound the accuracy threshold for two of these noise models. We present and analyze two architectures for fault-tolerantly computing with these codes: one with 2D arrays of qubits are stacked atop each other and one in a single 2D substrate. Our analysis demonstrates that color codes perform slightly better than Kitaev's surface codes when circuit details are ignored. When these details are considered, we estimate that color codes achieve a threshold of 0.082(3)%, which is higher than the threshold of 1.3×10−5 achieved by concatenated coding schemes restricted to nearest-neighbor gates in two dimensions but lower than the threshold of 0.75% to 1.1% reported for the Kitaev codes subject to the same restrictions. Finally, because the behavior of our decoder's performance for two of the noise models we consider maps onto an order-disorder phase transition in the three-body random-bond Ising model in 2D and the corresponding random-plaquette gauge model in 3D, our results also answer the Nishimori conjecture for these models in the negative: the statistical-mechanical classical spin systems associated to the 4.8.8 color codes are counterintuitively more ordered at positive temperature than at zero temperature.
In fault-tolerant quantum computation [1], quantum information is protected from noise by encoding it in somewhat non-local degrees of freedom, thus distributing it among many smaller subsystems, typically qubits. This makes sense under the physically relevant assumption that interactions with the environment have a local nature. The implementation of gates, consequently, must be also as local as possible to preserve the structure of noise. This is naturally achieved with transversal gates, i.e. unitary operators that transform encoded states by acting separately on suitable subsystems, in the simplest case independently on each qubit. Unfortunately, no code admits a universal transversal set of gates [2]. Topological quantum error correcting codes [3] introduce a richer notion of locality by considering the spatial location of the physical qubits, which are assumed to be arranged on a lattice. They come in families parametrized with a lattice size, for a fixed spatial dimension. Their defining features are (i) that the measurements needed to recover information about errors only involve a few neighbouring qubits and (ii) that no encoded information can be recovered without access to a number of physical qubits comparable to the system size. Rather than sticking to the above definition of transversality, for topological codes it is natural to consider instead quantum circuits of fixed depth with geometrically local gates [4, 5]. Remarkably, it has been recently shown that spatial dimension imposes constraints on the transversal gates that are allowed [5]. In particular, this is true in the case of topological stabilizer codes, where it has been found that transversal gates on D-dimensional codes have to belong to certain sets PD. A first main result of this work [6] is that codes that saturate these bounds can be constructed for every D, in the sense that they admit at least a transversal gate in PD (not belonging to PD−1). In particular, the result applies to color codes [7, 8, 9, 10], where the single-qubit gate RD := ( 1 0 0 e2πi/2 D ) is transversal (in the more strict non-topological sense).
This thesis is devoted to studying a class of quantum error-correcting codes — topological quantum codes. We explore the question of how one can achieve fault- tolerant quantum computation with topological codes. We treat quantum error-correcting codes not only as a compelling ingredient needed to build a quantum computer, but also as a useful theoretical tool in other areas of physics. In particular, we explore what insights topological codes can provide into challenging questions, such as the classification of quantum phases of matter. In this thesis, we focus on a family of topological codes — color codes, which are particularly intriguing due to the rich physics they display and their computational power. We start by introducing color codes and explaining their basic properties. Then, we show how to perform fault-tolerant universal quantum computation with three-dimensional color codes by transverse gates and code switching. We later compare the resource overhead of the code-switching approach with that of a state distillation scheme. We discuss how to perform error correction with the toric and color codes, as well as introduce local decoders for those two families of codes. By exploiting a connection between error correction and statistical mechanics we estimate the storage threshold error rates for bit-flip and phase-flip noise in the three-dimensional color code. We finish by showing that the color and toric code families in d dimensions are equivalent in a sense of local unitary transformations and explore implications of this equivalence.
Quantum computation promises to revolutionize information processing by exploiting superposition and entanglement, enabling applications such as quantum simulation, combinatorial optimization, and secure quantum communication. Beyond individual processors, the quantum internet aims to connect quantum nodes through entanglement distribution, enabling distributed computation. However, quantum states are fragile: environmental interactions, imperfect gate operations, and measurement errors can quickly degrade encoded information. Reliable quantum computation therefore requires carefully designed quantum error-correcting codes and fault-tolerant protocols. Unlike classical redundancy schemes, quantum error correction must preserve delicate phase relationships and relies on indirect error detection through syndrome extraction with ancillary qubits, enabling error identification without collapsing encoded states. Topological codes, in particular, emerged early as the preferred choice for many architectures due to their planar structure, local interactions, and natural support for fault-tolerant logical operations. Color codes, for instance, allow transversal implementation of all Clifford gates, whereas non-Clifford operations require magic-state injection. More recent constructions, including quantum low-density parity-check codes, offer higher encoding rates and reduced resource overhead, but require long-range qubit connectivity and more complex protocols. Despite experimental progress, several challenges remain. Many platforms exhibit biased noise, motivating codes that exploit channel asymmetry. Real-time decoding remains a critical bottleneck, as fault-tolerant computation requires low-latency processing of rapidly generated syndrome data. Fault-tolerant logical state initialization also remains resource-intensive and scales poorly with code distance. Addressing these challenges, this thesis develops a unified framework spanning theory and experiment. It provides precise performance analysis of quantum error-correcting codes in the low physical error-rate regime, introduces codes tailored to biased noise, develops fast low-complexity decoding algorithms for real-time operation, and presents modular and efficient protocols for fault-tolerant state preparation of CSS codes. The latter is demonstrated experimentally through the preparation of a logical zero state of the Golay code on the Quantinuum H2 trapped-ion quantum computer.
Noise is one of the central obstacles to building useful quantum computers, and quantum error correction (QEC) provides the framework for protecting quantum information against it. Unlike classical error correction, QEC must preserve fragile quantum states without copying them, measuring them directly, or destroying the information they encode. Driven by rapid progress in both theory and experiment, this challenge has grown into one of the most active areas of quantum information science. This tutorial gives a guided introduction to modern QEC, developing the core concepts of codes, syndromes, stabilizers, decoding, and fault tolerance before connecting them to major code families and current research directions. We cover both established constructions and newer developments, including topological and subsystem codes, bosonic and qudit codes, dynamical codes, and quantum low-density parity-check (qLDPC) codes. The emphasis is on building operational understanding: explaining not only what the main objects are, but how they are used in code design, error diagnosis, decoding, and fault-tolerant computation. The tutorial is intended for newcomers seeking a first path through QEC, as well as researchers looking for a coherent reference for the concepts, code families, and tools that arise in current work.
Recently, S. Bravyi and R. K\"onig [Phys. Rev. Lett. 110, 170503 (2013)] have shown that there is a trade-off between fault-tolerantly implementable logical gates and geometric locality of stabilizer codes. They consider locality-preserving operations which are implemented by a constant-depth geometrically local circuit and are thus fault tolerant by construction. In particular, they show that, for local stabilizer codes in D spatial dimensions, locality-preserving gates are restricted to a set of unitary gates known as the Dth level of the Clifford hierarchy. In this paper, we explore this idea further by providing several extensions and applications of their characterization to qubit stabilizer and subsystem codes. First, we present a no-go theorem for self-correcting quantum memory. Namely, we prove that a three-dimensional stabilizer Hamiltonian with a locality-preserving implementation of a non-Clifford gate cannot have a macroscopic energy barrier. This result implies that non-Clifford gates do not admit such implementations in Haah's cubic code and Michnicki's welded code. Second, we prove that the code distance of a D-dimensional local stabilizer code with a nontrivial locality-preserving mth-level Clifford logical gate is upper bounded by $O({L}^{D+1\ensuremath{-}m})$. For codes with non-Clifford gates (m>2), this improves the previous best bound by S. Bravyi and B. Terhal [New. J. Phys. 11, 043029 (2009)]. Topological color codes, introduced by H. Bombin and M. A. Martin-Delgado [Phys. Rev. Lett. 97, 180501 (2006); Phys. Rev. Lett. 98, 160502 (2007); Phys. Rev. B 75, 075103 (2007)], saturate the bound for m=D. Third, we prove that the qubit erasure threshold for codes with a nontrivial transversal mth-level Clifford logical gate is upper bounded by 1/m. This implies that no family of fault-tolerant codes with transversal gates in increasing level of the Clifford hierarchy may exist. This result applies to arbitrary stabilizer and subsystem codes and is not restricted to geometrically local codes. Fourth, we extend the result of Bravyi and K\"onig to subsystem codes. Unlike stabilizer codes, the so-called union lemma does not apply to subsystem codes. This problem is avoided by assuming the presence of an error threshold in a subsystem code, and a conclusion analogous to that of Bravyi and K\"onig is recovered.