Generalized matching decoders for 2D topological translationally-invariant codes
This research introduces a graph-matching decoding method for 2D topological codes like Toric and Bivariate Bicycle codes. The method simplifies complex codes by relating them to multiple Toric Codes through coarse-graining. This allows the decoding problem to be solved using graph matching algorithms, achieving error correction capabilities and non-zero thresholds.