Fetching the paper…
Reading the bibliography…
We achieve essentially the largest possible separation between quantum and classical query complexities.
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
P. W. Shor · 1994
Earlier work this paper cites.
On the power of quantum computation
D. Simon · 1994
Earlier work this paper cites.
Strengths and weaknesses of quantum computing
C. Bennett, E. Bernstein, G. Brassard, and U. Vazirani · 1997
Earlier work this paper cites.
Quantum lower bounds by polynomials
R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf · 1998
Earlier work this paper cites.
The query complexity of order-finding
R. Cleve · 2000
Earlier work this paper cites.
Fast parallel circuits for the quantum Fourier transform
R. Cleve and J. Watrous · 2000
Earlier work this paper cites.
Quantum Computation and Quantum Information
M. Nielsen and I. Chuang · 2000
Earlier work this paper cites.
Sharp quantum versus classical query complexity separations
J. N. de Beaudrap, R. Cleve, and J. Watrous · 2002
Earlier work this paper cites.
Complexity measures and decision tree complexity: a survey
H. Buhrman and R. de Wolf · 2002
Cited alongside, same era.
Both Toffoli and controlled-NOT need little help to do universal quantum computation
Y. Shi · 2002
Cited alongside, same era.
Polynomial degree vs. quantum query complexity
A. Ambainis · 2003
Cited alongside, same era.
Quantum property testing
H. Buhrman, L. Fortnow, I. Newman, and H. Röhrig · 2003
Cited alongside, same era.
Exponential algorithmic speedup by a quantum walk
A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, and D. A. Spielman · 2003
Cited alongside, same era.
A note on the classical lower bound for a quantum walk algorithm
S. Fenner and Y. Zhang · 2003
Cited alongside, same era.
BQP and the polynomial hierarchy
S. Aaronson · 2010
Later among the works it cites.
New results on quantum property testing
S. Chakraborty, E. Fischer, A. Matsliah, and R. de Wolf · 2010
Later among the works it cites.
The equivalence of sampling and searching
S. Aaronson · 2011
Later among the works it cites.
Improved direct product theorems for randomized query complexity
A. Drucker · 2011
Later among the works it cites.
Reflections for quantum query algorithms
B. Reichardt · 2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Improved simulation of stabilizer circuits
S. Aaronson and D. Gottesman · 2004
Cited alongside, same era.
On the Fourier tails of bounded functions over the discrete cube
I. Dinur, E. Friedgut, G. Kindler, and R. O’Donnell · 2006
Cited alongside, same era.
O. Shamir · 2011
Later among the works it cites.
A survey of quantum property testing
A. Montanaro and R. de Wolf · 2013
Later among the works it cites.