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 Schrödinger equation on metric graphs. This allows to derive simple constraints, which make usual Kirchhoff-type boundary conditions at the vertex equivalent to the transparent ones. The approach is applied to quantum star and tree graphs. However, extension to more complicated graph topologies is rather straightforward.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
