🔢 mathematics

Ground-state spaces of generalized stabilizer codes

This paper establishes a $C^*$ -algebraic framework for generalized stabilizer codes on non-compact manifolds of arbitrary dimensions, characterizing their complete ground-state spaces through isotropic subgroups and proving the existence of unique frustration-free ground states with spectral gaps for Lagrangian models.

Original authors: Cathy Cheng, Nigel Higson, Danilo Polo Ojito, Emil Prodan

Published 2026-10-27

📖 6 min read🧠 Deep dive

CC BY 4.0

Original authors: Cathy Cheng, Nigel Higson, Danilo Polo Ojito, Emil Prodan

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

In the quest to understand the fundamental building blocks of reality, physicists have long been fascinated by a peculiar class of materials known as topological phases of matter. Unlike ordinary substances, which change state when heated or cooled, these materials possess a hidden robustness. Their properties are determined not by the local arrangement of atoms, but by the global shape of their quantum connections, making them incredibly stable against the kind of noise and errors that usually destroy delicate quantum information. This stability is the holy grail for building quantum computers, machines that could solve problems impossible for today's supercomputers. To harness this power, scientists use mathematical blueprints called stabilizer codes. These codes act like a set of rules that tell a quantum system how to arrange itself to remain in its lowest energy state, known as the ground state. If the system stays in this ground state, it can store information without corruption. However, while physicists have understood the ground states of a few simple, one-dimensional systems and a handful of two-dimensional ones, the full landscape of possible ground states for more complex, higher-dimensional models has remained a mystery. The difficulty lies in the sheer number of ways these quantum rules can interact, creating a vast, uncharted territory of possible behaviors that standard mathematical tools struggle to map.

A team of researchers has now charted this territory for a broad and important class of these models. By developing a new mathematical framework, they have determined the complete set of ground states for generalized stabilizer codes defined on non-compact spaces of any dimension. Their work does not just list these states; it provides a unified method to find them, revealing exactly how many distinct types of ground states exist and how they are organized. The researchers focused on models where the local interactions are built from sums of commuting projections, a structure common in many physical systems including quantum error correction schemes. They discovered that every such model can be understood through the lens of a specific geometric structure called a groupoid, which acts as a map of the system's possible configurations. By analyzing this map, they were able to identify a boundary set that dictates the behavior of the system's ground states.

The core of their discovery is a precise classification of these ground states based on "sectors." In this context, a sector represents a distinct family of ground states that are physically indistinguishable from one another at a distance, differing only by local disturbances. The researchers proved that for a large class of these models, specifically those where the underlying rules form what they call a Lagrangian subgroup, the ground states are organized into sectors, though the number of these sectors depends on the specific model and may be infinite. Within each sector, there is a specific family of pure ground states, and any other ground state is simply a mixture of these. Crucially, they showed that for these Lagrangian models, there is always exactly one "frustration-free" ground state. This is a special state where the system satisfies every single rule perfectly without any conflict, and it is separated from all other states by a spectral gap, meaning it is stable and robust.

For models that do not fit this perfect Lagrangian description, the team found that the ground states are still organized by sectors, but the structure is more complex. They demonstrated that even in these cases, the ground states can be explicitly constructed and classified. Their method works by identifying a boundary set of configurations where the system's energy is minimized. They found that if the number of violated rules in these configurations is finite and bounded, the entire space of ground states can be completely described. This result is significant because it moves beyond partial information to a full characterization. The researchers applied their framework to several well-known physical models, including the abelian quantum double models and the color code model, successfully recovering known results and providing new, explicit classifications for the ground states of the color code model, building upon prior work that had established the unique frustration-free state and string elements. They also analyzed one-dimensional Ising models, showing how the choice of rules changes the landscape of ground states, revealing that the space of non-frustration-free states can vary dramatically depending on the specific setup.

The power of this new approach lies in its ability to translate a difficult problem in quantum physics into a more manageable problem in algebra and geometry. By realizing the quantum spin algebra as a twisted group algebra and linking the stabilizer constraints to isotropic subgroups, the researchers created a bridge between the physical model and a mathematical object called a Weyl groupoid. This groupoid encodes the dynamics of the system, allowing the researchers to use established techniques to find the ground states. They proved that the dynamics of these models can be represented by a continuous function, or cocycle, on this groupoid. The ground states are then found by looking at the boundary of this function, a set of configurations where the energy cost is non-negative. This boundary set turns out to be the key to unlocking the entire structure of the ground-state space.

The findings have immediate implications for the design of quantum error-correcting codes. By knowing the exact structure of the ground-state space, engineers can better understand how errors propagate and how to correct them. The researchers showed that for the color code model, there are exactly sixteen distinct classes of pure ground states, organized by their sector. This level of detail was previously unavailable. Furthermore, their work confirms that the ground-state spaces of these models are not random or chaotic but follow a strict, predictable pattern determined by the underlying algebraic structure. The study also highlights that the choice of generating set for the stabilizer rules can influence the description of the ground states, although the physical reality remains consistent. This distinction is vital for understanding how different mathematical representations relate to the same physical system.

In summary, this paper provides a comprehensive toolkit for understanding the ground states of a wide variety of generalized stabilizer codes. It establishes that these systems, regardless of their dimension or topological complexity, possess a well-defined structure of ground states that can be explicitly computed. The researchers have moved the field from a state of partial knowledge, where only a few specific cases were understood, to a general theory that applies to a broad class of models. Their work confirms that the ground states are organized into sectors, with a unique frustration-free state in the Lagrangian case, and provides a method to construct all possible ground states from this foundation. This clarity is essential for the future development of topological quantum computation, where the ability to predict and control the ground state of a system is the first step toward building reliable quantum machines. The results stand as a definitive classification for the models they cover, offering a clear path forward for both theoretical exploration and practical application in quantum technology.

Technical Summary: Ground-State Spaces of Generalized Stabilizer Codes

Problem Statement
The computation and classification of ground-state spaces for dynamics over quantum spin algebras are central to the topological classification of matter phases, topological quantum computation, and quantum error correction. While partial information exists for specific models, determining the complete space of ground-states—identifying all states satisfying the algebraic ground-state condition $-i s(A^*\delta(A)) \ge 0$ for a given dynamics $\delta$ —has proven extremely difficult. Previous successes were limited to specific one-dimensional models or classes of two-dimensional models, relying on functional analytic techniques specialized to those particular structures. No unifying framework existed to handle generalized stabilizer codes on non-compact manifolds of arbitrary dimensions and topological types, particularly for models where local Hamiltonians are sums of commuting projections derived from Pauli operators.

Methodology
The authors develop a unified $C^*$ -algebraic framework to address this problem. The methodology proceeds through the following steps:

Algebraic Formulation: The quantum spin algebra $A$ is realized as the twisted group $C^*$ -algebra $A_{\sigma_k} = C^*(P_k, \sigma_k)$ of an infinite discrete Pauli module $P_k$ . This module is defined over a locally finite CW-decomposition $\Sigma$ of a non-compact $n$ -manifold $M$ and its dual $\tilde{\Sigma}$ . The module $P_k$ consists of finitely supported functions mapping $k$ -cells to a finite abelian group $G$ and dual $(n-k)$ -cells to its Pontryagin dual $\hat{G}$ .
Stabilizer Correspondence: Stabilizer codes are characterized by isotropic subgroups $L \subseteq (P_k, \omega_k)$ , where $\omega_k$ is the non-degenerate symplectic structure induced by the commutator pairing of the Pauli group. The authors establish a correspondence where every isotropic subgroup $L$ (with compatible lifts) determines a code $C_L$ and a dynamics $\alpha_L$ generated by a formal Hamiltonian $H_L = \sum (1 - P_l)$ .
Groupoid Diagonalization: A core innovation is the realization that for Lagrangian subgroups $L$ (where $L = L^\perp$ ), the commutative subalgebra $A_L$ generated by the stabilizers forms a $C^*$ -diagonal of the observable algebra $A_{\sigma_k}$ . This allows the application of the theory of $C^*$ -inclusions developed by Kumjian and Renault. The dynamics $\alpha_L$ is shown to be induced by a continuous 1-cocycle $c_L$ on the associated Weyl groupoid $G_L$ .
Boundary Analysis: Leveraging recent results by Laca, Larsen, and Neshveyev regarding ground-states on groupoid $C^*$ -algebras, the authors identify a "boundary set" $Z_L$ within the unit space of the groupoid. The ground-state space of the model is shown to be affinely homeomorphic to the state space of the restricted groupoid $C^*$ -algebra $C^*G^b_L$ , where $G^b_L$ is the reduction of $G_L$ to $Z_L$ .
Sector Classification: The authors analyze the orbit space $\Gamma_L = Z_L / G^b_L$ (the sector space). They construct an explicit family of pure ground-states parametrized by the projective spaces of $\ell^2$ -spaces over these orbits.

Key Contributions and Results

Isomorphism Class Resolution: The paper proves that for any normalized 2-cocycle $\sigma_k$ with a non-degenerate commutator pairing, the observable algebra $A_{\sigma_k}$ is isomorphic to the quantum spin UHF algebra $M_{|G|}^{\otimes \Sigma_k}$ . This resolves the question of whether different cocycles yield non-isomorphic algebras; they do not, though they may induce different notions of locality.
Frustration-Free Ground States: For any isotropic subgroup $L$ , the space of frustration-free ground states $G^F_L$ is affinely homeomorphic to the state space of the logical algebra $A^{\log}_L \simeq C^*(L^\perp/L, \tilde{\sigma}_k)$ . Crucially, if $L$ is Lagrangian, $A^{\log}_L \cong \mathbb{C}$ , implying the existence of a unique frustration-free ground state with a spectral gap.
Complete Ground-State Characterization (Conditional): The primary result (Theorem 1.5) provides a characterization of the full ground-state space $G_L$ for admissible Lagrangian models. The space is the weak- $*$ closed convex hull of a family of pure ground states $s_{\gamma, [\xi]}$ . These states are indexed by sectors $\gamma \in \Gamma_L$ and vectors in the projective space of $\ell^2(O_\gamma)$ . This characterization is complete (i.e., the map is bijective and exhausts all pure ground states) if the sector space $\Gamma_L$ is a $T_0$ space. The paper notes that whether $\Gamma_L$ is $T_0$ for every admissible Lagrangian model remains an open conjecture.
Topological Conditions: The paper establishes that if the sector space $\Gamma_L$ is a $T_0$ space, the constructed family exhausts all pure ground states. A sufficient condition for $\Gamma_L$ to be $T_0$ is that the boundary set $Z_L$ consists entirely of characters with finite support ( $Z_L \subseteq \Xi_L$ ). Under this condition, the boundary algebra $C^*G^b_L$ is solvable in the sense of [22] if the support size is uniformly bounded.
Explicit Applications: The framework is applied to:
- Abelian Quantum Doubles: Recovering the complete ground-state classification of [16] and explicitly parametrizing pure states within each sector.
- Color Code Models: Providing the first complete classification of ground-states for the planar color code, identifying exactly sixteen unitary equivalence classes of pure ground states.
- Ising Models: Analyzing both biased and unbiased one-dimensional Ising models. The biased model (with a boundary term) is shown to have a unique frustration-free state, while the unbiased model (non-Lagrangian) admits two frustration-free states and a continuous family of excited ground states corresponding to domain walls.

Significance
The paper claims to provide a unifying framework capable of computing the full ground-state space for a broad class of generalized stabilizer codes on non-compact manifolds of arbitrary dimension, subject to the condition that the sector space is $T_0$ . By translating the problem into the language of groupoid $C^*$ -algebras and 1-cocycles, the authors bypass the need for model-specific functional analytic techniques. The framework not only recovers known results for standard models (like Kitaev's quantum doubles) but also extends them to more complex scenarios, such as color codes and biased interactions, offering explicit descriptions of superselection sectors and the structure of the ground-state space. The work bridges the gap between the algebraic theory of stabilizer codes and the analytic theory of equilibrium states on groupoid $C^*$ -algebras, demonstrating that "diagonalizing" the dynamics via a $C^*$ -diagonal allows for a complete solution to the ground-state problem when the topological condition on the sector space is met.

Technical Summary: Ground-State Spaces of Generalized Stabilizer Codes

More like this