Generalizing Quantum Tanner Codes

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Mostad, Olai Å., Rosnes, Eirik, Lin, Hsuan-Yin
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866910568134213632
author Mostad, Olai Å.
Rosnes, Eirik
Lin, Hsuan-Yin
author_facet Mostad, Olai Å.
Rosnes, Eirik
Lin, Hsuan-Yin
contents In this work, we present a generalization of the recently proposed quantum Tanner codes by Leverrier and Zémor, which contains a construction of asymptotically good quantum LDPC codes. Quantum Tanner codes have so far been constructed equivalently from groups, Cayley graphs, or square complexes constructed from groups. We show how to enlarge this to group actions on finite sets, Schreier graphs, and a family of square complexes which is the largest possible in a certain sense. Furthermore, we discuss how the proposed generalization opens up the possibility of finding other families of asymptotically good quantum codes.
format Preprint
id arxiv_https___arxiv_org_abs_2405_07980
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Generalizing Quantum Tanner Codes
Mostad, Olai Å.
Rosnes, Eirik
Lin, Hsuan-Yin
Information Theory
In this work, we present a generalization of the recently proposed quantum Tanner codes by Leverrier and Zémor, which contains a construction of asymptotically good quantum LDPC codes. Quantum Tanner codes have so far been constructed equivalently from groups, Cayley graphs, or square complexes constructed from groups. We show how to enlarge this to group actions on finite sets, Schreier graphs, and a family of square complexes which is the largest possible in a certain sense. Furthermore, we discuss how the proposed generalization opens up the possibility of finding other families of asymptotically good quantum codes.
title Generalizing Quantum Tanner Codes
topic Information Theory
url https://arxiv.org/abs/2405.07980