RESUMO:We will discuss quantum walks, which are a fundamental concept in quantum algorithms with various experimental implementations. The focus here will be on the physics of Grover's quantum search algorithm. As a discrete-time quantum transport problem, we will discuss its properties in comparison with classical random walks (i.e., diffusion) and highlight some of its distinctly quantum features, such as localization.