🔬 condensed matter

AlgebrasTQD: Computing Algebras and Interfaces in Twisted Quantum Doubles

The paper introduces AlgebrasTQD, an open-source GAP package that computes condensable algebras, topological boundaries, and interfaces for twisted quantum doubles $D^\omega(G)$ to classify gapped and gapless phases, analyze anyon proliferation, and construct non-Clifford logical gates in topological quantum codes.

Original authors: Alison Warman

Published 2026-10-28

📖 8 min read🧠 Deep dive

CC BY 4.0

Original authors: Alison Warman

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 subatomic world, matter does not always behave like solid objects or flowing fluids. Sometimes, it organizes itself into "topological phases," states of matter where the rules are written not in the arrangement of atoms, but in the global patterns of their connections. Imagine a knot in a piece of string; you cannot untie it by simply wiggling the string, only by cutting it. In these phases, the "knots" are patterns of quantum information that are incredibly stable against noise and disturbance. For decades, physicists have used a mathematical framework called "gauge theory" to describe these states, treating them as if they were governed by invisible forces similar to electromagnetism but acting on a much smaller scale. When these forces are twisted by a specific type of quantum anomaly—a subtle inconsistency in how the symmetry of the system behaves—they create a rich landscape of possibilities. These twisted systems are known as "twisted quantum doubles," and they serve as a universal map for understanding how different phases of matter relate to one another, how they can transition from one state to another, and how they might be used to build the next generation of quantum computers.

The challenge for researchers has always been that while the map exists in theory, drawing it by hand is nearly impossible. The number of possible configurations grows so rapidly that even for relatively simple groups of symmetries, the list of potential states becomes unmanageable. A recent paper by Alison Warman introduces a new tool called AlgebrasTQD, an open-source software designed to navigate this complexity. Written in a programming language specifically built for algebraic calculations, the code acts as a high-powered calculator that can systematically list every possible stable state, or "condensable algebra," within these twisted quantum systems. Instead of guessing or approximating, the software performs exact arithmetic to determine exactly which combinations of particles can exist together, how they can be transformed, and what happens when they interact with the boundaries of the system.

The core achievement of this work is the ability to classify these states with a precision that was previously out of reach. The software takes a finite group of symmetries and a specific "twist" as input and outputs a complete catalog of all the distinct phases the system can support. It does more than just list them; it organizes them into a hierarchy, showing which phases can be smoothly deformed into others and which are fundamentally different. This hierarchy is visualized as a diagram that maps the entire landscape of possibilities, revealing the hidden structure of the theory. One of the most significant findings enabled by this tool is the discovery of "twin phases." These are pairs of distinct physical states that look identical when you count the types of particles they contain, yet they are fundamentally different in how those particles interact and multiply. Before this code, such twins were difficult to distinguish because their differences lie in the subtle algebraic rules of their multiplication, not in the simple count of their components. The software successfully identifies these twins, proving that the landscape of quantum matter is even more crowded and nuanced than previously thought.

Beyond classification, the tool provides a window into the transitions between these states. When a system changes from one phase to another, it often passes through a boundary where particles can condense or disappear. The software calculates exactly how particles behave at these interfaces, mapping how a particle in one phase transforms as it crosses into a reduced, simpler phase. This is crucial for understanding "anyon proliferation," a process where the creation of new particles drives a phase transition. The code also determines the specific mathematical data required to build these systems on a computer, including the exact rules for how particles fuse together and how they braid around one another. This level of detail is essential for moving from abstract theory to physical reality, particularly in the field of quantum error correction, where these stable states are used to protect information from errors.

The utility of AlgebrasTQD extends to the construction of logical gates for quantum computers. In standard quantum computing, certain operations are easy to perform, but others are notoriously difficult. The software identifies specific configurations within these twisted quantum doubles that allow for the creation of "non-Clifford" gates, which are necessary for universal quantum computation. By simulating protocols like "lattice surgery," where different patches of quantum material are merged and split, the code demonstrates how to perform these complex operations using the topological properties of the system. It calculates the exact sequence of steps required to implement these gates, showing that they can be achieved with a constant depth of operations, meaning the time required does not grow with the size of the calculation. This provides a concrete pathway for building fault-tolerant quantum computers that rely on the inherent stability of topological matter rather than fragile individual qubits.

The researchers tested the software on a variety of groups, ranging from simple Abelian groups, where the order of operations does not matter, to complex non-Abelian groups, where the order changes the outcome. In one notable test involving a group of order 32, the software identified hundreds of distinct algebraic structures, sorting them into classes and revealing four pairs of twin algebras that had never been fully characterized before. In another test using a group of order 48, it mapped out the transitions between different phases, confirming that certain transitions are "intrinsically gapless," meaning they cannot be smoothed out into a simple, gapped state without breaking the symmetry. The code also successfully reproduced the known results for the toric code, a standard model in the field, and extended them to twisted versions, showing that the same principles apply even when the system is more complex.

What makes this tool particularly powerful is its exactness. Unlike many simulations that rely on approximations or numerical methods that can introduce small errors, AlgebrasTQD uses exact arithmetic with roots of unity. This ensures that the results are mathematically rigorous and free from the accumulation of rounding errors that can plague other computational approaches. The software is designed to be accessible to other researchers, with clear documentation and example scripts that allow users to input their own groups and twists to explore new territories. It serves as a bridge between the abstract mathematics of group theory and the physical reality of quantum phases, turning a theoretical framework into a practical instrument for discovery.

The implications of this work are far-reaching. By providing a complete map of the possible states and transitions in twisted quantum doubles, the software allows physicists to design new materials and quantum protocols with specific properties in mind. It helps in understanding the nature of "gapless" phases, which are states that remain fluid and active even at the lowest energy levels, a phenomenon that has been difficult to characterize. The identification of twin phases suggests that there are hidden layers of complexity in quantum matter that require a deeper algebraic understanding to distinguish. Furthermore, the ability to construct specific logical gates from these topological structures offers a promising route toward building quantum computers that are naturally resistant to errors.

The paper concludes by outlining future directions, suggesting that the methods used here could be extended to higher dimensions and more complex types of symmetries. The author envisions using the data generated by the code to build lattice models and simulate the behavior of these systems on tensor networks, which could reveal new insights into the dynamics of phase transitions. The tool also opens the door to exploring Landau-Ginzburg theories, a framework for describing phase transitions, in the context of non-invertible symmetries. By providing the full algebraic data for any finite group and twist, AlgebrasTQD offers a foundation for a new generation of research into the fundamental nature of quantum matter.

In the end, this work represents a significant step forward in our ability to navigate the complex landscape of topological phases. It transforms a field that was once dominated by manual calculation and intuition into one driven by systematic, exact computation. The software does not just solve a specific problem; it provides a new way of seeing the structure of quantum matter, revealing patterns and connections that were previously invisible. As researchers continue to explore the possibilities of quantum computing and topological materials, tools like AlgebrasTQD will be essential in turning the theoretical potential of these systems into practical reality. The code stands as a testament to the power of combining deep mathematical theory with modern computational tools to uncover the hidden rules that govern the universe at its smallest scales.

Technical Summary of AlgebrasTQD: Computing Algebras and Interfaces in Twisted Quantum Doubles

Problem Statement
Finite group gauge theories with Dijkgraaf-Witten twists, described by twisted quantum doubles $D^\omega(G)$ , serve as fundamental models for topological phases of matter in 2+1 dimensions and as Symmetry Topological Field Theories (SymTFTs) for 1+1d systems with global symmetries and anomalies. A central challenge in this field is the classification of condensable algebras within these theories. These algebras characterize consistent ways anyons can condense, thereby defining gapped boundaries, topological interfaces, and the phases of the corresponding 1+1d systems.

While condensable algebras are classified by group-theoretical data $(H, F, \gamma, \epsilon)$ , finding them analytically is computationally prohibitive for groups of moderate size. For instance, the quantum double of the dihedral group of order 8 possesses 38 distinct algebras, and groups of order 32 can yield hundreds. Furthermore, the algebra structure is not uniquely determined by its anyon decomposition; "twin algebras" (inequivalent algebras with identical anyon content) define distinct physical phases, necessitating the computation of full algebraic data, including projective representations and group cohomology, rather than just modular data.

Methodology
The paper presents AlgebrasTQD, an open-source software package written in GAP (Groups, Algorithms, and Programming) designed to compute condensable algebras and their associated structures for any finite group $G$ and 3-cocycle $\omega \in H^3(G, U(1))$ . The methodology relies on exact arithmetic using roots of unity to avoid numerical errors.

The core algorithmic approach involves:

Group-Theoretical Classification: The code enumerates condensable algebras classified by the quadruple $(H, F, \gamma, \epsilon)$ , where $H \leq G$ is a subgroup, $F \triangleleft H$ is a normal subgroup, $\gamma$ is a 2-cochain trivializing the restriction of $\omega$ to $F$ , and $\epsilon$ is a phase function satisfying specific consistency relations.
Exact Linear Solving: To solve the cohomological equations for $\gamma$ and $\epsilon$ , the code converts multiplicative equations into additive linear congruences modulo 1. It employs the Hermite normal form to solve systems of linear equations $Ax \equiv b \pmod 1$ exactly.
Optimization via Generators: The code reduces the computational complexity by imposing cocycle conditions only on generating sets of the subgroups rather than the entire group, a mathematical optimization proven in the paper's appendix.
Isomorphism and Inclusion Testing: The code sorts algebras into isomorphism classes by checking conjugacy and the existence of specific gauge transformations. It also constructs the partial order of subalgebras to generate Hasse diagrams.
Interface and Phase Mapping: For non-maximal algebras, the code computes the reduced topological order (a twisted quantum double of a quotient group) and the map of anyons across the interface. It also classifies the resulting 1+1d phases (e.g., SPT, SSB, or intrinsically gapless) based on the vacuum degeneracy.

Key Contributions and Results

Comprehensive Computation: AlgebrasTQD computes the complete list of condensable algebras, their anyon decompositions, and their isomorphism classes for arbitrary finite groups and 3-cocycles.
Twin Algebra Identification: The code successfully identifies "twin algebras"—inequivalent algebras sharing the same anyon decomposition. The paper demonstrates this for groups of order 32 ( $G_{32}$ ) and 48 ( $GL(2,3)$ ), confirming that twin phases exist and are distinguished by their full algebra data (specifically the multiplication of order parameters) rather than just their anyon content.
Phase Classification: The software classifies 1+1d phases arising from SymTFTs, distinguishing between gapped phases (SPT and SSB) and intrinsically gapless phases. It generates Hasse diagrams illustrating the inclusion relations between algebras, which correspond to possible symmetry-preserving deformations.
Interface Construction: The code computes the map of anyons from a reduced topological order to the original theory across a topological interface, facilitating the study of phase transitions driven by anyon proliferation.
Quantum Computing Applications: The package implements protocols for constructing non-Clifford logical gates in non-Abelian topological quantum codes. Specifically, it computes data for hybrid lattice surgery and SPT-stacking protocols on quantum doubles of dihedral groups ( $D_{4N}$ ), yielding logical gates at various levels of the Clifford hierarchy.
Validation: The code reproduces results from recent literature, including the classification of algebras for $D(D_8)$ , the existence of twin algebras in $G_{32}$ , and the twin phases of $GL(2,3)$ . It also verifies the equivalence between the type-III twisted double of $\mathbb{Z}_2^3$ and the untwisted double of $D_8$ .

Significance
The paper positions AlgebrasTQD as a critical tool for bridging the gap between abstract mathematical classification and physical application in topological phases. By automating the computation of condensable algebras, the code enables the systematic study of:

1+1d Phases and Transitions: Providing a complete classification of gapped and gapless phases for systems with finite group symmetries and anomalies, including the identification of intrinsic quantum critical points (twin phases).
2+1d Topological Order: Characterizing gapped boundaries and interfaces, and understanding the proliferation of anyons.
Fault-Tolerant Quantum Computing: Facilitating the design of logical gates in non-Abelian topological codes, which are essential for universal quantum computation.

The author emphasizes that the code is limited only by the computational time and memory required for the specific group and cocycle, making it a scalable resource for exploring the landscape of topological phases beyond the reach of manual calculation. The availability of exact arithmetic ensures that the results are mathematically rigorous, supporting both theoretical investigations and the construction of lattice models and tensor network simulations.

More like this