Sedentary quantum walks

From MaRDI portal



Abstract: Let X be a graph with adjacency matrix A. The extsl{continuous quantum walk} on X is determined by the unitary matrices U(t)=exp(itA). If X is the complete graph Kn and ainV(X), then [1-|U(t)_{a,a}|le2/n. ] 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 ell-regular graph on n vertices. We prove that if ell2/noinfty as n increases, than a quantum walk that starts on the apex of the cone will remain on it with probability tending to 1 as n increases. On the other hand, if ellle2 we prove that there is a time t 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.












This page was built for publication: Sedentary quantum walks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229498)