Moderate-length lifted quantum Tanner codes
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914160679321600 |
|---|---|
| author | Guémard, Virgile Zémor, Gilles |
| author_facet | Guémard, Virgile Zémor, Gilles |
| contents | We introduce new families of quantum Tanner codes, a class of quantum codes that first appeared in the work of Leverrier and Zémor (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 $t$ of an $[[n,k,d]]$-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 $k$, and its distance is upper bounded by $t\cdot d$. Moreover, when the dimension of the lifted code is equal to $k$, its distance is lower bounded by $d$. These parameter bounds also apply to the previous methods of code lifting of Guémard (IEEE Trans. Inf. Theory, 2025). Finally, We present several explicit families, and identify instances of moderate length quantum codes which are degenerate, have low check weight, and whose distance surpasses the square root of the code length. Among them, we report the existence of a $[[96,2,12]]$-code whose distance growth saturates our bound, and for which half of the checks are of weight 8 and the other half of weight 4. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2502_20297 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Moderate-length lifted quantum Tanner codes Guémard, Virgile Zémor, Gilles Quantum Physics Information Theory Combinatorics We introduce new families of quantum Tanner codes, a class of quantum codes that first appeared in the work of Leverrier and Zémor (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 $t$ of an $[[n,k,d]]$-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 $k$, and its distance is upper bounded by $t\cdot d$. Moreover, when the dimension of the lifted code is equal to $k$, its distance is lower bounded by $d$. These parameter bounds also apply to the previous methods of code lifting of Guémard (IEEE Trans. Inf. Theory, 2025). Finally, We present several explicit families, and identify instances of moderate length quantum codes which are degenerate, have low check weight, and whose distance surpasses the square root of the code length. Among them, we report the existence of a $[[96,2,12]]$-code whose distance growth saturates our bound, and for which half of the checks are of weight 8 and the other half of weight 4. |
| title | Moderate-length lifted quantum Tanner codes |
| topic | Quantum Physics Information Theory Combinatorics |
| url | https://arxiv.org/abs/2502.20297 |