Title: Mixing in Discrete-Time Quantum Walks
|Affiliation:||University of Waterloo|
Discrete-time quantum walks are building blocks for quantum algorithms. There are some parameters of a quantum walk that affect the performance of a quantum algorithm, such as the (time-averaged) limiting distribution and the mixing time. In this talk, I will discuss some properties of the average mixing matrix of a discrete walk, and derive some bounds on the mixing time.