arXiv:2610.06036
Materialised symmetries of 2D translationally invariant codes
Andrew Li, Stephen D. Bartlett, Andrew C. Doherty, Campbell K. McLauchlan
Abstract
There has been significant recent interest in near-term qLDPC codes as high-performance alternatives to surface and color codes. One such class of codes is 2-dimensional translationally invariant (TI) codes, such as bivariate bicycle codes, which share similar properties to topological codes. Fundamental objects in the study of such codes are the materialised symmetries, which can be used for the construction of matching-based decoders. These decoders generalise the minimum-weight perfect matching decoder for toric codes and provide similar asymptotic performance guarantees that heuristic decoders such as BP and its variants lack. Despite this, the mathematical structure of symmetries along with their properties under translation and restriction to finite-sized lattices has not been well-studied. We describe a decomposition of symmetry spaces of 2D CSS TI codes on infinite lattices into translation-invariant subspaces which allow us to write an explicit basis of symmetries in a plane-wave-like form. We then describe how to adapt this infinite lattice basis so that any corresponding rectangular periodic lattice basis can be obtained by restriction to basis elements compatible with the periodic boundaries. This allows us to describe how the symmetry space varies with different rectangular dimensions. We illustrate via examples that it is often straightforward in practice to determine a basis of symmetries on twisted boundaries as well, without needing to recompute the decomposition. We comment on the applications of this framework to matching-based decoders and provide examples of symmetries of such codes as the gross code.
AI Summary
Materialised symmetries—global relations among stabiliser checks—encode anyon conservation laws and support matching-based decoding. This paper asks how their translation structure can be described explicitly and how they survive compactification to finite periodic lattices. It treats exact, two-block CSS complexes over $R=\mathbb{F}_2[x^{\pm1},y^{\pm1}]$, specified by coprime polynomials $A,B$, with two qubits and one check of each type per unit cell. The construction uses the duality between symmetries and the anyon module $R/(A,B)$. After extending to a finite splitting field, primary decomposition and the Chinese remainder theorem separate this module into local pieces indexed by common roots of $A,B$. Dualisation and field traces give translation-invariant symmetry components indexed by Galois orbits. Explicit basis functions combine finite-field plane waves with binomial-coefficient factors accounting for root multiplicities. These expressions determine translational periods and coarse-grainings. For rectangular periodic boundaries, a basis adapted to two filtrations can be precomputed so that every finite-lattice basis is obtained by selecting compatible elements. Compatibility depends on root orders and the powers of two dividing the boundary lengths. For gross-code polynomials, the infinite-lattice symmetry space has dimension eight; six symmetries survive on $6\times12$ boundaries, giving 12 logical qubits, while all eight survive on $12\times12$, giving 16. The rectangular selection procedure does not extend generally to twisted boundaries, although examples are analysed. Generalisations beyond two-block CSS codes are proposed rather than established. Decoder applications are discussed, but no decoding-performance results are presented.
Error found: The abstract's general description of 2D CSS TI codes exceeds the demonstrated scope, which assumes an exact two-block CSS construction specified by coprime Laurent polynomials A and B. The gross-code local dual basis omits ωδ_(uv) from the functional dual to v², making that printed basis inconsistent with both the quotient relation uv=ωv² and the subsequent plane-wave expression. The periodic-boundaries section drops a factor of two in its formula for the number of logical qubits, which should be 2Σ_i q_i n_i. The twisted-boundary gross-code counting rule incorrectly drops powers of two from its root-compatibility tests and predicts eight rather than four logical qubits for boundary vectors (6,0) and (2,4).
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 14 pages, 5 figures, 2 tables, comments welcome