Quantum walks
Seminar author:Mark Hillery
Event date and time:04/27/2016 02:30:pm
Event location:GIQ seminar room
Event contact:
A quantum walk is a quantum version of a classical random walk. The walk can take place on a line or on a more general structure, a graph. There are three different versions of quantum walks, coined walks and scattering walks, both of which are discrete-time walks, and continuous-time walks. Quantum walks have proven useful in search problems, where the task is to find a particular, marked vertex in a graph, and a quantum walk can find such a vertex with a quantum speedup. It is also possible to find more general structures in a graph, for example, a clique (complete subgraph) or where two graphs are connected. Progress has been made on finding the conditions that determine whether a particular subgraph in a larger graph can be found with a quantum speedup.