Fault Tolerant Quantum Phases of Matter

AI summary

Overview

Research area: Quantum information theory and quantum many-body physics, specifically the classification of quantum phases of matter for mixed states and the theory of fault-tolerant quantum error correction.

Technical level: Advanced. The paper is built from formal definitions, circuit models, channel noise, and threshold theorems; it assumes familiarity with quantum error-correcting codes, local channels, and topological order.

Scope (one sentence): The paper proposes a classification of quantum phases based on whether encoded quantum information can be preserved and transferred fault tolerantly through noisy shallow circuits with measurements, and uses it to compare codes and to analyze when syndrome structure permits fault tolerance.

What This Paper Is About

Existing classifications of quantum phases, such as local channel (LC) phases and quantum-local (QL) phases, describe which states can be transformed into one another using shallow circuits, possibly with measurements and classical communication. Those definitions say little about whether the transformation, or the encoded information itself, survives noise: two states in the same QL phase can have very different robustness, and a single flipped measurement outcome in a measurement-feedback circuit can corrupt the output. The paper's goal is to define phases in which the ability to protect and fault tolerantly transfer encoded quantum information is the defining property.

Key Contributions

1. A fault-tolerant phase definition (FTQL). The authors define equivalence between convex sets of states, such as code spaces, that encode the same logical information and are connected by shallow quantum-local circuits in which all quantum operations, including measurements, are robust to noise.

2. Stability as a phase property. They define stability of a convex set as the existence of a nonzero recovery threshold for local noise, prove that stability is a property of an entire phase, and prove that any two sets of states with nonzero thresholds related by finite-depth local channel circuits are in the same fault-tolerant phase.

3. A gauge-independent classification of subsystem codes. The framework classifies subsystem codes without favoring any state of the gauge subsystem, and the authors use code switching and dimensional jumps within the 3D gauge color code to show that the 2D and 3D color code spaces are in the same FTQL phase even though they are in different LC phases.

4. A syndrome-structure criterion for fault tolerance with measurements. They show that qudit stabilizer codes with extended syndromes admit single-shot state preparation and quantum error correction, while a broad class of shallow circuits that measure point-like syndromes, including state preparation for 2D topological codes and non-Abelian topological orders with solvable anyon theories, is not fault tolerant.

Main Findings

• Stability is a property of a whole phase: the existence of a nonzero recovery threshold for local noise is shown to be a property of an entire FTQL phase, not of an individual state. Code spaces of quantum low-density parity check (LDPC) codes whose distances scale polynomially with system size are shown to be stable.

• No stable set with geometrically local encoding: the authors prove that no convex set in which information is encoded in a geometrically local region is stable.

• Finite-depth LC equivalence implies FTQL equivalence for stable sets: the authors bound how noise spreads in LC circuits and prove that all finite-depth, locally reversible LC circuits connecting two stable convex sets are fault tolerant. Restricting to finite-depth circuits, LC phase equivalence between stable convex sets implies FTQL phase equivalence.

• 2D and 3D color codes are in the same FTQL phase but different LC phases: using code switching and dimensional jumps within the 3D gauge color code, the code spaces of the 2D and 3D stabilizer color codes are shown to be FTQL-equivalent. The same conclusions can be reached for the toric code family, since the toric and color code families are closely related in any dimension. Because the two color codes are in different LC phases, stable FTQL phases are strictly coarser than LC phases when only finite-depth circuits are considered.

• Subsystem codes without gauge preference: identifying different gauge-fixed states that represent the same encoded information lets the framework classify subsystem codes without singling out a state of the gauge subsystem.

• Extended syndromes enable single-shot fault tolerance: qudit stabilizer codes whose syndromes form extended objects such as loops permit single-shot state preparation and quantum error correction, generalizing earlier results to qudit codes and non-Pauli noise.

• Point-like syndromes obstruct a broad class of shallow protocols: shallow state preparation and quantum error correction circuits that measure Hamiltonian terms and apply unitary corrections conditioned on outcomes are shown not to be fault tolerant for a wide range of lattice models with point-like excitations. The caption of Figure 1 states that fault-tolerant state preparation by measuring stabilizers and applying corrections is not possible in depth O(log log(n)) when syndromes are point-like (0-dimensional objects), but is possible in finite depth when syndromes form extended objects of dimension 1 or greater.

• This rules out existing preparation methods: the result rules out a range of existing methods for state preparation of 2D topological codes and non-Abelian topological orders with solvable anyon theories, although it does not prohibit fault-tolerant state preparation with a shallow circuit in general.

• Measurement noise can break QL equivalence: for the 2D toric code on a torus of linear size L with n = 2L² qubits on the edges, applying independent and identically distributed bit-flip noise of strength p corrupts an arbitrary two-qubit state in a product state with probability p(2 - p), while the encoded toric code state is recoverable when p is below the threshold p_c ≈ 0.11. In the noisy preparation of the logical state from the product state, flipped measurement outcomes produce a state that is in a different LC phase for any p > 0.

• There is no single "trivial" fault-tolerant phase: the authors argue this explicitly in their discussion of stability, distinguishing their classification from settings where one trivial phase serves as a reference point.

Methodology in Plain English

The authors work with qudits on regular lattices in D-dimensional Euclidean space. A circuit is described by the range r of its gates and its depth ℓ; a circuit is finite-depth when rℓ = O(1) and shallow when rℓ = O(polylog(n)), where n is the number of qudits. States are considered equal when their trace distance decays at least polynomially with n.

Instead of comparing individual states, they compare convex sets of states, such as the code space of a quantum error-correcting code. An abstract logical Hilbert space is linked to the physical Hilbert space by an encoding map and a decoding map, so that two sets are comparable only if they encode the same logical information. This allows mixtures and, importantly, lets the gauge subsystem of a subsystem code vary without changing the encoded information.

Noise is modeled as a quantum channel, usually as a convex combination of channels drawn from a parametrized class. The central class is local stochastic noise, distributions over error subsets that are λ-bounded, meaning the probability of an error containing a given set A is at most λ^|A|. Noise channels are inserted between circuit layers, and the action of a noisy circuit is compared with that of the ideal circuit followed by an effective residual noise channel.

Fault tolerance of a circuit mapping one convex set to another is then defined by requiring that, for all noise below a given strength, the transferred information is recoverable. To prove their results, the authors bound how errors spread through LC and QL circuits, construct explicit fault-tolerant circuits for the color code comparisons, and use the mixed-state renormalization group procedure to show that the noisy toric code state belongs to a different LC phase.

Why This Matters

The paper links two normally separate questions: which phase a quantum state belongs to, and whether information stored in it can be protected. It shows that phase classifications based purely on noiseless circuit equivalence can group together states with completely different noise resilience, and it provides a definition under which threshold behavior is a phase invariant.

Real-world applications:

• Fault-tolerant quantum computing with mid-circuit measurement: the results give criteria for deciding whether measurement-based protocols on hardware with noisy measurements can safely transfer encoded information.
• Code switching in architectures: the fault-tolerant equivalence of 2D and 3D color codes supports switching between codes with different geometries and dimensional jumps inside the 3D gauge color code.
• State-preparation protocol design: the extended-versus-point-like syndrome criterion tells protocol designers which code families can be prepared in a single shot and which shallow preparation schemes should be avoided.
• Benchmarking noise in quantum devices: the analysis of measurement errors in toric code preparation, including the p_c ≈ 0.11 threshold comparison, provides a concrete diagnostic for how measurement noise changes the state being prepared.

Industry relevance: the work is directly relevant to quantum hardware roadmaps that rely on mid-circuit measurement and adaptive feedback, and to efforts to certify that a device is operating in a genuinely fault-tolerant regime rather than merely preparing a state that is equivalent in the noiseless sense.

Future Directions

• Extending the classification beyond stabilizer and subsystem codes: the framework is demonstrated on color codes and gauge color codes; applying it to broader classes of topological orders, including non-Abelian orders, remains open.

• Sharpening the point-like syndrome obstruction: the no-go result covers a wide range of shallow circuits that measure Hamiltonian terms and apply conditioned unitary corrections, but it does not prohibit all fault-tolerant shallow state preparation. Characterizing exactly which circuits escape the obstruction is a natural next question.

• Connecting FTQL phases to other mixed-state invariants: since FTQL phases are strictly coarser than LC phases for finite-depth circuits, understanding which existing invariants survive, and what new invariants distinguish FTQL phases, is an open direction.

• Noise models beyond local stochastic noise: the authors note that local stochastic noise does not strictly remain local when propagated through a QL circuit, motivating the study of larger noise classes and whether the threshold results extend to them.

Target Audience

This paper is aimed at researchers in quantum information theory and quantum error correction, particularly those working on fault-tolerant architectures, code switching, and mixed-state phases of matter. It is also relevant to condensed matter theorists interested in circuit-based classifications of quantum phases and to experimentalists designing mid-circuit-measurement protocols who need to know which shallow preparation and correction schemes are provably robust.

Authors’ abstract

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.