Quantum walk search algorithm
{"Image DocumentName": "Quantum walk search algorithm", "Image ImageDescription": "Consider the unstructured search problem: given a function f(x) = { 1 if x = a, 0 otherwise } find the marked element a, where 0 \uf0a3 a \uf0a3 2n-1. Grover\u2019s algorithm can solve this in O(2n/2) queries on a quantum computer, whereas a classical computer needs at least W(2n) queries. Can we produce a quantum walk algorithm that requires the same (optimal) number of queries? this may be easier to implement, or provide a better model for searching a real database.", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}