Lecture 1 - Quantum walk and learning graph based algorithms (a tutorial)
- ๐ค Speaker: Santha, M (Universit Paris 7 - Denis-Diderot)
- ๐ Date & Time: Thursday 05 September 2013, 15:30 - 16:30
- ๐ Venue: Seminar Room 1, Newton Institute
Abstract
In this talk I survey two generic methods to design quantum algorithms. I give an intuitive treatment of the discrete time quantization of classical Markov chains, and I describe nested walks, an extension of the model using quantum data structures. I explain the relatively recent idea of learning graphs, a combinatorial way to conceive quantum query algorithms. With several examples, including triangle and 3-collision finding, I illustrate the power of these methods. Finally I discuss time efficient implementations of learning graphs by quantum walks.
Series This talk is part of the Isaac Newton Institute Seminar Series series.
Included in Lists
- All CMS events
- bld31
- dh539
- Featured lists
- INI info aggregator
- Isaac Newton Institute Seminar Series
- School of Physical Sciences
- Seminar Room 1, Newton Institute
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)


Thursday 05 September 2013, 15:30-16:30