Generalized quantum Tanner code

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.

Member of code lists

Primary Hierarchy

Quantum Domain

Qubit Kingdom

Qubit codeQECC Quantum

Union stabilizer (USt) codeQECC Quantum

Qubit stabilizer codeStabilizer Hamiltonian-based Qubit QECC Quantum

Coherent-parity-check (CPC) code

Qubit CSS codeCSS Stabilizer Qubit Hamiltonian-based QECC Quantum

Generalized homological-product qubit CSS codeGeneralized homological-product QLDPC CSS Stabilizer Hamiltonian-based QECC Quantum

Parents

Generalized homological-product qubit CSS code

Generalized quantum Tanner code

Children

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

Victor V. Albert (2024-05-17) — most recent

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.