0310051v3

related topics
{classical, space, random}
{equation, function, exp}
{let, theorem, proof}
{energy, state, states}
{cos, sin, state}
{algorithm, log, probability}
{force, casimir, field}
{state, phys, rev}

Explicit Spectral formulae for scaling quantum graphs

Yu. Dabaghian, R. Blümel

abstract: We present an exact analytical solution of the spectral problem of quasi one-dimensional scaling quantum graphs. Strongly stochastic in the classical limit, these systems are frequently employed as models of quantum chaos. We show that despite their classical stochasticity all scaling quantum graphs are explicitly solvable in the form $E_n=f(n)$, where $n$ is the sequence number of the energy level of the quantum graph and $f$ is a known function, which depends only on the physical and geometrical properties of the quantum graph. Our method of solution motivates a new classification scheme for quantum graphs: we show that each quantum graph can be uniquely assigned an integer $m$ reflecting its level of complexity. We show that a taut string with piecewise constant mass density provides an experimentally realizable analogue system of scaling quantum graphs.

oai_identifier:
oai:arXiv.org:quant-ph/0310051
categories:
quant-ph
comments:
40 pages, 10 figures
arxiv_id:
quant-ph/0310051
created:
2003-10-07
updated:
2004-07-20

Full article ▸

related documents
0412123v1
0601139v1
0701128v1
0402010v1
0103050v1
0606102v2
0503118v1
0504224v1
0510037v1
0406109v1
0611265v1
0611191v1
0603212v1
0408183v3
0503084v2
0511108v2
0310125v1
0609112v2
0406039v2
0311009v1
0410103v2
0401142v2
0603261v2
0401103v1
0602007v1