UNIVERSITY OF ILLINOIS URBANA-CHAMPAIGNSUMMER RESEARCH · 2027

Project C2 · Thrust 02

Code versus decoder under biased and correlated noise

Separate code structure from decoder assumptions, then test what happens when errors become correlated.

Maximum likelihoodGraph algorithmsCorrelated noise

The question

How much apparent code advantage remains under optimal decoding, and when can edge reweighting recover performance under correlated noise?

Why it matters

An error-correcting code and its decoder are different parts of a reliability system. A decoder that assumes independent errors can miss structure in real noise, making a code look worse than it is.

What you could investigate

  1. Compare exact maximum-likelihood decoding with a graph-based decoder such as minimum-weight perfect matching on small surface-code instances.
  2. Introduce biased noise and tunable nearest-neighbor correlations, including paired Z errors.
  3. Measure the decoding-performance gap and test whether effective edge reweighting can close it.

What you could create

  • A controlled comparison of code and decoder effects
  • Performance maps under bias and correlation
  • An account of where reweighting succeeds or fails

Keep exploring

More in quantum coding.

All research projects