Coined discrete time quantum walk is a model of quantum computation and a discrete time dynamical system that has been extensively studied by the community. It is the quantum analog of the classical random walk. One of its most popular application is to search an element in an unstructured database. The way it works is similar to the well known Grover algorithm, and it presents similar results. There are however some behaviors that differentiate this quantum walk based search from a Grover search. Those differences encourage its use for structured searching in a graph. In this talk, I will first introduce quantum walks and quantum walk based search. Then, I will show how this can be extended to unstructured searching and distributed computing.
10:45
11:45
Room 178