Viderman's algorithm for quantum LDPC codes
Anirudh Krishna, Inbal Livni Navon, Mary K. Wootters · Society for Industrial and Applied Mathematics eBooks · 2024
Quantum low-density parity-check (LDPC) codes, a class of quantum error correcting codes, are considered a blueprint for scalable quantum circuits. To use these codes, one needs efficient decoding algorithms. In the classical setting, there are multiple efficient decoding algorithms available, including Viderman's algorithm (Viderman, TOCT 2013). Viderman's algorithm for classical LDPC codes essentially reduces the error- correction problem to that of erasure-correction, by identifying a small envelope L that is guaranteed to contain the error set.