Symmetry-enriched topological order and quasifractonic behavior in $\mathbb{Z}_N$ stabilizer codes

This paper establishes that the topological properties and symmetry-enriched order of $\mathbb{Z}_N$ bivariate-bicycle codes can be systematically determined by analyzing their prime-factor counterparts, thereby enabling the generalization of algebraic-geometric methods to resolve anyon fusion rules and quasifractonic mobility puzzles in qudit stabilizer codes.

The Gist

Imagine you are trying to organize a massive, complex dance floor where thousands of dancers (particles) move according to strict, invisible rules. In the world of quantum physics, these rules create "topological order"—a state of matter that is incredibly robust and hard to break, making it perfect for building future quantum computers.

This paper is like a master choreographer's guidebook. It introduces a new, powerful way to understand a specific family of these quantum dance floors, called ZN BB codes. Here is the breakdown of their findings in simple terms:

1. The Big Problem: Too Many Dancers, Too Many Rules

Usually, scientists study these systems using "binary" dancers (like coins that are either Heads or Tails). But this paper looks at "qudits," which are like dice with $N$ sides (where $N$ can be any number, not just 2).

• The Challenge: When $N$ is a complex number (like 12, which is $3 \times 4$), the math gets incredibly messy. It's like trying to predict the movement of a dance troupe where everyone has a different number of steps they can take.
• The Breakthrough: The authors discovered a "magic shortcut." They found that you don't need to solve the whole complex puzzle at once. Instead, you can break the problem down into smaller, simpler puzzles based on the prime numbers that make up $N$.
  • Analogy: If you want to understand a complex 12-sided die, you don't need to reinvent the wheel. You just need to understand how a 3-sided die and a 4-sided die behave separately, and then you can figure out the 12-sided one. This simplifies the math enormously.

2. The "Quasifracton" Mystery: The Stuck Dancer

In some of these quantum systems, particles behave like fractons. Imagine a dancer who is so stuck to the floor that they cannot move at all without breaking the rules of the dance. In traditional fracton models, if you try to move one, they split into pieces and scatter.

• The Puzzle: There was a famous model (the DCY model) where scientists were confused. They thought the dancers were completely stuck, but others argued they could move. It was a "mobility puzzle."
• The Solution: The authors clarified that these particles are "quasifractons."
  • The Analogy: Imagine a dancer who is stuck in a specific spot. If they try to take a single step, they split into two dancers (which is bad). However, if they take a long leap (a specific distance), they can land perfectly on a new spot without splitting.
  • The Result: They proved that these particles are never truly stuck forever. They can always hop from one place to another, provided they jump a specific distance (like a knight in chess). This resolves the confusion: they aren't immobile; they just have a "minimum jump distance."

3. The "Ground State" Count: How Many Ways to Dance?

In these quantum systems, the "Ground State" is the most relaxed, calm configuration of the dancers. The number of ways the dancers can arrange themselves in this calm state is called the Ground State Degeneracy (GSD).

• The Twist: In normal systems, this number is fixed. But in these special systems, the number of ways to arrange the dancers depends on the size of the room (the system size).
• The Finding: The authors developed a precise mathematical recipe (using something called "Gröbner bases," which is like a super-advanced calculator for algebra) to count exactly how many arrangements are possible for any room size. They applied this to fix a previous error in the literature regarding the DCY model, showing exactly how the room size changes the number of possible calm states.

4. The Toolkit: A New Calculator

To do all this, the authors built a new computational tool.

• The Old Way: Trying to calculate these properties by hand for complex numbers was like trying to solve a Rubik's cube with your eyes closed.
• The New Way: They created an efficient method using algebraic geometry (specifically the BKK theorem) and computer algebra.
  • Analogy: They built a "GPS" for these quantum systems. You feed in the rules of the dance (the polynomials), and the GPS instantly tells you:
    1. Is the system stable (topological)?
    2. How many different types of dancers (anyons) exist?
    3. How far can they jump (mobility)?
    4. How many ways can they sit still (GSD)?

Summary

In short, this paper takes a very complicated, messy class of quantum systems (where particles have many sides) and says, "Don't panic."

1. Simplify: Break the complex number down into its prime building blocks.
2. Clarify: Prove that the "stuck" particles can actually move if they jump far enough.
3. Calculate: Provide a precise, computer-friendly method to count all the possible states of the system.

This work doesn't just solve a math puzzle; it provides the essential map and tools needed to design better, more robust quantum computers that can handle complex information without crashing.

Technical Summary

Technical Summary: Symmetry-enriched topological order and quasifractonic behavior in $Z_N$ stabilizer codes

Problem Statement
The paper addresses the characterization of topological order and excitation mobility in a broad class of qudit stabilizer codes known as $Z_N$ bivariate-bicycle (BB) codes. These codes generalize binary BB codes (and the toric code) to systems with $Z_N$ qudits, where $N$ is an arbitrary positive integer, potentially composite. While binary BB codes have been studied extensively regarding their topological order and anyon fusion rules, the generalization to composite $N$ presents significant algebraic challenges. Specifically, determining topological conditions, fusion rules, and the mobility of excitations (which exhibit "quasifractonic" behavior) becomes non-trivial when $N$ contains prime powers. Furthermore, existing literature on specific models, such as the Delfino-Chamon-You (DCY) model, has left open questions regarding the existence of finite mobility periodicities and the precise calculation of Ground State Degeneracy (GSD).

Methodology
The authors employ a polynomial representation of stabilizer codes, utilizing the Laurent polynomial ring $R = Z_N[x^{\pm}, y^{\pm}]$ to describe translation-invariant stabilizer models. The core methodological innovation is the reduction of the analysis of $Z_N$ codes (where $N$ is composite) to the analysis of their $Z_p$ counterparts, where $p$ are the prime factors of $N$.

1. Prime Factor Reduction: The authors establish that essential topological properties of a $Z_N$ BB code are determined entirely by the properties of the corresponding $Z_p$ codes for all prime factors $p|N$. This allows the application of well-studied frameworks for prime-dimensional qudits to the general composite case.
2. Algebraic-Geometric Methods: For prime dimensions, the authors generalize the use of the Bernstein-Khovanskii-Kushnirenko (BKK) theorem to determine anyon fusion rules. This involves calculating the topological index via the mixed area of Newton polygons associated with the defining polynomials of the code.
3. Symmetry-Enriched Topological (SET) Analysis: The paper analyzes the interplay between topological order and lattice translation symmetry. By defining a "mobility group" $\Lambda_C$, the authors characterize which lattice translations preserve anyon types, thereby resolving the "mobility puzzle" regarding whether excitations can hop one-to-one over finite distances.
4. Computational Algebra: For complex cases where analytical derivation is difficult, the authors develop an efficient computational method based on Gröbner bases over the ring of integers ($Z$). This method maps the Laurent polynomial ring to a quotient of a standard polynomial ring, allowing for the systematic calculation of topological conditions, fusion rules, periodicities, and GSD.

Key Contributions and Results

• Reduction Theorem for Topological Order: The paper proves that a $Z_N$ BB code is topological if and only if its $Z_p$ counterparts are topological for all prime factors $p$ of $N$. This leads to a finiteness criterion: the code is topological if and only if the quotient module $Q = R/(f, g)$ is finite.
• Generalized Fusion Rules: The authors derive a formula for the fusion rules of anyons in general $Z_N$ BB codes. The fusion group structure is shown to be a direct sum of fusion groups of the $Z_p$ codes, weighted by the prime factorization of $N$. This enables the extension of BKK-based fusion rule calculations from qubits to general qudits.
• Resolution of the Quasifractonic Mobility Puzzle: The paper demonstrates that while excitations in these codes may split under local operations (resembling fractons), they always possess long-range one-to-one mobility over sufficiently large but finite distances. The authors define the "anyon periodicities" ($l_x, l_y$) as the minimal translation distances that leave all anyon types invariant. They prove these periodicities always exist and are finite for any topological BB code, resolving previous ambiguities in the literature regarding the DCY model.
• Analytical Characterization of Specific Models:
  • Watanabe-Cheng-Fuji (WCF) Model: The authors provide concise derivations for the anyon types, fusion rules, and mobility periodicities of the WCF model.
  • Delfino-Chamon-You (DCY) Model: The paper provides what it claims is the first accurate analytical determination of the DCY model's GSD and mobility group. It corrects previous results (e.g., in Ref. [54]) that failed to capture the system-size dependence of the GSD and incorrectly suggested non-existence of finite periodicities for certain parameters.
• Computational Framework: A practical algorithm based on Gröbner bases over integers is presented and applied to various $Z_N$ BB codes (including those with toric layouts). The results, summarized in Table I, demonstrate the method's ability to handle composite dimensions and complex polynomial structures to yield fusion rules, periodicities, and GSD.

Significance
The paper claims to provide a unifying framework for understanding the topological and symmetry-enriched properties of a broad class of qudit stabilizer codes. By reducing the complex problem of composite $N$ to prime $p$ cases, the authors significantly simplify the analysis of topological order and fusion rules. The resolution of the DCY model's mobility puzzle clarifies the nature of "quasifractonic" behavior, distinguishing it from true fractons by establishing the existence of finite mobility periodicities. Furthermore, the development of computational algebraic methods based on Gröbner bases offers a scalable tool for investigating topological properties in systems where analytical solutions are intractable. The work bridges the gap between quantum error correction (QLDPC codes) and condensed matter physics (modulated symmetries and fracton phases), suggesting that methods developed for one can be effectively applied to the other.