ECCC-Report TR09-110https://eccc.weizmann.ac.il/report/2009/110Comments and Revisions published for TR09-110en-usThu, 06 Feb 2014 21:18:37 +0200
Revision 1
| The Need for Structure in Quantum Speedups |
Scott Aaronson,
Andris Ambainis
https://eccc.weizmann.ac.il/report/2009/110#revision1Is there a general theorem that tells us when we can hope for exponential speedups from quantum algorithms, and when we cannot? In this paper, we make two advances toward such a theorem, in the black-box model where most quantum algorithms operate.
First, we show that for any problem that is invariant under permuting inputs and outputs (like the collision or the element distinctness problems), the quantum query complexity is at least the 7th root of the classical randomized query complexity. (An earlier version of this paper gave the 9th root.) This resolves a conjecture of Watrous from 2002.
Second, inspired by recent work of O'Donnell et al. (2005) and Dinur et al. (2006), we conjecture that every bounded low-degree polynomial has a "highly influential" variable. Assuming this conjecture, we show that every T-query quantum algorithm can be simulated on most inputs by a poly(T)-query classical algorithm, and that one essentially cannot hope to prove P!=BQP relative to a random oracle.Thu, 06 Feb 2014 21:18:37 +0200https://eccc.weizmann.ac.il/report/2009/110#revision1
Paper TR09-110
| The Need for Structure in Quantum Speedups |
Scott Aaronson,
Andris Ambainis
https://eccc.weizmann.ac.il/report/2009/110Is there a general theorem that tells us when we can hope for exponential speedups from quantum algorithms, and when we cannot? In this paper, we make two advances toward such a theorem, in the black-box model where most quantum algorithms operate.
First, we show that for any problem that is invariant under permuting inputs and outputs (like the collision or the element distinctness problems), the quantum query complexity is at least the 9th root of the classical randomized query complexity. This resolves a conjecture of Watrous from 2002.
Second, inspired by recent work of O'Donnell et al. and Dinur et al., we conjecture that every bounded low-degree polynomial has a "highly influential" variable. Assuming this conjecture, we show that every T-query quantum algorithm can be simulated on most inputs by a poly(T)-query classical algorithm, and that one essentially cannot hope to prove P!=BQP relative to a random oracle.Thu, 05 Nov 2009 10:18:48 +0200https://eccc.weizmann.ac.il/report/2009/110