← all papers · overview

Open Problems Related to Quantum Query Complexity

Abstract

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.

Related papers

Ranked by semantic similarity — how closely each paper's abstract matches this one (100% = near-identical topic).