2000 character limit reached
Diagonal entries of the average mixing matrix
Published 4 Oct 2019 in math.CO and quant-ph | (1910.02039v1)
Abstract: We study the diagonal entries of the average mixing matrix of continuous quantum walks. The average mixing matrix is a graph invariant; it is the sum of the Schur squares of spectral idempotents of the Hamiltonian. It is non-negative, doubly stochastic and positive semi-definite. We investigate the diagonal entries of this matrix. We study the graphs for which the trace of the average mixing matrix is maximum or minimum and we classify those which are maximum. We give two constructions of graphs whose average mixing matrices have constant diagonal.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.