Related papers: Quantum ergodicity for quantum graphs without back…
We prove a quantum ergodicity theorem for sequences of closed hyperbolic surfaces converging to the Poincar\'e disc in the Benjamini-Schramm sense. Assuming a uniform lower bound on the injectivity radius and a spectral gap, we establish…
We study the semiclassical behaviour of eigenfunctions of quantum systems with ergodic classical limit. By the quantum ergodicity theorem almost all of these eigenfunctions become equidistributed in a weak sense. We give a simple derivation…
The $N$ vertices of a quantum random graph are each a circle independently punctured at Poisson points of arrivals, with parallel connections derived through for each pair of these punctured circles by yet another independent Poisson…
A discrete model of quantum ergodicity of linear maps generated by symplectic matrices $A \in \mathrm{Sp}(2d,\mathbb{Z})$ modulo an integer $N\ge 1$, has been studied for $d=1$ and almost all $N$ by P. Kurlberg and Z. Rudnick (2001). Their…
Explicit, exact periodic orbit expansions for individual eigenvalues exist for a subclass of quantum networks called regular quantum graphs. We prove that all linear chain graphs have a regular regime.
This work deals with the average scattering entropy of quantum graphs. We explore this concept in several distinct scenarios that involve periodic, aperiodic and random distribution of vertices of distinct degrees. In particular, we compare…
In this work, we give novel spectral norm bounds for graph matrix on inputs being random regular graphs. Graph matrix is a family of random matrices with entries given by polynomial functions of the underlying input. These matrices have…
There are few known exponential speedups for quantum algorithms and these tend to fall into even fewer families. One speedup that has mostly resisted generalization is the use of quantum walks to traverse the welded-tree graph, due to…
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…
This paper is a physicist's review of the major conceptual issues concerning the problem of spectral universality in quantum systems. Here we present a unified, graph-based view of all archetypical models of such universality (billiards,…
Quantum graphity is a background independent model for emergent locality, spatial geometry and matter. The states of the system correspond to dynamical graphs on N vertices. At high energy, the graph describing the system is highly…
We investigate spectral properties of quantum graphs in the form of a periodic chain of rings with a connecting link between each adjacent pair, assuming that wave functions at the vertices are matched through conditions manifestly…
In this paper, we consider a sequence of open quantum graphs, with uniformly bounded data, and we are interested in the asymptotic distribution of their scattering resonances. Supposing that the number of leads in our quantum graphs is…
Given an unbalanced open quantum graph, we derive a formula relating sums over its scattering resonances with integrals outside a strip. We deduce lower bounds on the number of resonances (in bounded regions of the complex plane),that are…
For periodic graph operators, we establish criteria to determine the overlaps of spectral band functions based on Bloch varieties. One criterion states that for a large family of periodic graph operators, the irreducibility of Bloch…
Given a quantum graph $ \Gamma $, a finite symmetry group $ G $ acting on it and a representation $ R $ of $ G $, the quotient quantum graph $ \Gamma /R $ is described and constructed in the literature [1, 2, 18]. In particular, it was…
Consider $N\times N$ symmetric one-dimensional random band matrices with general distribution of the entries and band width $W \geq N^{3/4+\varepsilon}$ for any $\varepsilon>0$. In the bulk of the spectrum and in the large $N$ limit, we…
We study a class of Unitary Quantum Walks on arbitrary graphs, parameterized by a family of scattering matrices. These Scattering Quantum Walks model the discrete dynamics of a system on the edges of the graph, with a scattering process at…
We discuss the condition for the validity of equilibrium quantum statistical mechanics in the light of recent developments in the understanding of classical and quantum chaotic motion. In particular, the ergodicity parameter is shown to…
The continuous-time quantum walk is a particle evolving by Schr\"odinger's equation in discrete space. Encoding the space as a graph of vertices and edges, the Hamiltonian is proportional to the discrete Laplacian. In some physical systems,…