Open Problems Related to Quantum Query Complexity

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.

[1]  Scott Aaronson,et al.  BQP and the polynomial hierarchy , 2009, STOC '10.

[2]  Avishay Tal,et al.  Degree vs. approximate degree and Quantum implications of Huang’s sensitivity theorem , 2020, STOC.

[3]  Andris Ambainis,et al.  Separations in Query Complexity Based on Pointer Functions , 2017, J. ACM.

[4]  Gilles Brassard,et al.  Quantum Algorithm for the Collision Problem , 2016, Encyclopedia of Algorithms.

[5]  Bill Fefferman,et al.  Quantum vs Classical Proofs and Subset Verification , 2015, MFCS.

[6]  P. Hayden,et al.  Quantum computation vs. firewalls , 2013, 1301.4504.

[7]  John Preskill,et al.  Quantum Computing in the NISQ era and beyond , 2018, Quantum.

[8]  N. Bansal,et al.  k-forrelation optimally separates Quantum and classical query complexity , 2020, Electron. Colloquium Comput. Complex..

[9]  Scott Aaronson,et al.  Separations in query complexity using cheat sheets , 2015, Electron. Colloquium Comput. Complex..

[10]  Adi Shamir,et al.  IP = PSPACE , 1992, JACM.

[11]  Emanuel Knill,et al.  The quantum query complexity of the hidden subgroup problem is polynomial , 2004, Inf. Process. Lett..

[12]  Scott Aaronson,et al.  Quantum lower bound for the collision problem , 2001, STOC '02.

[13]  Xiaodi Wu,et al.  Limitations of Semidefinite Programs for Separable States and Entangled Games , 2016, Communications in Mathematical Physics.

[14]  Dorit Aharonov,et al.  The Quantum PCP Conjecture , 2013, ArXiv.

[15]  H. Buhrman,et al.  Complexity measures and decision tree complexity: a survey , 2002, Theor. Comput. Sci..

[16]  Greg Kuperberg,et al.  Quantum versus Classical Proofs and Advice , 2006, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

[17]  Travis S. Humble,et al.  Quantum supremacy using a programmable superconducting processor , 2019, Nature.

[18]  Gilles Brassard,et al.  Quantum cryptanalysis of hash and claw-free functions , 1997, SIGA.

[19]  Elad Eban,et al.  Interactive Proofs For Quantum Computations , 2017, 1704.04487.

[20]  Scott Aaronson,et al.  The Complexity of Quantum States and Transformations: From Quantum Money to Black Holes , 2016, Electron. Colloquium Comput. Complex..

[21]  Dorit Aharonov,et al.  Guest column: the quantum PCP conjecture , 2013, SIGA.

[22]  Scott Aaronson,et al.  Quantum lower bounds for the collision and the element distinctness problems , 2004, JACM.

[23]  Gilles Brassard,et al.  Strengths and Weaknesses of Quantum Computing , 1997, SIAM J. Comput..

[24]  Ronald de Wolf,et al.  Quantum lower bounds by polynomials , 2001, JACM.

[25]  Ben Reichardt,et al.  Reflections for quantum query algorithms , 2010, SODA '11.

[26]  Andris Ambainis,et al.  Quantum walk algorithm for element distinctness , 2003, 45th Annual IEEE Symposium on Foundations of Computer Science.

[27]  Umesh V. Vazirani,et al.  Quantum complexity theory , 1993, STOC.

[28]  D. Deutsch,et al.  Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.

[29]  Andris Ambainis.  Polynomial degree vs. quantum query complexity , 2006, J. Comput. Syst. Sci..

[30]  W. Marsden.  I and J , 2012 .

[31]  Shalev Ben-David.  A Super-Grover Separation Between Randomized and Quantum Query Complexities , 2015, Electron. Colloquium Comput. Complex..

[32]  Ran Raz,et al.  Oracle separation of BQP and PH , 2019, Electron. Colloquium Comput. Complex..

[33]  Bill Fefferman,et al.  The Power of Unentanglement , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.

[34]  Urmila Mahadev,et al.  Classical Verification of Quantum Computations , 2018, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

[35]  Stephen A. Fenner,et al.  A note on the classical lower bound for a quantum walk algorithm , 2003 .

[36]  Andrew Lutomirski.  Component mixers and a hardness result for counterfeiting quantum money , 2011 .

[37]  Haibin Zhang,et al.  Strong Quantum Computational Advantage Using a Superconducting Quantum Processor. , 2021, Physical review letters.

[38]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[39]  William Kretschmer.  The Quantum Supremacy Tsirelson Inequality , 2020, ArXiv.

[40]  Carsten Lund.  Power of interaction , 1992, ACM Distinguished dissertations.

[41]  Lance Fortnow,et al.  Are There Interactive Protocols for CO-NP Languages? , 1988, Inf. Process. Lett..

[42]  Daniel A. Spielman,et al.  Exponential algorithmic speedup by a quantum walk , 2002, STOC '03.

[43]  Dorit Aharonov,et al.  Quantum NP - A Survey , 2002, quant-ph/0210077.

[44]  Lov K. Grover.  A fast quantum mechanical algorithm for database search , 1996, STOC '96.

[45]  Elham Kashefi,et al.  Universal Blind Quantum Computation , 2008, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

[46]  Michael J. Bremner,et al.  Quantum sampling problems, BosonSampling and quantum supremacy , 2017, npj Quantum Information.

[47]  Hao Huang,et al.  Induced subgraphs of hypercubes and a proof of the Sensitivity Conjecture , 2019, Annals of Mathematics.

[48]  Avishay Tal,et al.  Towards Optimal Separations between Quantum and Randomized Query Complexities , 2019, 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS).

[49]  Scott Aaronson,et al.  Quantum Copy-Protection and Quantum Money , 2009, 2009 24th Annual IEEE Conference on Computational Complexity.

[50]  Hartmut Klauck,et al.  Quantum and classical strong direct product theorems and optimal time-space tradeoffs , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.