Generalized Belief Propagation Algorithms for Decoding of Surface Codes
Belief propagation (BP) is well-known as a low complexity decoding algorithm with a strong performance for important classes of quantum error correcting codes, e.g.notably for the quantum low-density parity check (LDPC) code class of random expander codes.However, it is also well-known that the performance of BP breaks down when facing topological