Related papers: Inverse problems for quantum graph associated with…
We analyze the scattering of linear internal waves in a two dimensional channel with subcritical bottom topography. We construct the scattering matrix for the internal wave problem in a channel with straight ends, mapping incoming data to…
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…
The Dirichlet problem and Dirichlet to Neumann map are analyzed for elliptic equations on a large collection of infinite quantum graphs. For a dense set of continuous functions on the graph boundary, the Dirichlet to Neumann map has values…
In quantum field theories, spectral densities are directly related to relevant physical observables. In Lattice QCD, their non-perturbative extraction from first principles requires the Inverse Laplace transform of Euclidean-time…
We analyze the inverse problem to reconstruct the shape of a three dimensional homogeneous dielectric obstacle from the knowledge of noisy far field data. The forward problem is solved by a system of second kind boundary integral equations.…
We study quantum scattering theory off $n$ point inhomogeneities ($n\in\bbN$) in three dimensions. The inhomogeneities (or generalized point interactions) positioned at $\{\xi_1,...,\xi_n\}\subset\bbR^3$ are modeled in terms of the $n^2$…
We propose an approach to quantize discrete networks (graphs with discrete edges). We introduce a new exact solution of discrete Schrodinger equation that is used to write the solution for quantum graphs. Formulation of the problem and…
We study the inverse problem of recovering a tree graph together with the weights on its edges (equivalently a metric tree) from the knowledge of the Dirichlet-to-Neumann matrix associated with the Laplacian. We prove an explicit formula…
Interest in inverse dynamical, spectral and scattering problems for differential equations on graphs is motivated by possible applications to nano-electronics and quantum waveguides and by a variety of other classical and quantum…
The numerical algorithm of the inverse quantum scattering is developed. This algorithm is based on the Marchenko theory, and includes three steps. The first one is the algebraic Pade approximation of the unitary S-matrix, what is realized…
In this talk, I describe some recent ideas relating to the spectral reconstruction inverse problem, which arises frequently in lattice QCD calculations of inclusive hadronic quantities, and provide some physical context for this work.…
We solve the inverse spectral problem for rotationally symmetric manifolds, which include the class of surfaces of revolution, by giving an analytic isomorphism from the space of spectral data onto the space of functions describing the…
Neural networks functions are supposed to be able to encode the desired solution of an inverse problem very efficiently. In this paper, we consider the problem of solving linear inverse problems with neural network coders. First we…
We construct models of exactly solvable two-particle quantum graphs with certain non-local two-particle interactions, establishing appropriate boundary conditions via suitable self-adjoint realisations of the two-particle Laplacian. Showing…
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…
In this note, we solve an inverse spectral problem for a class of finite band symmetric matrices. We provide necessary and sufficient conditions for a matrix valued function to be a spectral function of the operator corresponding to a…
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…
We present quantum graphs with remarkably regular spectral characteristics. We call them {\it regular quantum graphs}. Although regular quantum graphs are strongly chaotic in the classical limit, their quantum spectra are explicitly…
The problems of computing eccentricity, radius, and diameter are fundamental to graph theory. These parameters are intrinsically defined based on the distance metric of the graph. In this work, we propose quantum algorithms for the diameter…
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…