2008/08/01 by Miklos Santha · 2 citations
Physics and Astronomy · Computer Science · #quant-ph #cs.CC
published as 5th Theory and Applications of Models of Computation (TAMC08), Xian, April 2008, LNCS 4978, 31-46 · 16 pages, survey paper
arxiv created 2008/08/01 · arxiv updated 2009/12/01
In this survey paper we give an intuitive treatment of the discrete time quantization of classical Markov chains. Grover search and the quantum walk based search algorithms of Ambainis, Szegedy and Magniez et al. will be stated as quantum analogues of classical search procedures. We present a rather detailed description of a somewhat simplified version of the MNRS algorithm. Finally, in the query complexity model, we show how quantum walks can be applied to the following search problems: Element Distinctness, Matrix Product Verification, Restricted Range Associativity, Triangle, and Group Commutativity.