Related papers: Quantum ergodicity on large graphs
We prove a variety of quantum unique ergodicity results for Eisenstein series in the level aspect. A new feature of this variant of QUE is that the main term involves the logarithmic derivative of a Dirichlet $L$-function on the $1$-line. A…
The study of quantum evolution on graphs for diversified topologies is beneficial to modeling various realistic systems. A systematic method, the dimerized decomposition, is proposed to analyze the dynamics on an arbitrary network. By…
We study a general class of random walks driven by a uniquely ergodic Markovian environment. Under a coupling condition on the environment we obtain strong ergodicity properties and concentration inequalities for the environment as seen…
We show that a sufficiently large graph of bounded degree can be decomposed into quasi-homogeneous pieces. The result can be viewed as a "finitarization" of the classical Farrell-Varadarajan Ergodic Decomposition Theorem.
A continuous-time quantum walk is modelled using a graph. In this short paper, we provide lower bounds on the size of a graph that would allow for some quantum phenomena to occur. Among other things, we show that, in the adjacency matrix…
Consider a sequence of independent random isometries of Euclidean space with a previously fixed probability law. Apply these isometries successively to the origin and consider the sequence of random points that we obtain this way. We prove…
We show that any two Hadamard graphs on the same number of vertices are quantum isomorphic. This follows from a more general recipe for showing quantum isomorphism of graphs arising from certain association schemes. The main result is built…
A 3d generally covariant field theory having some unusual properties is described. The theory has a degenerate 3-metric which effectively makes it a 2d field theory in disguise. For 2-manifolds without boundary, it has an infinite number of…
As shown in [15], under some structural assumptions, working on congested traffic problems in general and increasingly dense networks leads, at the limit by {\Gamma}-convergence, to continuous minimization problems posed on measures on…
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the submanifold. The graph Laplacian of such a graph is used in…
We construct an equivariant microlocal lift for locally symmetric spaces. In other words, we demonstrate how to lift, in a ``semi-canonical'' fashion, limits of eigenfunction measures on locally symmetric spaces to Cartan-invariant measures…
The graph isomorphism problem asks whether two graphs are identical up to vertex relabeling. While the exact problem admits quasi-polynomial-time classical algorithms, many applications in molecular comparison, noisy network analysis, and…
Given the extensive application of classical random walks to classical algorithms in a variety of fields, their quantum analogue in quantum walks is expected to provide a fruitful source of quantum algorithms. So far, however, such…
We prove a microlocal lower bound on the mass of high energy eigenfunctions of the Laplacian on compact surfaces of negative curvature, and more generally on surfaces with Anosov geodesic flows. This implies controllability for the…
Quantum computing promises to improve the information processing power to levels unreachable by classical computation. Quantum walks are heading the development of quantum algorithms for searching information on graphs more efficiently than…
We consider Gaussian Laplace eigenfunctions on the two-dimensional flat torus (arithmetic random waves), and provide explicit Berry-Esseen bounds in the 1-Wasserstein distance for the normal and non-normal high-energy approximation of the…
We study randomly coloured graphs embedded into Euclidean space, whose vertex sets are infinite, uniformly discrete subsets of finite local complexity. We construct the appropriate ergodic dynamical systems, explicitly characterise ergodic…
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 investigate a tight binding quantum walk on a graph. Repeated stroboscopic measurements of the position of the particle yield a measured "trajectory", and a combination of classical and quantum mechanical properties for the walk are…
The main result is Corollary 2.9 which provides upper bounds on, and even better, approximates the largest non-trivial eigenvalue in absolute value of real constant row-sum matrices by the use of vector norm based ergodicity coefficients…