Approaching the Quantum Singleton Bound with Approximate Error Correction

Explore a cutting-edge lecture on quantum error correction that pushes the boundaries of the quantum Singleton bound. Delve into the concept of approximate quantum codes capable of efficiently decoding adversarial errors at rates approaching (1−R)/2 for any constant rate R. Discover how these codes maintain a constant alphabet size independent of message length while achieving exponentially small recovery errors. Examine the crucial role of quantum list decoding and folded quantum Reed-Solomon codes in this groundbreaking construction. Learn about the collaborative research efforts behind this advancement in quantum information theory, presented by Louis Golowich from UC Berkeley as part of the Quantum Summer Cluster Workshop at the Simons Institute.

Approaching the Quantum Singleton Bound with Approximate Error Correction