Miklos Santha, Mario Szegedy. Quantum and classical query complexities of local search are polynomially related. In László Babai, editor, Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, IL, USA, June 13-16, 2004. pages 494-501, ACM, 2004. [doi]
Abstract is missing.