Quantum computers have the potential to solve certain problems dramatically faster than classical computers.  One of the main quantum algorithmic tools is the notion of quantum walk, a quantum mechanical analog of random walk.  I will describe quantum algorithms based on this idea, including an optimal algorithm for evaluating Boolean formulas and the best known algorithm for simulating quantum systems.  I will also show how quantum walk can be viewed as a universal model of quantum computation.