Generalized quantum Tanner code[1] 

Description

An extension of quantum Tanner codes to codes constructed from two commuting regular graphs with the same vertex set. This allows for code construction using finite sets and Schreier graphs, yielding a broader family of square complexes.

Parent

Child

  • Quantum Tanner code — Generalized quantum Tanner codes constructed out of bipartite double covers of Cayley graphs reduce to quantum Tanner codes [1].

References

[1]
O. Å. Mostad, E. Rosnes, and H.-Y. Lin, “Generalizing Quantum Tanner Codes”, (2024) arXiv:2405.07980
Page edit log

Your contribution is welcome!

on github.com (edit & pull request)— see instructions

edit on this site

Zoo Code ID: generalized_quantum_tanner

Cite as:
“Generalized quantum Tanner code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2024. https://errorcorrectionzoo.org/c/generalized_quantum_tanner
BibTeX:
@incollection{eczoo_generalized_quantum_tanner, title={Generalized quantum Tanner code}, booktitle={The Error Correction Zoo}, year={2024}, editor={Albert, Victor V. and Faist, Philippe}, url={https://errorcorrectionzoo.org/c/generalized_quantum_tanner} }
Share via:
Twitter | Mastodon |  | E-mail
Permanent link:
https://errorcorrectionzoo.org/c/generalized_quantum_tanner

Cite as:

“Generalized quantum Tanner code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2024. https://errorcorrectionzoo.org/c/generalized_quantum_tanner

Github: https://github.com/errorcorrectionzoo/eczoo_data/edit/main/codes/quantum/qubits/stabilizer/qldpc/homological/generalized_quantum_tanner.yml.