Generalized toric codes on twisted tori for quantum error correction

Abstract

The Kitaev toric code is widely considered one of the leading candidates for error correction in fault-tolerant quantum computation. However, direct methods to increase its logical dimensions, such as lattice surgery or introducing punctures, often incur prohibitive overheads. In this work, we introduce a ring-theoretic approach for efficiently analyzing topological CSS codes in two dimensions, enabling the exploration of generalized toric codes with larger logical dimensions on twisted tori. Using Gröbner bases, we simplify stabilizer syndromes to efficiently identify anyon excitations and their geometric periodicities, even under twisted periodic boundary conditions. Since the properties of the codes are determined by the anyons, this approach allows us to directly compute the logical dimensions without constructing large parity-check matrices. Our approach provides a unified method for finding new quantum error-correcting codes and exhibiting their underlying topological orders via the Laurent polynomial ring. This framework naturally applies to bivariate bicycle codes. For example, we construct optimal weight-6 generalized toric codes on twisted tori with parameters $[[ n, k, d ]]$ for $n \leq 400$, yielding novel codes such as $[[120,8,12]]$, $[[186,10,14]]$, $[[210,10,16]]$, $[[248, 10, 18]]$, $[[254, 14, 16]]$, $[[294, 10, 20]]$, $[[310, 10, \leq 22]]$, and $[[340, 16, 18]]$. Moreover, we present a new realization of the $[[360, 12, \leq 24]]$ quantum code using the $(3,3)$-bivariate bicycle code on a twisted torus defined by the basis vectors $(0,30)$ and $(6,6)$, improving stabilizer locality relative to the previous construction. These results highlight the power of the topological order perspective in advancing the design and theoretical understanding of quantum low-density parity-check (LDPC) codes.