📝 SummarXiv

Abstract

Quantum low-density parity-check codes, such as the Kitaev toric code and bivariate bicycle codes, are often defined with periodic boundary conditions, which are difficult to realize in physical systems. In this paper, we present an algorithm for constructing all gapped boundaries and defects of two-dimensional Pauli stabilizer codes. Using the operator algebra formalism, we establish a one-to-one correspondence between the topological data, such as anyon fusion rules and topological spins, of two-dimensional bulk stabilizer codes and one-dimensional boundary anomalous subsystem codes. To make the operator algebra computationally accessible, we adapt Laurent polynomials and convert the tasks into matrix operations, e.g., the Hermite normal form for obtaining boundary anyons and the Smith normal form for determining fusion rules. This approach enables computers to automatically generate all possible gapped boundaries and defects for topological Pauli stabilizer codes through boundary anyon condensation and topological order completion. This streamlines the analysis of surface codes and associated logical operations for fault-tolerant quantum computation. Our algorithm applies to $\mathbb{Z}_d$ qudits for both prime and nonprime $d$, enabling exploration of topological phases beyond the Kitaev toric code. We have applied the algorithm and explicitly demonstrated the lattice constructions of 2 boundaries and 6 defects in the $\mathbb{Z}_2$ toric code, 3 boundaries and 22 defects in the $\mathbb{Z}_4$ toric code, 1 boundary and 2 defects in the double semion code, 1 boundary and 22 defects in the six-semion code, 6 boundaries and 270 defects in the color code, and 6 defects in the anomalous three-fermion code. Finally, we study the boundaries of bivariate bicycle codes, showing that they exhibit large logical dimensions and anyons with long translation periods.