Generalizing Quantum Tanner Codes
<|reference_start|>Generalizing Quantum Tanner Codes: In this work, we present a generalization of the recently proposed quantum Tanner codes by Leverrier and Z\'emor, 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.<|reference_end|>
@article{mostad2024generalizing,
    title={Generalizing Quantum Tanner Codes},
    author={Olai {AA}. Mostad and Eirik Rosnes and Hsuan-Yin Lin},
    journal={arXiv preprint arXiv:2405.07980},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.07980},
    primaryClass={cs.IT math.IT}
}