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.

翻译：我提出一个案例,量子查询复杂程度仍然充满诱人和根本的开放问题 -- -- 从相对的QMA对QCMA和BQP对IP,到碰撞和元素特性的时间/空间权衡,到部分功能的多元度和量子查询复杂程度,到单一综合问题等等。