Qalgo 7.2: Finding a marked vertex with a random walk

We continue to talk about using random walks to solve a search problem on a graph. We look at the complexity of this algorithm in terms of the setup, update, and checking cost. Finally we talk about an application of this framework to solving the element distinctness problem. In the classical case this application is not very interesting, but it will motivate the quantum walk setting that we talk about in the next video.