Skip to main content
Journal ArticleOPEN ACCESS

Open Problems Related to Quantum Query Complexity

  • Aaronson S
ACM Transactions on Quantum Computing (2021) 2(4) 1-9
DOI: 10.1145/3488559
N/ACitations
Citations of this article
25Readers
Mendeley users who have this article in their library.

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.

Cite

CITATION STYLE

APA

Aaronson, S. (2021). Open Problems Related to Quantum Query Complexity. ACM Transactions on Quantum Computing, 2(4), 1–9. https://doi.org/10.1145/3488559

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free