Open Problems Related to Quantum Query Complexity

09/14/2021
by   Scott Aaronson, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset