Open Problems Related to Quantum Query Complexity
Keyword(s):
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.
Keyword(s):
2006 ◽
Vol 72
(2)
◽
pp. 220-238
◽
Keyword(s):
2004 ◽
Vol 69
(2)
◽
pp. 244-258
◽
2010 ◽
Vol E93-D
(2)
◽
pp. 280-289
Keyword(s):