Speaker
Hanmeng Zhan
(Worcester Polytechnic Institute)
Description
A discrete quantum walk takes place on the arcs of a graph, and evolves according to a coin operator and a shift operator. One important task, given the underlying graph, is to construct quantum walks that start with a state localized at a vertex and get arbitrarily close to a state localized at another vertex. In this talk, I will show how different coin operators translate into different weightings of the underlying graph, and use the spectral properties of these weighted graphs to construct quantum walks that admit the aforementioned transport phenomenon.
Author
Hanmeng Zhan
(Worcester Polytechnic Institute)