Related papers: Inverse scattering problem for quantum graph verti…
We demonstrate that a quantum annealer can be used to solve the NP-complete problem of graph partitioning into subgraphs containing Hamiltonian cycles of constrained length. We present a method to find a partition of a given directed graph…
We present a framework to solve the open problem of formulating the inverse scattering method (ISM) for an integrable PDE on a star-graph. The idea is to map the problem on the graph to a matrix initial-boundary value (IBV) problem and then…
The graph isomorphism (GI) problem is the computational problem of finding a permutation of vertices of a given graph $G_1$ that transforms $G_1$ to another given graph $G_2$ and preserves the adjacency. In this work, we propose a quantum…
In this paper we consider an inverse problem for the $n$-dimensional random Schr\"{o}dinger equation $(\Delta-q+k^2)u = 0$. We study the scattering of plane waves in the presence of a potential $q$ which is assumed to be a Gaussian random…
We present a direct and simple method for the computation of the total scattering matrix of an arbitrary finite noncompact connected quantum graph given its metric structure and local scattering data at each vertex. The method is inspired…
In a finite-dimensional Euclidian space we consider a connected metric graph with the following property: each two cycles can have at most one common point. Such graphs are called A-graphs. On noncompact A-graph we consider a scattering…
We consider a fixed angle inverse scattering problem in the presence of a known Riemannian metric. First, assuming a no caustics condition, we study the direct problem by utilizing the progressing wave expansion. Under a symmetry assumption…
For non-Hermitian equilateral q-pointed star-shaped quantum graphs of paper I [Can. J. Phys. 90, 1287 (2012), arXiv 1205.5211] we show that due to certain dynamical aspects of the model as controlled by the external, rotation-symmetric…
We introduce a Sinkhorn-type algorithm for producing quantum permutation matrices encoding symmetries of graphs. Our algorithm generates square matrices whose entries are orthogonal projections onto one-dimensional subspaces satisfying a…
An original approach to the inverse scattering for Jacobi matrices was suggested in a recent paper by Volberg-Yuditskii. The authors considered quite sophisticated spectral sets (including Cantor sets of positive Lebesgue measure), however…
We clarify the algebraic structure of continuous and discrete quasi-exactly solvable spectral problems by embedding them into the framework of the quantum inverse scattering method. The quasi-exactly solvable hamiltonians in one dimension…
We consider the quantum inverse scattering method for several mixed integrable models based on the rational SU(N) R-matrix with general toroidal boundary conditions. This includes systems whose Hilbert spaces are invariant by the discrete…
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.
This paper proposes a neural network approach for solving two classical problems in the two-dimensional inverse wave scattering: far field pattern problem and seismic imaging. The mathematical problem of inverse wave scattering is to…
In this paper we consider the inverse electromagnetic scattering for a cavity surrounded by an inhomogeneous medium in three dimensions. The measurements are scattered wave fields measured on some surface inside the cavity, where such…
The Frequency Domain Reflectometry (FDR) is studied as a powerful tool to detect hard or soft faults in star-shaped networks of nonuniform lossless transmission lines. Processing the FDR measurements leads to solve an inverse scattering…
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…
In this article, the inverse scattering problem (ISP) of recovering the matrix coefficient of a first order system of ordinary differential equations on the half-axis from its scattering matrix is considered. In the case of a triangular…
In the broad range of studies related to quantum graphs, quantum graph spectra appear as a topic of special interest. They are important in the context of diffusion type problems posed on metric graphs. Theoretical findings suggest that…
In this paper, we study the inverse spectral problem for the Sturm-Liouville operators on a star-shaped graph, which consists in the recovery of the potentials from specral data or several spectra. The uniform stability of these inverse…