@inproceedings{b14983ad66e24543a2c94f1e9635cb91,
title = "Quantum random walks - New method for designing quantum algorithms",
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.",
author = "Andris Ambainis",
year = "2008",
doi = "10.1007/978-3-540-77566-9\_1",
language = "English",
isbn = "354077565X",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "1--4",
booktitle = "SOFSEM 2008",
address = "Germany",
note = "SOFSEM 2008 - 34th Conference on Current Trends in Theory and Practice of Computer Science ; Conference date: 19-01-2008 Through 25-01-2008",
}