Pith. sign in

REVIEW

Inverse scattering problem for quantum graph vertices

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1104.1048 v1 pith:T25L3GQX submitted 2011-04-06 quant-ph cond-mat.mes-hallmath-phmath.MP

Inverse scattering problem for quantum graph vertices

classification quant-ph cond-mat.mes-hallmath-phmath.MP
keywords quantumgraphinverseproblemscatteringverticesconstructioncoupling
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.