Solution of scaling quantum networks
Abstract
We show that all scaling quantum graphs are explicitly integrable, i.e. any one of their spectral eigenvalues En 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 9, 523 (2001)].
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.