Reproduce “Quantum Advantage has Few Complexity Implications” 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
Eli Goldin, Alex Lombardi, Tomoyuki Morimae
The authors construct oracle worlds showing that proofs of quantumness can coexist with P=NP, while oblivious state preparation can coexist with BQP=QCMA. In the classical-oracle setting, an interactive proof is average-case hard for nonuniform classical algorithms; a separate quantum oracle supports four-message quantum-verifier OSP. These are relativized existence results, not evidence of practical quantum advantage.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.