Reproduce “Quadratic Extractors” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Gautam Chandrasekaran, Jesse Goodman, David Zuckerman
The authors construct a deterministic polynomial-time extractor for quadratic sources over F₂, where outputs come from quadratic functions of hidden uniform bits. By analyzing the quadratic structure directly, rather than relying on affine or sumset reductions, it covers 2-local sources. For min-entropy k at least log^C n, it outputs k^Ω(1) bits within n^-Ω(1) statistical distance of uniform; the exponents are unspecified.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.