Abstract
Quantum walks are quantum counterparts of random walks. In the last 5 years, they have become one of main methods of designing quantum algorithms. Quantum walk based algorithms include element distinctness, spatial search, quantum speedup of Markov chains, evaluation of Boolean formulas and search on "glued trees" graph. In this talk, I will describe the quantum walk method for designing search algorithms and show several of its applications. © Springer-Verlag Berlin Heidelberg 2008.
Cite
CITATION STYLE
Ambainis, A. (2008). Quantum random walks - New method for designing quantum algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4910 LNCS, pp. 1–4). Springer Verlag. https://doi.org/10.1007/978-3-540-77566-9_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
