Circulant graphs as an example of discrete quantum unique ergodicity

A discrete analog of quantum unique ergodicity was proved for Cayley graphs of quasirandom groups by Magee, Thomas and Zhao. They show that for large graphs there exist real orthonormal basis of eigenfunctions of the adjacency matrix such that quantum probability measures of the eigenfunctions put approximately the correct proportion of their mass on subsets of the vertices that are not too small. We investigate this property for Cayley graphs of cyclic groups (circulant graphs). We observe that there exist sequences of orthonormal eigenfunction bases which are perfectly equidistributed. However, for sequences of 4-regular circulant graphs of prime order, we show that there are no sequences of real orthonormal bases where all sequences of eigenfunctions equidistribute. To obtain this result, we also prove that, for large 4-regular circulant graphs of prime order, the maximum multiplicity of the eigenvalues of the adjacency matrix is two.
Comment: 11 pages, 1 figure