Approximate minimum‑weight decoding in the colour code

Determine whether there exists, for every ε > 0, a polynomial‑time algorithm that, given any syndrome of the two‑dimensional colour code, outputs an error set generating that syndrome whose weight is at most (1+ε) times the minimum possible weight.

Background

The paper proves that exact minimum‑weight decoding in the two‑dimensional colour code is NP‑hard, even in the code‑capacity model with independent, equally likely X‑errors. While this rules out efficient exact algorithms (assuming P≠NP), it does not determine whether near‑optimal solutions are efficiently attainable.

The authors discuss that some NP‑hard problems admit polynomial‑time approximation schemes (PTAS), while others are provably hard to approximate. Their reduction from 3‑SAT incurs a superlinear blow‑up in instance size, so known inapproximability results for 3‑SAT do not directly imply inapproximability for colour‑code decoding. Consequently, it remains unresolved whether a PTAS (or any systematic approximation guarantee) exists for colour‑code minimum‑weight decoding.