Comparison of memory thresholds for planar qudit geometries
We introduce and analyze a new type of decoding algorithm called general color clustering, based on renormalization group methods, to be used in qudit color codes.The performance of this decoder is analyzed under a generalized bit-flip error Upright Vacuum Cleaner model, and is used to obtain the first memory threshold estimates for qudit 6-6-6 col