Many well-known randomized algorithms are based on Markov chain (i.e.,
random walk) simulation. In the last few years, several natural oracle
problems have been shown to have "quantum walk"-based quantum algorithms
which provably outperform any classical randomized algorithm. I will
explain what quantum walks are, how they have been used in algorithmic
applications thus far, and where else they might be applied
successfully.