COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. |

University of Cambridge > Talks.cam > Isaac Newton Institute Seminar Series > Lecture 2 - Quantum walk and learning graph based algorithms (a tutorial)

## Lecture 2 - Quantum walk and learning graph based algorithms (a tutorial)Add to your list(s) Download to your calendar using vCal - Santha, M (Universit Paris 7 - Denis-Diderot)
- Friday 06 September 2013, 10:00-11:00
- Seminar Room 1, Newton Institute.
If you have a question about this talk, please contact Mustapha Amrani. Mathematical Challenges in Quantum Information 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. This talk is part of the Isaac Newton Institute Seminar Series series. ## This talk is included in these lists:- All CMS events
- Featured lists
- INI info aggregator
- Isaac Newton Institute Seminar Series
- School of Physical Sciences
- Seminar Room 1, Newton Institute
- bld31
Note that ex-directory lists are not shown. |
## Other listsMurray Edwards College Lees Knowles Lectures Cambridge UCU## Other talksReal Time Tomography X-Ray Imaging System - Geometry Calibration by Optimisation Cafe Synthetique- AI and Automation: Revolutionising Biology National crises, viewed in the light of personal crises Type I IFN induces CXCL13-driven B cell recruitment to the lung to enable tertiary GC formation Oncological imaging: introduction and non-radionuclide techniques Joinings of higher rank diagonalizable actions |