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]
@inproceedings{AmbainisB23,
title = {An Exponential Separation Between Quantum Query Complexity and the Polynomial Degree},
author = {Andris Ambainis and Aleksandrs Belovs},
year = {2023},
doi = {10.4230/LIPIcs.CCC.2023.24},
url = {https://doi.org/10.4230/LIPIcs.CCC.2023.24},
researchr = {https://researchr.org/publication/AmbainisB23},
cites = {0},
citedby = {0},
booktitle = {38th Computational Complexity Conference, CCC 2023, July 17-20, 2023, Warwick, UK},
editor = {Amnon Ta-Shma},
volume = {264},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik},
isbn = {978-3-95977-282-2},
}