analiza aiqbench
This research advances the mathematical foundation of 2D translationally invariant qLDPC codes by decomposing their symmetry spaces into translation-invariant subspaces. The work provides an explicit basis for these symmetries on infinite lattices, enabling efficient adaptation to finite rectangular and twisted boundaries without recomputation. These developments are critical for constructing high-performance matching-based decoders that rival heuristic methods in quantum error correction.
Materialised symmetries of 2D translationally invariant codes
arXiv:2610.06036v1 Announce Type: new 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.
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.
arXiv:2610.06036 [quant-ph]
(or arXiv:2610.06036v1 [quant-ph] for this version)
https://doi.org/10.48550/arXiv.2610.06036 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Text integral sub licența deschisă a publicației · 331 cuvinte
Subiecte conexe
Interacting hydrodynamic modes in spinless fermions with dephasing noise
arXiv · 29 iul. 2026
Matrix Product States for Modulated Symmetries: SPT, LSM, and Beyond
arXiv · 17 iun. 2026
EDISCO: Equivariant DIScrete Diffusion for Euclidean Combinatorial Optimization
arXiv · 7 oct. 2026
SPARSER: Sparse Variable Projection by Exploiting Separable Structure in Robotic Perception
arXiv · 22 sept. 2026