Related papers: Quantum ergodicity on graphs
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 investigate the use of discrete-time quantum walks to sample from an almost-uniform distribution, in the absence of any external source of randomness. Integers are encoded on the vertices of a cycle graph, and a quantum walker evolves…
We present a new notion of limits of weighted directed graphs of growing size based on convergence of their random quotients. These limits are specified in terms of random exchangeable measures on the unit square. We call our limits…
Consider $M$, a bounded domain in ${\mathbb R}^d$, which is a Riemanian manifold with piecewise smooth boundary and suppose that the billiard associated to the geodesic flow reflecting on the boundary acording to the laws of geometric…
We investigate quantum circuits for graph representation learning, and propose equivariant quantum graph circuits (EQGCs), as a class of parameterized quantum circuits with strong relational inductive bias for learning over graph-structured…
We consider the Dirac equation on periodic networks (quantum graphs). The self-adjoint quasi periodic boundary conditions are derived. The secular equation allowing us to find the energy spectrum of the Dirac particles on periodic quantum…
We prove limit theorems for systems of interacting diffusions on sparse graphs. For example, we deduce a hydrodynamic limit and the propagation of chaos property for the stochastic Kuramoto model with interactions determined by…
Building upon the theory of graph limits and the Aldous-Hoover representation and inspired by Panchenko's work on asymptotic Gibbs measures (Annals of Probability 2013), we construct continuous embeddings of discrete probability…
The study of graph C*-algebras has a long history in operator algebras. Surprisingly, their quantum symmetries have never been computed so far. We close this gap by proving that the quantum automorphism group of a finite, directed graph…
The problems of computing eccentricity, radius, and diameter are fundamental to graph theory. These parameters are intrinsically defined based on the distance metric of the graph. In this work, we propose quantum algorithms for the diameter…
Theoretical research into many-body quantum systems has mostly focused on regular structures which have a small, simple unit cell and where a vanishingly small number of pairs of the constituents directly interact. Motivated by advances in…
Energy level statistics of quantized chaotic systems have been evaluated in the semiclassical limit via their periodic orbits using the Gutzwiller and related trace formulae. Here we evaluate a spectral statistic of chaotic 4-regular…
We present quantum algorithms for various problems related to graph connectivity. We give simple and query-optimal algorithms for cycle detection and odd-length cycle detection (bipartiteness) using a reduction to st-connectivity.…
Using the theory of $L^p$-graphons (Borgs et al, 2014), we derive and rigorously justify the continuum limit for systems of differential equations on sparse random graphs. Specifically, we show that the solutions of the initial value…
We derive the limiting distribution for the largest eigenvalues of the adjacency matrix for a stochastic blockmodel graph when the number of vertices tends to infinity. We show that, in the limit, these eigenvalues are jointly multivariate…
Non-equilibrium steady states of quantum fields on star graphs are explicitly constructed. These states are parametrized by the temperature and the chemical potential, associated with each edge of the graph. Time reversal invariance is…
We consider a one-dimensional XX spin chain in a nonequilibrium setting with a Lindblad-type boundary driving. By calculating large deviation rate function in the thermodynamic limit, being a generalization of free energy to a…
We explore the limiting empirical eigenvalue distributions arising from matrices of the form \[A_{n+1} = \begin{bmatrix} A_n & I\\ I & A_n \end{bmatrix} , \]where $A_0$ is the adjacency matrix of a $k$-regular graph. We find that for…
Let $(G_\epsilon)_{\epsilon>0}$ be a family of '$\epsilon$-thin' Riemannian manifolds modeled on a finite metric graph $G$, for example, the $\epsilon$-neighborhood of an embedding of $G$ in some Euclidean space with straight edges. We…
We study the statistical distribution of components in the non-perturbative parts of energy eigenfunctions (EFs), in which main bodies of the EFs lie. Our numerical simulations in five models show that deviation of the distribution from the…