05C50 Online Seminar: Hanmeng (Harmony) Zhan
Topic
Epsilon-uniform mixing on strongly regular graphs via coined quantum walks
Speakers
Details
Many quantum search algorithms are equivalent to coined quantum walks that start from a uniform superposition of arcs and get very close to a state that "concentrates on" some marked vertex. In this talk, we consider a related problem: if we start from a state that concentrates on a vertex, can the probability distribution get arbitrarily close to uniform over all arcs? We study this phenomenon on quantum walks where no vertices are marked. Using algebraic properties of graphs, we completely classify all strongly regular graphs on which this happens.
Additional Information
The 05C50 Online is an international seminar about graphs and matrices held twice a month on Fridays.
Time: 8AM Pacific/10AM Central
For more information, visit https://sites.google.com/view/05c50online/home.
If you would like to attend, please register using this form to receive the zoom links: https://docs.google.com/forms/d/e/1FAIpQLSdQ98fh58cgeSWzbFe3t77i28FXDck1gYuX9jv_qd4kEf5l_Q/viewform?usp=sf_link