Decoding Quantum Tanner Codes

We introduce sequential and parallel decoders for quantum Tanner codes. When the code construction is applied to a sufficiently expanding square complex with robust local codes, we obtain family of asymptotically good low-density parity-check In this case, our provably correct arbitrary errors weight linear in length, respectively or logarithmic time. The same are easily adapted expander lifted product codes Panteleev Kalachev. Along way, exploit recently established bounds on robustness random tensor give tighter bound minimum distance