Wednesday, October 9
11:00am – 11:50am
Olin Hall 218
Title: A Gentle Introduction to Discrete Quantum Walks
Abstract: Discrete quantum walks are building blocks for quantum computers and quantum algorithms. For example, Grover’s search algorithm can be seen as a discrete quantum walk on the complete graph with loops. In this talk, I will discuss basic models of discrete quantum walks, some desired phenomena including state transfer and mixing, and how linear algebra and graph theory can be used to study these properties