Sedentary quantum walks
Abstract
Let be a graph with adjacency matrix . The \textsl{continuous quantum walk} on is determined by the unitary matrices . If is the complete graph and , then In a sense, this means that a quantum walk on a complete graph stay home with high probability. In this paper we consider quantum walks on cones over an -regular graph on vertices. We prove that if as increases, than a quantum walk that starts on the apex of the cone will remain on it with probability tending to as increases. On the other hand, if we prove that there is a time such that local uniform mixing occurs, i.e., all vertices are equally likely. We investigate when a quantum walk on strongly regular graph has a high probability of "staying at home", producing large families of examples with the stay-at-home property where the valency is small compared to the number of vertices.
Cite
@article{arxiv.1710.11192,
title = {Sedentary quantum walks},
author = {Chris Godsil},
journal= {arXiv preprint arXiv:1710.11192},
year = {2017}
}
Comments
21 pages