Transparent Quantum Graphs
classification
🪐 quant-ph
cond-mat.mes-hallcond-mat.supr-con
keywords
graphstransparentboundaryconditionsquantumappliedvertexallows
read the original abstract
We consider quantum graphs with transparent branching points. To design such networks, the concept of transparent boundary conditions is applied to the derivation of the vertex boundary conditions for the linear Schrodinger equation on metric graphs. This allows to derive simple constraints, which use equivalent usual Kirchhoff-type boundary conditions at the vertex to the transparent ones. The approach is applied to quantum star and tree graphs. However, extension to more complicated graph topologies is rather straight forward.
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.