Explicit, analytical solution of scaling quantum graphs
classification
🪐 quant-ph
keywords
quantumgraphsanalyticallyexplicitlyscalingsolvableanalyticalarbitrary
read the original abstract
Based on earlier work on regular quantum graphs we show that a large class of scaling quantum graphs with arbitrary topology are explicitly analytically solvable. This is surprising since quantum graphs are excellent models of quantum chaos and quantum chaotic systems are not usually explicitly analytically solvable.
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.