aiqbench analysis
This research advances the theoretical understanding of Reed-Muller codes by establishing their capacity-achieving properties on binary-input symmetric classical-quantum channels. By deriving a new correlation bound for quantum observables, the authors demonstrate that sequential decoding is possible with vanishing error probability below the Holevo capacity. This work bridges information theory and quantum physics, offering critical insights into reliable communication over noisy quantum links using structured coding schemes.
Reed-Muller Codes on CQ Channels via a New Correlation Bound for Quantum Observables
arXiv:2502.03785v3 Announce Type: replace-cross Abstract: 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.
Abstract: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.
Information Theory (cs.IT); Quantum Physics (quant-ph)
arXiv:2502.03785 [cs.IT]
(or arXiv:2502.03785v3 [cs.IT] for this version)
Full text under the publisher's open licence · 198 words
Related coverage
Simple logical quantum computation with concatenated symplectic double codes
Quantum Journal · Aug 19, 2026
Richard Hamming, The Man Who Made Computers Reliable
Quantum Zeitgeist · Aug 17, 2026
Researchers Decode up to 1,023 Qubits Using Rank Decomposition
Quantum Zeitgeist · Oct 3, 2026
A circuit measures how well thermal phases protect quantum information
Quantum Zeitgeist · Sep 11, 2026