Decoding color codes by projection onto surface codes
read the original abstract
We propose a new strategy to decode color codes, which is based on the projection of the error onto three surface codes. This provides a method to transform every decoding algorithm of surface codes into a decoding algorithm of color codes. Applying this idea to a family of hexagonal color codes, with the perfect matching decoding algorithm for the three corresponding surface codes, we find a phase error threshold of approximately 8.7%. Finally, our approach enables us to establish a general lower bound on the error threshold of a family of color codes depending on the threshold of the three corresponding surface codes. These results are based on a chain complex interpretation of surface codes and color codes.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Average-Case and Smoothed Near-Optimality for Color-Code Decoding
Block decoder for color codes yields (1+ε)-approx w.h.p. under i.i.d. and smoothed noise plus exact min-weight decoding in sparse low-p regime.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.