Related papers: Localization on a quantum graph with a random pote…
We show that a quantum computer operating with a small number of qubits can simulate the dynamical localization of classical chaos in a system described by the quantum sawtooth map model. The dynamics of the system is computed efficiently…
This work explores the spectra of quantum graphs where the Schr\"odinger operator on the edges is equipped with a potential. The scattering approach, which was originally introduced for the potential free case, is extended to this case and…
We prove a quantum-ergodicity theorem on large graphs, for eigenfunctions of Schr\"odinger operators in a very general setting. We consider a sequence of finite graphs endowed with discrete Schr\"odinger operators, assumed to have a local…
We study Schr\"odinger operators on quantum graphs where the number of edges between points is determined by orbits of a "shift of finite type". We prove Anderson localization for these systems.
We examine transmission through a quantum graph vertex to which auxiliary edges with constant potentials are attached. We find a characterization of vertex couplings for which the transmission probability from a given "input" line to a…
The Scattering Quantum Random Walk scheme has found success as a basis for search algorithms on highly symmetric graph structures. In this paper we examine its effectiveness at locating a specially marked vertex on square grid graphs,…
In this work, we propose novel families of positional encodings tailored to graph neural networks obtained with quantum computers. These encodings leverage the long-range correlations inherent in quantum systems that arise from mapping the…
We consider the inverse scattering on the quantum graph associated with the hexagonal lattice. Assuming that the potentials on the edges are compactly supported, we show that the S-matrix for all energies in any open set in the continuous…
We consider a problem of localizing a path-signal that evolves over time on a graph. A path-signal can be viewed as the trajectory of a moving agent on a graph in several consecutive time points. Combining dynamic programming and graph…
We prove quantum ergodicity for a family of periodic Schr\"odinger operators $H$ on periodic graphs. This means that most eigenfunctions of $H$ on large finite periodic graphs are equidistributed in some sense, hence delocalized. Our…
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…
An analysis is made of a moving disturbance using a directed cyclic graph. A statistical approach is used to calculate the alternative positions in space and state of the disturbance with a defined observed time. The probability for a…
We prove spectral and dynamical localization for the multi-dimensional random displacement model near the bottom of its spectrum by showing that the approach through multiscale analysis is applicable. In particular, we show that a…
In this paper we consider Schr\"{o}dinger operators on $M \times \mathbb{Z}^{d_2}$, with $M=\{M_{1}, \ldots, M_{2}\}^{d_1}$ (`quantum wave guides') with a `$\Gamma$-trimmed' random potential, namely a potential which vanishes outside a…
Quantum networks are often modelled using Schroedinger operators on metric graphs. To give meaning to such models one has to know how to interpret the boundary conditions which match the wave functions at the graph vertices. In this article…
Quantum algorithms for searching one or more marked items on a d-dimensional lattice provide an extension of Grover's search algorithm including a spatial component. We demonstrate that these lattice search algorithms can be viewed in terms…
We consider alloy type random Schr\"odinger operators on a cubic lattice whose randomness is generated by the sign-indefinite single-site potential. We derive Anderson localization for this class of models in the Lifshitz tails regime, i.e.…
This paper aims at presenting a few models of quantum dynamics whose description involves the analysis of random unitary matrices for which dynamical localization has been proven to hold. Some models come from physical approximations…
This note describes recent results on the localization properties of Random Quantum Walks on the d-dimensional lattice in a regime analogous to the large disorder regime by means of the Fractional Moments Method adapted to the unitary…
Quantum random walks represent a powerful tool for the implementation of various quantum algorithms. We consider a convolution problem for the graphs which provide quantum and classical random walks. We suggest a new method for lattices and…