Open Problems Related to Quantum Query Complexity
Scott T. Aaronson · ACM Transactions on Quantum Computing · 2021
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.