Binary code rate bounds via classical quantum channels @SimonsInstitute
Binary code rate bounds via classical quantum channels  @SimonsInstitute
Uploaded October 2026 | Updated November 2026, 3 days ago
Omar Alrabiah (University of California, Berkeley)
https://simons.berkeley.edu/talks/omar-alrabiah-university-california-berkeley-2026-10-02
Explicit Constructions
Binary code rate bounds via classical quantum channelsSpectral Diversity as a Paradigm for Trustworthy AIHallucination Rates in Language GenerationExplicit Almost-Optimal ε-Balanced Codes via Free Expander WalksKikuchi Graphs: A Spectral Method for HypergraphsA survey on PIT for read-once algebraic branching programsNew directions in catalytic derandomizationPolar Codes IFourier quasicrystals from stable polynomials and beyondAlgebraic Geometry and Discrete Periodic OperatorsFinite free information inequalitiesCompressed timestamps and efficient random walks in catalytic space
Simons Institute for the Theory of Computing |

Binary code rate bounds via classical--quantum channels

SHARE TO X SHARE TO REDDIT SHARE TO FACEBOOK WALLPAPER