Fetching the paper…
Reading the bibliography…
Grover's quantum search and its generalization, quantum amplitude amplification, provide quadratic advantage over classical algorithms for a diverse set of tasks, but are tricky to use without knowing beforehand what fraction $\lambda$ of the initial state is comprised of the target states.
C. Dolph, Proceedings of the IRE 34
1946
Earlier work this paper cites.
F. J. Harris, Proceedings of the IEEE 66
1978
Earlier work this paper cites.
T. J. Rivlin, Chebyshev Polynomials: From Approximation Theory to Algebra and Number Theory (Wiley, New York, NY, 1990), 2nd ed
1990
Earlier work this paper cites.
L. K. Grover, in Proceedings of the twenty-eighth annual ACM symposium on Theory of computing (ACM, New York, NY, 1996), pp. 212–219
1996
Earlier work this paper cites.
C. Durr and P. Høyer, arXiv preprint quant-ph/9607014 (1996)
1996
Earlier work this paper cites.
C. H. Bennett, E. Bernstein, G. Brassard, and U. Vazirani, SIAM journal on Computing 26
1997
Earlier work this paper cites.
G. Brassard, Science 275
1997
Earlier work this paper cites.
G. Brassard, P. Høyer, and A. Tapp, arXiv preprint quant-ph/9705002 (1997)
1997
Earlier work this paper cites.
D. Aharonov, arXiv preprint quant-ph/9812037 (1998)
1998
Earlier work this paper cites.
M. Boyer, G. Brassard, P. Høyer, and A. Tapp, Fortschritte der Physik 46
1998
Earlier work this paper cites.
G. Brassard, P. Høyer, and A. Tapp, in Automata, Languages and Programming (Springer, New York, NY, 1998), pp. 820–831
1998
Cited alongside, same era.
G. L. Long, Y. S. Li, W. L. Zhang, and L. Niu, Physics Letters A 262
1999
Cited alongside, same era.
G. Brassard, P. Høyer, M. Mosca, and A. Tapp, arXiv preprint quant-ph/0005055 (2000)
2000
Cited alongside, same era.
P. Høyer, Physical Review A 62
2000
Cited alongside, same era.
R. Beals, H. Buhrman, R. Cleve, M. Mosca, and R. De Wolf, Journal of the ACM (JACM) 48
2001
Cited alongside, same era.
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, UK, 2004), 1st ed
2004
Cited alongside, same era.
B. W. Reichardt and L. K. Grover, Physical Review A 72
2005
Later among the works it cites.
L. K. Grover, A. Patel, and T. Tulsi, arXiv preprint quant-ph/0603132 (2006)
2006
Later among the works it cites.
S. Aaronson, SIAM Journal on Computing 35
2006
Later among the works it cites.
P. Li and S. Li, Physics Letters A 366
2007
Later among the works it cites.
F. M. Toyama, S. Kasai, W. van Dijk, and Y. Nogami, Phys. Rev. A 79
2009
Later among the works it cites.
A. T. Benjamin and D. Walton, Mathematics Magazine 82
2009
Later among the works it cites.
J. Merrill and K. R. Brown, arXiv preprint arXiv:1203.6392 (2012)
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A. Ambainis, ACM SIGACT News 35
2004
Cited alongside, same era.
L. K. Grover, Phys. Rev. Lett. 95
2005
Cited alongside, same era.
S. Chakraborty, J. Radhakrishnan, and N. Raghunathan, in Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques (Springer, New York, NY, 2005), pp. 245–256
2005
Cited alongside, same era.
S. Bravyi and A. Kitaev, Physical Review A 71
2005
Cited alongside, same era.
2012
Later among the works it cites.
M. Saeedi and M. Pedram, Physical Review A 87
2013
Later among the works it cites.
J. A. Jones, Physics Letters A 377
2013
Later among the works it cites.
M. Ozols, M. Roetteler, and J. Roland, ACM Transactions on Computation Theory (TOCT) 5
2013
Later among the works it cites.