Open Problems Related to Quantum Query Complexity
Quantum Physics
2021-09-16 v1 Computational Complexity
Abstract
I offer a case that quantum query complexity still has loads of enticing and fundamental open problems -- from relativized QMA versus QCMA and BQP versus IP, to time/space tradeoffs for collision and element distinctness, to polynomial degree versus quantum query complexity for partial functions, to the Unitary Synthesis Problem and more.
Keywords
Cite
@article{arxiv.2109.06917,
title = {Open Problems Related to Quantum Query Complexity},
author = {Scott Aaronson},
journal= {arXiv preprint arXiv:2109.06917},
year = {2021}
}
Comments
11 pages, to appear in ACM Transactions on Quantum Computing