Related papers: Direct computation of scattering matrices for gene…
We construct a bosonic quantum field on a general quantum graph. Consistency of the construction leads to the calculation of the total scattering matrix of the graph. This matrix is equivalent to the one already proposed using generalized…
We study the statistical properties of the scattering matrix associated with generic quantum graphs. The scattering matrix is the quantum analogue of the classical evolution operator on the graph. For the energy-averaged spectral form…
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.
In this paper we study the noncompact star-type graph with perturbed radial Schrodinger equation on each ray and the matching conditions of some special form at the vertex. The results include the uniqueness theorem and constructive…
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 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…
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…
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…
We investigate numerically the scattering of waves on discrete graphs. An efficient algorithm is developed to compute the reflection and transmission (spectral) coefficients. We then explore various configurations of input and output leads,…
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 walks are roughly analogous to classical random walks, and like classical walks they have been used to find new (quantum) algorithms. When studying the behavior of large graphs or combinations of graphs it is useful to find the…
The problem of electron scattering on the one-dimensional complexes is considered. We propose a novel theoretical approach to solution of the transport problem for a quantum graph. In the frame of the developed approach the solution of the…
Waveguide and resonant properties of diffractive structures are often explained through the complex poles of their scattering matrices. Numerical methods for calculating poles of the scattering matrix with applications in grating theory are…
We show that the study of the statistical properties of the scattering matrix S for quantum chaotic scattering in the presence of direct processes (charaterized by a nonzero average S matrix <S>) can be reduced to the simpler case where…
We develop a transfer-matrix formulation of the scattering of electromagnetic waves by a general isotropic medium which makes use of a notion of electromagnetic transfer matrix $\mathbf{M}$ that does not involve slicing of the scattering…
We calculate the S-matrix correlation function for chaotic scattering on quantum graphs and show that it agrees with that of random--matrix theory (RMT). We also calculate all higher S-matrix correlation functions in the Ericson regime.…
The scattering amplitude in simple quantum graphs is a well-known process which may be highly complex. In this work, motivated by the Shannon entropy, we propose a methodology that associates to a graph a scattering entropy, which we call…
We present application examples of a graphical method for the efficient construction of potential matrix elements in quantum physics or quantum chemistry. The simplicity and power of this method are illustrated through several examples. In…
A method for practical realization of the inverse scattering transform method for the Korteweg-de Vries equation is proposed. It is based on analytical representations for Jost solutions and for integral kernels of transformation operators…
This work deals with the average scattering entropy of quantum graphs. We explore this concept in several distinct scenarios that involve periodic, aperiodic and random distribution of vertices of distinct degrees. In particular, we compare…