Dabaghian, Yuri A

doi:10.1134/1.1591985

Solution of Scaling Quantum Networks

2003

Dabaghian, Yuri A

Published Web Location

http://scitation.aip.org/vsearch/servlet/VerityServlet?KEY=JTPLA2&ONLINE=YES&smode=strresults&sort=chron&maxdisp=25&threshold=0&possible1=Dabaghian&possible1zone=article&OUTLOG=NO&viewabs=JTPLA2&key=DISPLAY&docID=1&page=1&chapter=0

Abstract

We show that all scaling quantum graphs are explicitly integrable, i.e., that 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 9, 523 (2001)).

Many UC-authored scholarly publications are freely available on this site because of the UC's open access policies. Let us know how this access is important for you.

Main Content

For improved accessibility of PDF content, download the file to your device.

UCSF

Solution of Scaling Quantum Networks

Published Web Location