#QueryComplexity
Establishes quadratic and near-optimal separations between randomized and quantum query complexity for permutation-invariant functions and hypergraph properties, improving previous cubic bounds through novel sampling and residual expansion techniques.

#QuantumAlgorithms #QueryComplexity #Research
Improved Query Complexity Separations for Permutation-Invariant Functions
iq.fp2.dev
November 13, 2026 at 8:57 PM
Proven that QSVT provides asymptotically optimal O(1/δ·log(1/ε)) query complexity for implementing fractional quantum evolution. Matching lower bounds resolve long-standing open question on algorithm efficiency for non-integer unitary powers.

#QuantumAlgorithms #QueryComplexity #Research
Optimal Query Complexity for Fractional Quantum Evolution
arxiv.org
November 1, 2026 at 4:40 PM
Researchers develop a matroidal framework separating query-dependent structure from span program design, proving tighter quantum algorithm bounds for recursive closure problems with explicit computational certificates.

#QuantumAlgorithms #QueryComplexity #Research
Quantum Query Complexity via Matroidal Span Programs and Adversary Bounds
iq.fp2.dev
October 31, 2026 at 10:09 AM
Researchers develop a matroidal framework separating query-dependent structure from span program design, proving tighter quantum algorithm bounds for recursive closure problems with explicit computational certificates.

#QuantumAlgorithms #QueryComplexity #Research
Quantum Query Complexity via Matroidal Span Programs and Adversary Bounds
iq.fp2.dev
October 31, 2026 at 10:09 AM
Resolves a decade-long open problem: proves the exact quantum query complexity of EXACT5₃,₄ is exactly 4 queries. Uses novel rational semidefinite certificates to rule out all 3-query exact algorithms, separating near-unit success from true exactness.

#QuantumAlgorithms #QueryComplexity #Research
Exact Quantum Query Complexity of EXACT5₃,₄ Settled via Rational Dual Certificates
arxiv.org
October 20, 2026 at 2:40 AM
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.

#QuantumAlgorithms #QueryComplexity #Research
Optimal Quantum-Classical Query Complexity Separations in Exact Learning
arxiv.org
September 30, 2026 at 4:41 PM
Resolves 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).

#QuantumAlgorithms #QueryComplexity #Research
Near-Quartic Separation Between Certificate Complexity and Quantum Query Complexity
arxiv.org
September 11, 2026 at 9:26 AM
Quantum 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.

#QuantumAlgorithms #QueryComplexity #Research
Quantum Query Algorithms for the Constructive Diagonal Ramsey Theorem
arxiv.org
September 9, 2026 at 5:25 AM
Establishes 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.

#QuantumAlgorithms #QueryComplexity #Research
Quantum Query Complexity of Persistence Statistics in Graph Zigzags
arxiv.org
September 9, 2026 at 5:19 AM
New study gives tight lower bounds for factorised join query representations: N^{Ω(tw)} for bounded‑arity and N^{Ω(subw^{1/4})} for unbounded‑arity, matching known upper bounds. https://getnews.me/tight-lower-bounds-for-factorised-representations-of-join-queries/ #databases #querycomplexity
September 27, 2025 at 1:27 AM