BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Lecture 1 - Quantum walk and learning graph based algorithms (a tu
 torial) - Santha\, M (Universit Paris 7 - Denis-Diderot)
DTSTART:20130905T143000Z
DTEND:20130905T153000Z
UID:TALK46967@talks.cam.ac.uk
CONTACT:Mustapha Amrani
DESCRIPTION:In this talk I survey two generic methods to design quantum al
 gorithms. 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 al
 gorithms. With several examples\, including triangle and 3-collision findi
 ng\, I illustrate the power of these methods. Finally I discuss time effic
 ient implementations of learning graphs by quantum walks.\n
LOCATION:Seminar Room 1\, Newton Institute
END:VEVENT
END:VCALENDAR