Maximally Extendable Product Codes are Good Coboundary Expanders
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866908605089841152 |
|---|---|
| author | Kalachev, Gleb Panteleev, Pavel |
| author_facet | Kalachev, Gleb Panteleev, Pavel |
| contents | We investigate the coboundary expansion property of tensor product codes, known as product expansion, which plays an important role in recent constructions of good quantum LDPC codes and classical locally testable codes. Prior research has shown that this property is equivalent to agreement testability and robust testability for products of two codes with linear distance. However, for products of more than two codes, product expansion is a strictly stronger property. In this paper, we prove that a collection of an arbitrary number of random codes over a sufficiently large field has good product expansion. We believe that, in the case of four codes, the same ideas can be used to construct good quantum locally testable codes, in a way similar to the current constructions that use only products of two codes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_01411 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Maximally Extendable Product Codes are Good Coboundary Expanders Kalachev, Gleb Panteleev, Pavel Information Theory Quantum Physics 94B05 E.4 We investigate the coboundary expansion property of tensor product codes, known as product expansion, which plays an important role in recent constructions of good quantum LDPC codes and classical locally testable codes. Prior research has shown that this property is equivalent to agreement testability and robust testability for products of two codes with linear distance. However, for products of more than two codes, product expansion is a strictly stronger property. In this paper, we prove that a collection of an arbitrary number of random codes over a sufficiently large field has good product expansion. We believe that, in the case of four codes, the same ideas can be used to construct good quantum locally testable codes, in a way similar to the current constructions that use only products of two codes. |
| title | Maximally Extendable Product Codes are Good Coboundary Expanders |
| topic | Information Theory Quantum Physics 94B05 E.4 |
| url | https://arxiv.org/abs/2501.01411 |