Solution of scaling quantum networks
Quantum Physics
2009-11-10 v1
Abstract
We show that all scaling quantum graphs are explicitly integrable, i.e. any one of their spectral eigenvalues is computable analytically, explicitly, and individually for any given . 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)].
Cite
@article{arxiv.quant-ph/0302035,
title = {Solution of scaling quantum networks},
author = {Yu. Dabaghian and R. Blümel},
journal= {arXiv preprint arXiv:quant-ph/0302035},
year = {2009}
}
Comments
11 pages, 1 figure