Related papers: Quantum graphs where back-scattering is prohibited
We study a set of scattering matrices of quantum graphs containing minimal number of passbands, i.e., maximal number of zero elements. The cases of even and odd vertex degree are considered. Using a solution of inverse scattering problem,…
Boundary conditions in quantum graph vertices are generally given in terms of a unitary matrix $U$. Observing that if $U$ has at most two eigenvalues, then the scattering matrix $\mathcal{S}(k)$ of the vertex is a linear combination of the…
Quantum graphs can be extended to scattering systems when they are connected by leads to infinity. It is shown that for certain extensions, the scattering matrices of isospectral graphs are conjugate to each other and their poles…
We introduce the concept of regular quantum graphs and construct connected quantum graphs with discrete symmetries. The method is based on a decomposition of the quantum propagator in terms of permutation matrices which control the way…
We demonstrate how the inverse scattering problem of a quantum star graph can be solved by means of diagonalization of Hermitian unitary matrix when the vertex coupling is of the scale invariant (or F\"ul\H{o}p-Tsutsui) form. This enables…
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 quantum walks on a finite graphs to which infinite tails are attached. We explore how the propagating and bound states depend on the structure of the finite graph. The S-matrix for such graphs is defined. Its unitarity is proved…
We consider the inverse scattering on the quantum graph associated with the hexagonal lattice. Assuming that the potentials on the edges are compactly supported and symmetric, we show that the S-matrix for all energies in any given open set…
We summarize different approaches to the theory of quantum graphs and provide several ways to construct concrete examples. First, we classify all undirected quantum graphs on the quantum space $M_2$. Secondly, we apply the theory of…
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…
In contrast to the usual quantum systems which have at most a finite number of open spectral gaps if they are periodic in more than one direction, periodic quantum graphs may have gaps arbitrarily high in the spectrum. This property of…
We solve inverse problems from the D-N map for the quantum graph on a finite domain in a square lattice and that on a hexagonal lattice, as well as inverse scattering problems from the S-matrix for a locally perturbed square lattice and a…
We show how to construct discrete-time quantum walks on directed, Eulerian graphs. These graphs have tails on which the particle making the walk propagates freely, and this makes it possible to analyze the walks in terms of scattering…
A quantum walk model which reflects the $2$-cell embedding on the orientable closed surface of a graph in the dynamics is introduced. We show that the scattering matrix is obtained by finding the faces on the underlying surface which have…
We discuss possible applications of the 1-D direct and inverse scattering problem to design of universal quantum gates for quantum computation. The potentials generating some universal gates are described.
We consider quantum graphs with transparent branching points. To design such networks, the concept of transparent boundary conditions is applied to the derivation of the vertex boundary conditions for the linear Schrodinger equation on…
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 study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each. We are interested in walks that proceed from one half line, through…
The paper discusses quantum graphs with a vertex coupling which interpolates between the common one of the $\delta$ type and a coupling introduced recently by two of the authors which exhibits a preferred orientation. Describing the…
The paper deals with some spectral properties of (mostly infinite) quantum and combinatorial graphs. Quantum graphs have been intensively studied lately due to their numerous applications to mesoscopic physics, nanotechnology, optics, and…