Related papers: Quantum scattering theory on graphs with tails
Using the spectral distribution associated with the adjacency matrix of graphs, we introduce a new method of calculation of amplitudes of continuous-time quantum walk on some rather important graphs, such as line, cycle graph $C_n$,…
We solve an open problem by constructing quantum walks that not only detect but also find marked vertices in a graph. In the case when the marked set $M$ consists of a single vertex, the number of steps of the quantum walk is quadratically…
Motivated by a recent application of quantum graphs to model the anomalous Hall effect we discuss quantum graphs the vertices of which exhibit a preferred orientation. We describe an example of such a vertex coupling and analyze the…
We consider graphs made of one-dimensional wires connected at vertices, and on which may live a scalar potential. We are interested in a scattering situation where such a network is connected to infinite leads. We study the correlations of…
Quantum walks that depend smoothly on a small parameter $\varepsilon\ge0$ are considered on directed graphs. The asymptotic behavior of the scattering matrix of the quantum walk as $\varepsilon\to+0$ is investigated. It is shown that, in…
We analyze a continuous-time quantum walk on a chimera graph, which is a graph of choice for designing quantum annealers, and we discover beautiful quantum-walk features such as localization that starkly distinguishes classical from quantum…
The probability of a quantum particle being detected in a given solid angle is determined by the $S$-matrix. The explanation of this fact in time dependent scattering theory is often linked to the quantum flux, since the quantum flux…
We consider graphs made of one-dimensional wires connected at vertices and on which may live a scalar potential. We are interested in a scattering situation where the graph is connected to infinite leads. We investigate relations between…
We develop a geometric scattering theory for a geometrically finite group acting on (a vector bundle over) a symmetric space of negative curvature. In particular, we obtain the meromorphic continuation of Eisenstein series and scattering…
Any directed graph G with N vertices and J edges has an associated line-graph L(G) where the J edges form the vertices of L(G). We show that the non-zero eigenvalues of the adjacency matrices are the same for all graphs of such a family…
We clarify the correspondence between the two approaches to quantum graphs: via quantum adjacency matrices and via quantum relations. We show how the choice of a (possibly non-tracial) weight manifests itself on the quantum relation side…
We define the quaternionic quantum walk on a finite graph and investigate its properties. This walk can be considered as a natural quaternionic extension of the Grover walk on a graph. We explain the way to obtain all the right eigenvalues…
Quantum walks, an important tool in quantum computing, have been very successfully investigated using techniques in algebraic graph theory. We are motivated by the study of state transfer in continuous-time quantum walks, which is…
We generalize the scattering approach to quantum graphs to quantum graphs with with piecewise constant potentials and multiple excitation modes. The free single-mode case is well-known and leads to the trace formulas of Roth, Kottos and…
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,…
This paper develops a scattering theory for the asymmetric transport observed at interfaces separating two-dimensional topological insulators. Starting from the spectral decomposition of an unperturbed interface Hamiltonian, we present a…
Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the…
We develop a scattering theory for time-periodic Hamiltonians on discrete graphs, including long-range potentials with zero average for the period, and show the existence and completeness of wave operators.
A quantum walk is the quantum analogue of a random walk. While it is relatively well understood how quantum walks can speed up random walk hitting times, it is a long-standing open question to what extent quantum walks can speed up the…
We develop the quantum inverse scattering method for the one-dimensional Hubbard model on the infinite line at zero density. This enables us to diagonalize the Hamiltonian algebraically. The eigenstates can be classified as scattering…