English

Sedentary quantum walks

Combinatorics 2017-11-01 v1

Abstract

Let XX be a graph with adjacency matrix AA. The \textsl{continuous quantum walk} on XX is determined by the unitary matrices U(t)=exp(itA)U(t)=\exp(itA). If XX is the complete graph KnK_n and aV(X)a\in V(X), then 1U(t)a,a2/n.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 nn vertices. We prove that if 2/n\ell^2/n\to\infty as nn increases, than a quantum walk that starts on the apex of the cone will remain on it with probability tending to 11 as nn increases. On the other hand, if 2\ell\le2 we prove that there is a time tt 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.

Keywords

Cite

@article{arxiv.1710.11192,
  title  = {Sedentary quantum walks},
  author = {Chris Godsil},
  journal= {arXiv preprint arXiv:1710.11192},
  year   = {2017}
}

Comments

21 pages

R2 v1 2026-06-22T22:30:25.454Z