Related papers: Quantum mixing on large Schreier graphs

In this work, we study some statistical properties of the extreme eigenstates of the randomly-weighted adjacency matrices of random graphs. We focus on two random graph models: Erd\H{o}s-R\'{e}nyi (ER) graphs and random geometric graphs…

We study the eigenvector mass distribution for generalized Wigner matrices on a set of coordinates $I$, where $N^\varepsilon \le | I | \le N^{1- \varepsilon}$, and prove it converges to a Gaussian at every energy level, including the edge,…

We give a new rapid mixing result for a natural random walk on the independent sets of a graph $G$. We show that when $G$ has bounded treewidth, this random walk -- known as the Glauber dynamics for the hardcore model -- mixes rapidly for…

Let $G$ be a simple finite graph, and let $\mathcal U_G$ be the related quantum graph. We study the game algebra $C(\mathrm{Qut}(\mathcal U_G))$ of quantum automorphism of $\mathcal U_G$. Moreover, we prove that for any graph $G$ with…

We investigate graphs that can be disconnected into small components by removing a vanishingly small fraction of their vertices. We show that when a quantum network is described by such a graph, the network is efficiently controllable, in…

We prove a homology vanishing theorem for graphs with positive Bakry-\'Emery curvature, analogous to a classic result of Bochner on manifolds \cite{Bochner}. Specifically, we prove that if a graph has positive curvature at every vertex,…

Irreversibility is introduced to quantum graphs by coupling the graphs to a bath of harmonic oscillators. The interaction which is linear in the harmonic oscillator amplitudes is localized at the vertices. It is shown that for sufficiently…

For every infinite sequence $\omega=x_1,x_2,...$, with $x_i\in\{0,1\}$, we construct an infinite 4-regular graph $X_{\omega}$. These graphs are precisely the Schreier graphs of the action of a certain self-similar group on the space…

We derive a sharp criterion on the spectra of periodic discrete Schr\"odinger operators acting on connected periodic lattices: the measure of the spectrum goes to zero as the coupling constant goes to infinity if and only if there is no…

This undergraduate thesis is concerned with developing the tools of differential geometry and semiclassical analysis needed to understand the the quantum ergodicity theorem of Schnirelman (1974), Zelditch (1987), and Colin de Verdi\`ere…

We study the spectra of quantum graphs with the method of trace identities (sum rules), which are used to derive inequalities of Lieb-Thirring, Payne-P\'olya-Weinberger, and Yang types, among others. We show that the sharp constants of…

Spectral embedding of graphs uses the top k non-trivial eigenvectors of the random walk matrix to embed the graph into R^k. The primary use of this embedding has been for practical spectral clustering algorithms [SM00,NJW02]. Recently,…

We show that the exclusivity (E) principle singles out the set of quantum correlations associated to any exclusivity graph assuming the set of quantum correlations for the complementary graph. Moreover, we prove that, for self-complementary…

In this paper, we present a method to obtain regular (or equitable) partitions of Cayley (di)graphs (that is, graphs, digraphs, or mixed graphs) of permutation groups on $n$ letters. We prove that every partition of the number $n$ gives…

This paper studies uniform mixing in continuous-time quantum walks. We show that for some unitary signing $\sigma$, the complete graph $K^\sigma_n$ has probabilistic uniform mixing. In contrast, Ahmadi \etal (2003) proved that no complete…

We study the point spectrum of a periodic quantum tree equipped with a Schr\"odinger type differential operator with delta-type vertex conditions, using subsets of the compact graph that generates the tree. We prove analogs of existing…

Consider two quantum graphs with the standard Laplace operator and non-Robin type boundary conditions at all vertices. We show that if their eigenvalue-spectra agree everywhere aside from a sufficiently sparse set, then the…

Applying Stein's method, an inductive technique and size bias coupling yields a Berry-Esseen theorem for normal approximation without the usual restriction that the coupling be bounded. The theorem is applied to counting the number of…

We extend Friedman's theorem to show that, for any fixed $r>1$, a random $2r$--regular Schreier graph associated with the action of $r$ uniformly random permutations of $[n]$ on $k_{n}$--tuples of distinct elements in $[n]$ has a…

We present an efficient quantum algorithm for some independent set problems in graph theory, based on non-abelian adiabatic mixing. We illustrate the performance of our algorithm with analysis and numerical calculations for two different…