PDE and mathematical physics · Oct 6, 2026
The optimal quartic separation between randomized and quantum queries
Shows that the universal bound for total Boolean functions is sharp in its exponent, ruling out every smaller power and disproving the conjectured cubic relation. Here R and Q are randomized and quantum worst-case bit-query complexities with error at most 1/3; computation between queries is unrestricted.
Contributors
Unreleased OpenAI model
AI systems: Unreleased OpenAI model