Another subexponential-time quantum algorithm for the dihedral hidden subgroup problem

Built on

W. Paul and R. Reischuk, On time versus space. II , J. Comput. System Sci. 22
1981
Earlier work this paper cites.
Michael C. Loui and David R. Luginbuhl, Optimal on-line simulations of tree machines by random access machines , SIAM J. Comput. 21
1992
Earlier work this paper cites.
Miklós Ajtai, Ravi Kumar, and Dandapani Sivakumar, A sieve algorithm for the shortest lattice vector problem , Proceedings of the thirty-third annual ACM symposium on Theory of computing, 2001, pp. 601–610
2001
Earlier work this paper cites.

Michelangelo Grigni, Leonard J. Schulman, Monica Vazirani, and Umesh V. Vazirani, Quantum mechanical algorithms for the nonabelian hidden subgroup problem , ACM Symposium on Theory of Computing, 2001, pp. 68–74
2001
Cited alongside, same era.
Greg Kuperberg, A subexponential-time quantum algorithm for the dihedral hidden subgroup problem , SIAM J. Comput. 35
2005
Cited alongside, same era.
Gilles Brassard, Peter Høyer, and Alain Tapp, Quantum algorithm for the collision problem , eprint arXiv:quant-ph/9705002
Cited in the paper.
Andrew M. Childs, David Jao, and Vladimir Soukharev, Constructing elliptic curve isogenies in quantum subexponential time , eprint arXiv:1012.4019
Original
Cited in the paper.
Oded Regev, A subexponential time algorithm for the dihedral hidden subgroup problem with polynomial space , eprint arXiv:quant-ph/0406151
Cited in the paper.

Andris Ambainis, Quantum walk algorithm for element distinctness , SIAM J. Comput. 37
2007
Later among the works it cites.
Vittorio Giovannetti, Seth Lloyd, and Lorenzo Maccone, Architectures for a quantum random access memory , Phys. Rev. A 78
Original
2008
Later among the works it cites.