Refuting a 20-year-old conjecture, new work proves quantum learning can achieve cubic separations over classical methods—matching known upper bounds and revealing speedups beyond Grover and Bernstein-Vazirani paradigms.
@informaq.bsky.social
@informaq.bsky.socialRefuting a 20-year-old conjecture, new work proves quantum learning can achieve cubic separations over classical methods—matching known upper bounds and revealing speedups beyond Grover and Bernstein-Vazirani paradigms.
@informaq.bsky.socialResolves a longstanding open question by constructing a total Boolean function achieving Q(f) = Õ(⁴√C(f)), proving the maximum gap between certificate complexity and quantum query complexity is quartic (up to logarithmic factors).
@informaq.bsky.socialQuantum algorithm achieves first sublinear worst-case query complexity for constructive Ramsey problems, providing provable polynomial speedup over classical approaches on random graphs with improved lower bounds.
@informaq.bsky.socialEstablishes optimal quantum and classical query complexity bounds for estimating persistence statistics from temporal graph snapshots, with Grover-type advantage and matching lower bounds across dense and sparse regimes without spectral gap assumptions.