Quantum Tanner code[1]

Description

Stub.

Rate

Good QLDPC codes.

Realizations

Used to obtain explicit lower bounds in the sum-of-squares game [2].

Notes

For details, see talk by A. Leverrier.

Parents

Cousins

  • Tanner code
  • Expander lifted-product code — Quantum Tanner codes are an attempt to construct asymptotically good QLDPC codes that are similar to but simpler than expander lifted-product codes.

Zoo code information

Internal code ID: quantum_tanner

Your contribution is welcome!

on github.com (edit & pull request)

edit on this site

Zoo Code ID: quantum_tanner

Cite as:
“Quantum Tanner code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022. https://errorcorrectionzoo.org/c/quantum_tanner
BibTeX:
@incollection{eczoo_quantum_tanner, title={Quantum Tanner code}, booktitle={The Error Correction Zoo}, year={2022}, editor={Albert, Victor V. and Faist, Philippe}, url={https://errorcorrectionzoo.org/c/quantum_tanner} }
Permanent link:
https://errorcorrectionzoo.org/c/quantum_tanner

References

[1]
Anthony Leverrier and Gilles Zémor, “Quantum Tanner codes”. 2202.13641
[2]
Max Hopkins and Ting-Chun Lin, “Explicit Lower Bounds Against $Ω(n)$-Rounds of Sum-of-Squares”. 2204.11469

Cite as:

“Quantum Tanner code”, The Error Correction Zoo (V. V. Albert & P. Faist, eds.), 2022. https://errorcorrectionzoo.org/c/quantum_tanner

Github: https://github.com/errorcorrectionzoo/eczoo_data/tree/main/codes/quantum/properties/qldpc/quantum_tanner.yml.