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

  Browse A-Z

Log in

University Account External (via Google)

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹī¸ Information

Lecture 2 - Quantum walk and learning graph based algorithms (a tutorial)

Download to your calendar using vCal

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:

Note that ex-directory lists are not shown.

Other lists

Arch seminars Seminar time is 1pm BST in Room FW 11, Willam Gates Hall. Zoom link: https://cl-cam-ac-uk.zoom.us/j/4361570789?pwd=Nkl2T3ZLaTZwRm05bzRTOUUxY3Q4QT09&from=addon Meeting Rooms 1&2, MRC Epidemiology Unit, Level 3, Institute of Metabolic Science, Cambridge Biomedical Campus, Cambridge CB2 0QQ

Other talks

Title TBC Talk TBC Gastroenterology and Acute Medicine Title to be confirmed Title to be confirmed Fairy Tales
 

Š 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity