Moderate-length lifted quantum Tanner codes
Virgile Gu\'emard, Gilles Z\'emor

TL;DR
This paper introduces new quantum Tanner codes constructed from classical Tanner codes with geometrical graph structures, providing bounds on their parameters and presenting explicit examples with improved distance properties.
Contribution
It develops a framework for analyzing lifted quantum Tanner codes using cellular homology, establishing bounds on code parameters and presenting explicit moderate-length codes with enhanced distances.
Findings
Distance bounds are established for lifted codes.
Explicit examples of codes with distances surpassing the square root of length.
Existence of a $[[96,2,12]]$ quantum code with specific weight properties.
Abstract
We introduce new families of quantum Tanner codes, a class of quantum codes that first appeared in the work of Leverrier and Z\'emor (FOCS 2022). These codes are built from two classical Tanner codes, for which the underlying graphs are extracted from coverings of 2D geometrical complexes, and the local linear codes are tensor-products of cyclic or double-circulant linear codes. The advantage of code lifting is that, for any lift of odd index of an -code, we can adapt the study of the transfer homomorphism arising in cellular homology to describe symmetries of its logical operators and to establish that its dimension is lower bounded by , and its distance is upper bounded by . Moreover, when the dimension of the lifted code is equal to , its distance is lower bounded by . These parameter bounds also apply to the previous methods of code lifting of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Algebraic structures and combinatorial models · Quantum many-body systems
