Fetching the paper…
Reading the bibliography…
A quantum algorithm is exact if it always produces the correct answer, on any input.
Rapid solution of problems by quantum computation
D. Deutsch and R. Jozsa · 1992
Earlier work this paper cites.
On the degree of Boolean functions as real polynomials
N. Nisan and M. Szegedy · 1994
Earlier work this paper cites.
A fast quantum mechanical algorithm for database search
L. K. Grover · 1996
Earlier work this paper cites.
An exact quantum polynomial-time algorithm for Simon’s problem
G. Brassard and P. Høyer · 1997
Earlier work this paper cites.
Polynomials with two values
J. von zur Gathen and J. R. Roche · 1997
Earlier work this paper cites.
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
P. W. Shor · 1997
Earlier work this paper cites.
On the power of quantum computation
D. Simon · 1997
Cited alongside, same era.
Quantum algorithms revisited
R. Cleve, A. Eckert, C. Macchiavello, and M. Mosca · 1998
Cited alongside, same era.
A limit on the speed of quantum computation in determining parity
E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser · 1998
Cited alongside, same era.
Quantum Computation and Quantum Information
M. Nielsen and I. Chuang · 2000
Cited alongside, same era.
Quantum lower bounds by polynomials
R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. de Wolf · 2001
Cited alongside, same era.
Complexity measures and decision tree complexity: a survey
H. Buhrman and R. de Wolf · 2002
Cited alongside, same era.
A. Ambainis. Quantum walk algorithm for element distinctness. SIAM Journal on Computing
2007
Later among the works it cites.
E. Farhi, J. Goldstone, S. Gutman, A Quantum Algorithm for the Hamiltonian NAND Tree. Theory of Computing
2008
Later among the works it cites.
On exact quantum query complexity
A. Montanaro, R. Jozsa, G. Mitchison · 2011
Later among the works it cites.
Span programs for functions with constant-sized 1-certificates
A. Belovs · 2012
Later among the works it cites.
Superlinear advantage for exact quantum algorithms
A. Ambainis: · 2013
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited in the paper.