Related papers: Quantum ergodicity on graphs
The methods of non-homogeneous random graphs calibration are developed for social networks simulation. The graphs are calibrated by the degree distributions of the vertices and the edges. The mathematical foundation of the methods is formed…
We show how graph theory concepts can provide an insight into the origin of slow dynamics in systems with kinetic constraints. In particular, we observe that slow dynamics is related to the presence of strong hierarchies between nodes on…
Solving for the lowest energy eigenstate of the many-body Schrodinger equation is a cornerstone problem that hinders understanding of a variety of quantum phenomena. The difficulty arises from the exponential nature of the Hilbert space…
In this paper we investigate the distribution of the set of values of a linear map at integer points on a quadratic surface. In particular, it is shown that subject to certain algebraic conditions, this set is equidistributed. This can be…
Quantized, compact graphs were shown to be excellent paradigms for quantum chaos in bounded systems. Connecting them with leads to infinity we show that they display all the features which characterize scattering systems with an underlying…
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…
The aim of the paper is to investigate resonances in quantum graphs with a general self-adjoint coupling in the vertices and their trajectories with respect to varying edge lengths. We derive formulae determining the Taylor expansion of the…
We obtain several sharp spectral bounds, approximations, and exact values for the isoperimetric number and related edge-expansion parameters of graphs. Our results focus on graph powers and on families of graphs with rich algebraic or…
A distributional symmetry is invariance of a distribution under a group of transformations. Exchangeability and stationarity are examples. We explain that a result of ergodic theory provides a law of large numbers: If the group satisfies…
Many computational problems are unchanged under some symmetry operation. In classical machine learning, this can be reflected with the layer structure of the neural network. In quantum machine learning, the ansatz can be tuned to correspond…
We study the spectrum of a quantum star graph with a non-selfadjoint Robin condition at the central vertex. We first prove that, in the high frequency limit, the spectrum of the Robin Laplacian is close to the usual spectrum corresponding…
In this article we give an in depth overview of the recent advances in the field of equilibrium networks. After outlining this topic, we provide a novel way of defining equilibrium graph (network) ensembles. We illustrate this concept on…
In this series, we investigate quantum ergodicity at small scales for linear hyperbolic maps of the torus ("cat maps'"). In Part II of the series, we construct quasimodes that are quantum ergodic but are not equidistributed at the…
Consider a graph having quantum systems lying at each node. Suppose that the whole thing evolves in discrete time steps, according to a global, unitary causal operator. By causal we mean that information can only propagate at a bounded…
We view hyper-graphs as incidence graphs, i.e. bipartite graphs with a set of nodes representing vertices and a set of nodes representing hyper-edges, with two nodes being adjacent if the corresponding vertex belongs to the corresponding…
We consider general Exponential Random Graph Models (ERGMs) where the sufficient statistics are functions of homomorphism counts for a fixed collection of simple graphs $F_k$. Whereas previous work has shown a degeneracy phenomenon in dense…
Quantum graphs have attracted attention from mathematicians for some time. A quantum graph is defined by having a Laplacian on each edge of a metric graph and imposing boundary conditions at the vertices to get an eigenvalue problem. A…
We describe random loop models and their relations to a family of quantum spin systems on finite graphs. The family includes spin 1/2 Heisenberg models with possibly anisotropic spin interactions and certain spin 1 models with…
Quantum ergodicity asserts that almost all infinite sequences of eigenstates of a quantized ergodic system are equidistributed in the phase space. On the other hand, there are might exist exceptional sequences which converge to different…
We develop a unified quantum framework for subgraph counting in graphs. We encode a graph on $N$ vertices into a quantum state on $2\lceil \log_2 N \rceil$ working qubits and $2$ ancilla qubits using its adjacency list, with worst-case gate…