Search via Quantum Walk 2: Phase Estimation Repeated k Times on the Szegedy Walk W(P) Fixes |π⟩ and Reflects A + B ⊖ |π⟩ up to Error 2^{1−k}Research Paper
Many classical search algorithms are random walks: a Markov chain on a finite state space is run until it hits a marked state. Szegedy (2004) attached to every such chain a unitary quantum walk , and Magniez, Nayak, Roland and Santha (SIAM J. Comput. 2011, arXiv:quant-ph/0608026) used it to search quadratically faster than the classical walk for…