Inverting a Permutation is as Hard as Unordered Search

by Ashwin Nayak

Theory of Computing, Volume 7(2), pp. 19-25, 2011

Bibliography with links to cited articles

[1]   Andris Ambainis: Quantum lower bounds by quantum arguments. J. Comput. System Sci., 64(4):750–767, 2002. [doi:10.1006/jcss.2002.1826]

[2]   Charles H. Bennett, Ethan Bernstein, Gilles Brassard, and Umesh Vazirani: Strengths and weaknesses of quantum computing. SIAM J. Comput., 26(5):1510–1523, 1997. [doi:10.1137/S0097539796300933]

[3]   Lov K. Grover: A fast quantum mechanical algorithm for database search. In Proc. 28th STOC, pp. 212–219. ACM Press, 1996. [doi:10.1145/237814.237866]

[4]   Phillip Kaye, Raymond Laflamme, and Michele Mosca: An Introduction to Quantum Computing. Oxford University Press, New York, NY, USA, 2007.