Related papers: Localization on quantum graphs with random vertex …
We show that the tails of the asymptotic density distribution of a quantum wave packet that localizes in the the presence of random or quasiperiodic disorder can be described by the diagonal term of the projection over the eingenstates of…
We study discrete random Schr\"odinger operators via the supersymmetric formalism. We develop a cluster expansion that converges at both strong and weak disorder. We prove the exponential decay of the disorder-averaged Green's function and…
Quantum graph state is a special class of nonlocal state among multiple quantum particles, underpinning several nonclassical and promising applications such as quantum computing and quantum secret sharing. Recently, establishing quantum…
We establish Anderson localization for quasiperiodic operator families of the form $$ (H(x)\psi)(m)=\psi(m+1)+\psi(m-1)+\lambda v(x+m\alpha)\psi(m) $$ for all $\lambda>0$ and all Diophantine $\alpha$, provided that $v$ is a $1$-periodic…
We consider a Schr\"odinger particle on a graph consisting of $\,N\,$ links joined at a single point. Each link supports a real locally integrable potential $\,V_j\,$; the self--adjointness is ensured by the $\,\delta\,$ type boundary…
We consider the count of subgraphs with an arbitrary configuration of endpoints in the random-connection model based on a Poisson point process on ${\Bbb R}^d$. We present combinatorial expressions for the computation of the cumulants and…
We study the problem of minimizing or maximizing the fundamental spectral gap of Schr\"odinger operators on metric graphs with either a convex potential or a ``single-well'' potential on an appropriate specified subset. (In the case of…
Graph states are a unique resource for quantum information processing, such as measurement-based quantum computation. Here, we theoretically investigate using continuous-variable graph states for single-parameter quantum metrology,…
We analyse graphs in which each vertex is assigned random coordinates in a geometric space of arbitrary dimensionality and only edges between adjacent points are present. The critical connectivity is found numerically by examining the size…
We describe operators driving the time evolution of singular diffusion on finite graphs whose vertices are allowed to carry masses. The operators are defined by the method of quadratic forms on suitable Hilbert spaces. The model also covers…
We analyse the eigenvectors of the adjacency matrix of a random inhomogeneous graph constructed from a specified degree sequence. We assume that the empirical degree sequence has bounded mean and variance. We show that near the edges of the…
We locate gaps in the spectrum of a Hamiltonian on a periodic cuboidal (and generally hyperrectangular) lattice graph with $\delta$ couplings in the vertices. We formulate sufficient conditions under which the number of gaps is finite. As…
We study theoretically transitions between the localized and chaotic many-body regimes in one-dimensional quantum lattice systems with long-range couplings between particles and linear external potential. In terms of established criteria…
Although the spectral properties of random graphs have been a long-standing focus of network theory, the properties of right eigenvectors of directed graphs have so far eluded an exact analytic treatment. We present a general theory for the…
We investigate spectral and dynamical localization of a quantum system of $ n $ particles on $ \mathbb{R}^d $ which are subject to a random potential and interact through a pair potential which may have infinite range. We establish two…
We consider the Schr\"odinger operator defined by the quantization of the linear flow of diophantine frequencies over the l-dimensional torus, perturbed by a holomorphic potential which depends on the actions only through their particular…
Quantum graphs are commonly used as models of complex quantum systems, for example molecules, networks of wires, and states of condensed matter. We consider quantum statistics for indistinguishable spinless particles on a graph,…
Multipartite entangled states are great resources for quantum networks. In this work we study the distribution, or routing, of entangled states over fixed, but arbitrary, physical networks. Our simplified model represents each use of a…
For chaotic scattering on quantum graphs, the semiclassical approximation is exact. We use this fact and employ supersymmetry, the colour-flavour transformation, and the saddle-point approximation to calculate the exact expression for the…
The phenomenon of quantum localization in classically chaotic eigenstates is one of the main issues in quantum chaos (or wave chaos), and thus plays an important role in general quantum mechanics or even in general wave mechanics. In this…