Hangmeng (Harmony) Zhan

A discrete quantum walk usually takes place on the arcs of a graph. Each step of the walk consists of two operations - a "coin flip" and an "arc shift". In this talk, we will consider quantum walks where the "arc shift" simply reverses each arc...

Discrete quantum walks are motivated by search problems. One of the best known quantum algorithms, Grover’s search, is a discrete quantum walk on the complete graph with loops. From an algebraic perspective, a discrete quantum walk is determined by a...

We will characterize members that maximize/minimize the second largest adjacency eigenvalue in certain families of trees. Joint work with H. Kumar, B. Mohar and S. Pragada.