Related papers: Quantum ergodicity on large graphs

We perform an extensive investigation of the localization properties of the eigenmodes of the Laplace and adjacency matrix for one-dimensional random geometric graphs. We evaluate the density of states, the probability distribution of the…

In this paper, we study Grover's search algorithm focusing on continuous-time quantum walk on graphs. We propose an alternative optimization approach to Grover's algorithm on graphs that can be summarized as follows: instead of finding…

The exponential speed-up of quantum walks on certain graphs, relative to classical particles diffusing on the same graph, is a striking observation. It has suggested the possibility of new fast quantum algorithms. We point out here that…

It is known that up to certain pathologies, a compact metric graph with standard vertex conditions has a Baire-generic set of choices of edge lengths such that all Laplacian eigenvalues are simple and have eigenfunctions that do not vanish…

We prove upper bounds on the $L^p$ norms of eigenfunctions of the discrete Laplacian on regular graphs. We then apply these ideas to study the $L^p$ norms of joint eigenfunctions of the Laplacian and an averaging operator over a finite…

Derandomization is the process of taking a randomized algorithm and turning it into a deterministic algorithm, which has attracted great attention in classical computing. In quantum computing, it is challenging and intriguing to derandomize…

We investigate statistical properties of the eigenfunctions of the Schrodinger operator on families of star graphs with incommensurate bond lengths. We show that these eigenfunctions are not quantum ergodic in the limit as the number of…

We propose a multi-scale diagonalization scheme to study disordered one-dimensional chains, in particular the transition between many-body localization (MBL) and the ergodic phase, expected to be governed by resonant spots. Our scheme…

Motivated by problems of mathematical physics (quantum chaos) questions of equidistribution of eigenfunctions of the Laplace operator on a Riemannian manifold have been studied by several authors. We consider here, in analogy with…

We consider the quantum version of Arnold's generalisation of a rigid body in classical mechanics. Thus, we quantise the motion on an arbitrary Lie group manifold of a particle whose classical trajectories correspond to the geodesics of any…

Rotations on the circle by irrational numbers give rise to uniquely ergodic Sturm dynamical systems. We show that rotations by badly approximable irrationals have the property of fast ergodicity. It was shown recently that any Sturmian…

In this paper we study Lipschitz regularity of elliptic PDEs on geometric graphs, constructed from random data points. The data points are sampled from a distribution supported on a smooth manifold. The family of equations that we study…

The lackadaisical quantum walk is a quantum analogue of the lazy random walk obtained by adding a self-loop to each vertex in the graph. We analytically prove that lackadaisical quantum walks can find a unique marked vertex on any regular…

We investigate the quantum dynamics of particles on graphs ("quantum random walks"), with the aim of developing quantum algorithms for determining if two graphs are isomorphic (related to each other by a relabeling of vertices). We focus on…

We discuss Laplacian spectrum on a finite metric graph with vertex couplings violating the time-reversal invariance. For the class of star graphs we determine, under the condition of a fixed total edge length, the configurations for which…

In this work, we construct and quantify asymptotically in the limit of large mass a variety of edge-localized stationary states of the focusing nonlinear Schr\"odinger equation on a quantum graph. The method is applicable to general bounded…

A random-walk Metropolis sampler is geometrically ergodic if its equilibrium density is super-exponentially light and satisfies a curvature condition [Stochastic Process. Appl. 85 (2000) 341-361]. Many applications, including Bayesian…

We study homogenization properties of the discrete Laplace operator with random conductances on a large domain in $\mathbb{Z}^d$. More precisely, we prove almost-sure homogenization of the discrete Poisson equation and of the top of the…

We prove improved bounds on how localized an eigenvector of a high girth regular graph can be, and present examples showing that these bounds are close to sharp. This study was initiated by Brooks and Lindenstrauss (2009) who relied on the…

Ergodic theory provides a rigorous mathematical description of chaos in classical dynamical systems, including a formal definition of the ergodic hierarchy. How ergodic dynamics is reflected in the energy levels and eigenstates of a quantum…