AEL expander amplification is shown to preserve a strengthened average-radius list decoding property with erasures, yielding explicit codes with constant alphabet and optimal list size near the generalized Singleton bound.
Approaching the Quantum Singleton Bound with Approximate Error Correction
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
It is well known that no quantum error correcting code of rate $R$ can correct adversarial errors on more than a $(1-R)/4$ fraction of symbols. But what if we only require our codes to *approximately* recover the message? We construct efficiently-decodable approximate quantum codes against adversarial error rates approaching the quantum Singleton bound of $(1-R)/2$, for any constant rate $R$. Moreover, the size of the alphabet is a constant independent of the message length and the recovery error is exponentially small in the message length. Central to our construction is a notion of quantum list decoding and an implementation involving folded quantum Reed-Solomon codes.
fields
cs.IT 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Explicit Codes approaching Generalized Singleton Bound using Expanders
AEL expander amplification is shown to preserve a strengthened average-radius list decoding property with erasures, yielding explicit codes with constant alphabet and optimal list size near the generalized Singleton bound.