Researchers Zijian Liang, Bowen Yang, Joseph T. Iosue, and Yu-An Chen detailed a new method for building quantum code boundaries in a paper published in PRX Quantum on October 23, 2026. Their work addresses a critical challenge in scaling quantum hardware by transitioning designs from periodic lattices to planar architectures. The team’s algorithms construct for two-dimensional topological Pauli stabilizer codes, establishing a that allows direct extraction of fusion rules and braiding statistics from boundary operator algebra. This systematic approach converts topological data into explicit boundary Hamiltonians, offering a foundation for low-overhead planar quantum error correction.

Algorithmic Framework for Gapped Boundaries in 2D Stabilizer Codes

This method directly addresses the challenge of transitioning quantum error correction from periodic lattice designs to the planar architectures favored by current hardware development. The algorithms identify boundary excitations and their corresponding string operators, effectively creating edges where quantum information is contained. This automated construction process moves beyond previous examples limited to specific codes like the toric and color codes, offering a general solution for a wider range of topological stabilizer codes.

The work establishes a between anyons, quasiparticles exhibiting exotic exchange statistics, within the core quantum code and excitations appearing at the boundary. This correspondence allows researchers to directly extract fusion rules and braiding statistics, simplifying the design and verification of fault-tolerant quantum memory. The team’s approach determines which groups of anyons can condense at the edge, a critical step in defining the boundary’s properties and ensuring stable quantum information storage.

Successfully adding string operators to induce condensation does not always guarantee the preservation of topological order near the boundary; additional boundary terms may be necessary to eliminate unwanted local logical operators. This step, as the researchers term it, ensures the boundary behaves as expected and does not introduce errors.

The framework builds on the understanding that each gapped boundary of an Abelian topological order corresponds to a Lagrangian subgroup, a maximal set of bosons that do not braid non-trivially with each other. The resulting algorithms provide a pathway toward low-overhead planar quantum low-density parity-check codes, potentially accelerating the development of scalable quantum computers.

Bulk-Boundary Correspondence of Anyons and Boundary Subsystem Codes

The algorithms developed identify boundary gauge operators and anyons, then construct microscopic boundary Hamiltonians through anyon condensation and topological-order completion, effectively eliminating unwanted logical operators near the boundary. These tests demonstrate the method’s versatility across various qubit types, including composite-dimensional qudits, and accommodate nontrivial secondary boundary gauge operators and anomalous subsystem settings. A key theorem detailed in the work reveals that a bulk stabilizer code and its corresponding boundary anomalous subsystem code are, in essence, dual to each other, offering a new perspective on code design.

String operators, capable of transporting anyons between bulk and boundary locations, are central to this duality. The researchers demonstrate that the topological spins and braiding statistics of boundary anyons can be directly determined from these boundary anyon string operators, a process detailed in an accompanying appendix.

The framework ensures that bosons can terminate at the boundary without energy penalty, while other anyons violate the boundary Hamiltonian, a critical step in maintaining stability. “Therefore, the bulk string of anyon can terminate on the boundary without incurring any energy cost,” the researchers write, emphasizing the importance of this boundary condition for code functionality.

Automated Construction for ℤ𝑑 QuDit Systems

The automated process generates admissible gapped boundaries by repeating construction for each Lagrangian subgroup, moving beyond previously demonstrated examples. This approach reduces boundary design from a task specific to each model to a sequence of algebraic operations executable on a classical computer, streamlining the creation of stable quantum codes. The completed Hamiltonian allows condensed bulk anyons to terminate at the boundary without incurring an energy penalty, an important feature for scalable quantum systems.

Generalized Pauli operators, formed from products of shift and clock operators on each qudit, are represented by corresponding sums unique only up to a phase. All calculations are performed modulo, where represents the dimension of the qudit, ensuring computational efficiency. The algorithm applies to qudit systems with nonprime dimensions, such as qudits, expanding its versatility beyond traditional prime-dimensioned systems.

This capability is particularly notable as it allows for the construction of gapped boundaries and defects via boundary anyon condensation and topological order completion. “This section provides the detailed procedures of the algorithm; readers interested in the applications can proceed directly to Sec.V without delving into the technical details presented here,” the researchers state, acknowledging the complexity of the underlying mathematics. The work begins with a review of the Laurent polynomial formalism and associated notations, establishing a foundation for the subsequent algorithmic steps.

Boundary Operator Algebra Defines Anomalous Subsystem Codes

The construction of quantum code boundaries now allows for direct extraction of core quantum properties, according to work published in PRX Quantum. The resulting boundary theory exhibits anomalous behavior, differing from standard subsystem codes where gauge operators commute. Here, the Hilbert space is acted upon solely by boundary gauge operators, lacking a traditional tensor product structure. This anomaly stems from the non-commuting nature of the boundary operators themselves, essential for the code’s functionality.

A key consequence of this design is the ability to transport boundary anyons to bulk anyons, and vice versa, demonstrating a duality between the bulk stabilizer code and the boundary anomalous subsystem code. Specifically, the topological spin of an anyon is calculated using string operators that move it between vertices, while braiding statistics are derived from operators affecting two anyons simultaneously.

The researchers establish a one-to-one bulk-boundary correspondence between bulk anyons and excitations of the anomalous boundary subsystem code, enabling fusion rules, topological spins, and braiding statistics to be extracted directly from the boundary operator algebra.

Topological-Order Completion Eliminates Boundary Logical Operators

Establishing a direct link between a quantum code’s core and its boundary, researchers have devised a method to eliminate unwanted logical operators that impede stable quantum information storage. The work details an algorithmic framework for constructing for two-dimensional topological Pauli stabilizer codes, a step toward scalable quantum hardware. This approach establishes a one-to-one correspondence between anyons within the code and excitations at the boundary, streamlining the process of characterizing their behavior.

A key innovation involves a process where compatible boundary terms are added to remove residual logical operators near the edge, ensuring a stable boundary. This completion step is important because simply condensing anyons doesn’t always guarantee the necessary topological order. Hermite-normal-form and Smith-normal-form calculations are used to identify boundary gauge operators, anyons and their fusion relations, even for qudits with both prime and composite dimensions.

The method constructs a microscopic gapped-boundary Hamiltonian in two stages: boundary anyon condensation establishes finite string operators, while topological-order completion saturates the boundary with additional gauge operators. The method’s ability to handle qudits of varying dimensions expands its applicability to a wider range of quantum computing architectures, furthering the development of robust and scalable quantum systems.

Applying the Algorithm to Toric, Color, and Bicycle Codes

Laurent-polynomial representations simplify the construction of quantum code boundaries by reducing complex tasks to finite matrix computations, enabling automated designs for qudit systems with both prime and composite dimensions. The method’s application to toric, color, double-semion, six-semion, and anomalous three-fermion codes demonstrates its versatility, while analysis of bivariate bicycle codes revealed unexpectedly large logical dimensions and extended translation periods for anyon strings. These findings suggest a potential pathway to more robust and scalable quantum information processing.

The framework systematically converts topological data from the core quantum code into explicit boundary and defect Hamiltonians, establishing a foundation for constructing low-overhead planar quantum low-density parity-check (qLDPC) codes with open boundaries. This conversion is significant because it moves boundary design from a case-by-case task to a standardized computation, offering a general method for adapting promising quantum codes to planar architectures and implementing logical operations through boundaries and defects.

A systematic microscopic theory of gapped boundaries is important for transforming periodic topological qLDPC codes into practical, low-overhead planar codes and the surface code exemplifies why boundaries are more than just an implementation detail. The ability to control which anyon strings can terminate without an energy cost determines the logical degrees of freedom, code deformations and available fault-tolerant operations. While boundaries and defects have been explicitly designed for the toric and color codes, previous constructions lacked a general algorithmic approach applicable to arbitrary topological Pauli stabilizer codes, a gap this work addresses.

Challenges of Converting Periodic Codes to Planar Architectures

Bivariate bicycle codes, despite offering high thresholds and low overhead, present unique challenges when transitioning from their natural periodic lattice structure to the planar layouts favored by scalable quantum hardware; the team’s algorithms address this complexity directly. Unlike simply truncating stabilizer generators, their method avoids unconstrained boundary degrees of freedom and potential alterations to code distance or qubit count, a critical distinction for maintaining quantum information integrity.

The framework’s success hinges on preserving essential topological information during the conversion from periodic to planar architectures, including anyon fusion, topological spin, and braiding characteristics. For example, applying the algorithm to a specific bicycle code revealed anyon translation periods of 12 and 1023, despite the localized nature of the underlying stabilizer generators, a result demonstrating the method’s ability to handle complex topological features.

This preservation is not merely theoretical; the resulting boundary data and microscopic completion are important for transforming periodic qLDPC codes into viable planar architectures, while simultaneously clarifying the tradeoffs between locality and overhead. Their planar construction on a square lattice for a specific bicycle code family yielded expected parameters, illustrating the practical utility of the framework in generating candidate architectures with defined locality and overhead characteristics.

qLDPC Codes and the Need for Low-Overhead Boundary Design

The researchers’ approach addresses a key challenge in realizing practical quantum computation: converting periodic topological qLDPC codes into planar codes with open boundaries. The researchers emphasize that this separation of universal topological choices from model-dependent lattice realizations provides a systematic foundation for optimizing planar qLDPC codes and engineering boundary-based logical operations in topological stabilizer codes.

The framework’s utility extends beyond simply enabling planar architectures. It also provides a route to automating constructions for ℤ𝑑 qudits of both prime and composite dimension using Laurent-polynomial representations and finite matrix computations. This automation relies on Hermite and Smith normal forms, streamlining the process of building gapped boundaries and associated defects.

👉 More information
🗞 Algorithmic Construction of Gapped Boundaries for Topological Stabilizer Codes: A Route to Low-Overhead Planar qLDPC Codes
✍️ Zijian Liang, Bowen Yang, Joseph T. Iosue and Yu-An Chen
🧠 DOI: http://link.aps.org/doi/10.1103/989h-xjqv

More like this