4 papers · 1 filter
Laziness of Quantum Walks on Graphs
Amulya Mohan, Christino Tamon, Yichi Xu +1
The trace of the average mixing matrix of a quantum walk measures the "laziness" of the walk: the higher the trace, the more likely that the walker returns home in the long run. In…
Uniform Mixing in Chiral Quantum Walks
Luke Levine, Jessy Jacob Mesapam, Benjamin Mustico +3
This paper studies uniform mixing in continuous-time quantum walks. We show that for some unitary signing , the complete graph has probabilistic uniform mixing. In contr…
Discrete Quantum Walks with Marked Vertices and Their Average Vertex Mixing Matrices
Amulya Mohan, Hanmeng Zhan
We study the discrete quantum walk on a regular graph that assigns negative identity coins to marked vertices and Grover coins to the unmarked ones. We find combinatorial b…
-Uniform Mixing in Discrete Quantum Walks
Hanmeng Zhan
We study whether the probability distribution of a discrete quantum walk can get arbitrarily close to uniform, given that the walk starts with a uniform superposition of the outgoi…