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，到碰撞和元素独特性的时间/空间权衡，到多项式度与部分函数的量子查询复杂性，到幺正综合问题等等。