Towards optimal separations between quantum and randomized query complexities

DOI10.1109/FOCS46700.2020.00030MaRDI QIDQ6944027zbMATH OpenFDO

Authors Avishay Tal

Publication date 12 August 2025

Full work available at URL https://doi.org/10.1109/FOCS46700.2020.00030

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(2)

• On the fine-grained query complexity of symmetric functions
• On the fine-grained query complexity of symmetric functions

This page was built for publication: Towards optimal separations between quantum and randomized query complexities

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6944027)