pith. sign in

arxiv: quant-ph/0302035 · v1 · submitted 2003-02-04 · 🪐 quant-ph

Solution of scaling quantum networks

classification 🪐 quant-ph
keywords quantumexplicitlygraphsscalinganalyticallychaoscomputableeigenvalues
0
0 comments X
read the original abstract

We show that all scaling quantum graphs are explicitly integrable, i.e. any one of their spectral eigenvalues $E_n$ is computable analytically, explicitly, and individually for any given $n$. This is surprising, since quantum graphs are excellent models of quantum chaos [see, e.g., T. Kottos and H. Schanz, Physica E {\bf 9}, 523 (2001)].

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.