Reed-Muller Codes on CQ Channels via a New Correlation Bound for Quantum Observables

The question of whether Reed--Muller (RM) codes achieve capacity on binary memoryless symmetric (BMS) channels has drawn attention since it was resolved positively for the binary erasure channel by Kudekar et al.\ in 2016.

In 2021, Reeves and Pfister extended this to prove the bit-error probability vanishes on BMS channels when the code rate is less than capacity.

In 2023, Abbe and Sandon improved this to show the block-error probability also goes to zero.

These results rely on the symmetry and nested structure of RM codes.

In this work, we focus on binary-input symmetric classical-quantum (BSCQ) channels and the Holevo capacity.

For a BSCQ, we consider observables that estimate the channel input in the sense of minimizing the mean-squared error (MSE).

Using an orthogonal decomposition of minimum MSE (MMSE) observables under a weighted inner product, we derive a recursion for the extrinsic MMSE of a code bit.

Consequently, for Reed--Muller code sequences whose rates remain below the Holevo capacity by a fixed positive amount, any prescribed set of $2^{o(\sqrt{\log N})}$ bits can be decoded sequentially with the probability of any error tending to zero.