Andris Ambainis, Aleksandrs Belovs. An Exponential Separation Between Quantum Query Complexity and the Polynomial Degree. In Amnon Ta-Shma, editor, 38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK. Volume 264 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. [doi]
Abstract is missing.