Inverse scattering problem for quantum graph vertices
classification
🪐 quant-ph
cond-mat.mes-hallmath-phmath.MP
keywords
quantumgraphinverseproblemscatteringverticesconstructioncoupling
pith:T25L3GQX Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{T25L3GQX}
Prints a linked pith:T25L3GQX badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original abstract
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 the construction of quantum graphs with desired properties in a tailor-made fashion. The procedure is illustrated on the example of quantum vertices with equal transmission probabilities.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.