Reproduce “A proof of the Aaronson-Ambainis conjecture” 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
David Turturean
David Turturean proves that every bounded, low-degree polynomial on the Boolean cube has a bit with non-negligible influence, quantitatively bounded below by a polynomial in its variance and degree. The proof replaces a conjectured concentration step with an inequality applied across function levels. Consequently, classical algorithms can approximate quantum query acceptance probabilities on most uniformly random inputs using polynomially many queries.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.