Local $\epsilon$-uniform mixing in continuous quantum walks
Hermie Monterde

TL;DR
This paper investigates conditions under which local $psilon$-uniform mixing occurs in continuous quantum walks on graphs, deriving necessary conditions and ruling out such mixing in many graph classes, especially non-regular ones.
Contribution
It provides new necessary conditions for local $psilon$-uniform mixing in graphs, including inequalities involving eigenvectors and bounds on vertex degree, and applies these to exclude mixing in various graph classes.
Findings
Most non-regular graphs do not admit local psilon-uniform mixing.
Almost all planar graphs and trees lack vertices with local psilon-uniform mixing.
Graphs with twin subgraphs must have large twin subgraphs to admit mixing.
Abstract
Let be a weighted graph and be its adjacency, Laplacian or signless Laplacian matrix. In a continuous quantum walk on , local -uniform mixing occurs at vertex if the th column of the matrix can be made arbitrarily close to a vector whose all entries have equal magnitude. Using the spectral and combinatorial properties of , we derive necessary conditions for local -uniform mixing to occur in . This includes an inequality involving all entries of each eigenvector of , as well as an upper bound on the degree of vertex when is the Laplacian or signless Laplacian matrix. We use these necessary conditions to rule out local -uniform mixing in numerous classes of graphs, most of which are non-regular. We also show that almost all planar graphs (resp., trees) contain a vertex that does not admit local…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Markov Chains and Monte Carlo Methods
