Running summarizing tools on a new article
Check the paper below, then start its synthesis.
An Exponential Separation Between Quantum Query Complexity and the Polynomial Degree
Andris Ambainis (University of Latvia), Aleksandrs Belovs (University of Latvia)
Computational Complexity
DOI: 10.1007/s00037-025-00277-4 (Computer Science)
License: not stated (all rights reserved)
Published on 03 Oct. 2025