Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

One-Dimensional Quantum Chaos: Explicitly Solvable Cases

Yuri A. Dabaghian, Roderick V. Jensen, R. Blümel

Published Jan 1, 2001• 15 citations
OpenAlex

Abstract

We present quantum graphs with remarkably regular spectral characteristics. We call them regular quantum graphs. Although regular quantum graphs are strongly chaotic in the classical limit, their quantum spectra are explicitly solvable in terms of periodic orbits. We present analytical solutions for the spectrum of regular quantum graphs in the form of explicit and exact periodic orbit expansions for each individual energy level

Related papers

One-dimensional quantum chaos: Explicitly solvable cases

Yu. Dabaghian, R. V. Jensen, R. Blümel

We present quantum graphs with remarkably regular spectral characteristics. We call them regular quantum graphs . Although regular quantum graphs are strongly chaotic in the classical limit, their quantum spectra are explicitly solvable in terms of periodic orbits. We present analytical solutions for the spectrum of regular quantum graphs in the form of explicit and exact periodic orbit expansions for each individual energy level.

arXiv:quant-ph/0108054•Journal of Experimental and Theoretical Physics Letters•Aug 1, 2001•12 citations

Explicit Spectral formulae for scaling quantum graphs

Yuri A. Dabaghian, R. Blümel

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.

arXiv:quant-ph/0310051•Oct 8, 2003•1 citation

Exact, convergent periodic-orbit expansions of individual energy eigenvalues of regular quantum graphs

R. Blümel, Yuri A. Dabaghian, Roderick V. Jensen

We present exact, explicit, convergent periodic-orbit expansions for individual energy levels of regular quantum graphs in the paper. One simple application is the energy levels of a particle in a piecewise constant potential. Since the classical ray trajectories (including ray splitting) in such systems are strongly chaotic, this result provides an explicit quantization of a classically chaotic system.

arXiv:quant-ph/0110109•Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Apr 8, 2002•26 citations

Explicit spectral formulas for scaling quantum graphs

Yuri A. Dabaghian, R. Blümel

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 network of taut strings with piecewise constant mass density provides an experimentally realizable analogue system of scaling quantum graphs.

Physical Review E•Oct 19, 2004•24 citations

Explicit analytical solution for scaling quantum graphs

Yuri A. Dabaghian, R. Blümel

We show that scaling quantum graphs with arbitrary topology are explicitly analytically solvable. This is surprising since quantum graphs are excellent models of quantum chaos and quantum chaotic systems are not usually explicitly analytically solvable.

arXiv:quant-ph/0301003•Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Nov 20, 2003•14 citations

Quantum graph models of quantum chaos: an introduction and some recent applications

Gregory Berkolaiko, Sven Gnutzmann

Quantum graphs are a paradigmatic model for quantum chaos as well as for spectral theory. We give a concise didactical introduction to quantum graphs, or Schrödinger Hamiltonians on metric graphs, with a focus on results related to quantum chaos, periodic orbit theory and spectral theory. We summarise related seminal results, and give an overview over a few more recent developments.

quant-pharXiv:2604.12690•Apr 15, 2026
We present quantum graphs with remarkably regular spectral characteristics. We call them regular quantum graphs. Although regular quantum graphs are strongly chaotic in the classical limit, their quantum spectra are explicitly solvable in terms of periodic orbits. We present analytical solutions for the spectrum of regular quantum graphs in the form of explicit and exact periodic orbit expansions for each individual energy level
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 En=f(n)E_n=f(n)En​=f(n), where nnn is the sequence number of the energy level of the quantum graph and fff 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 mmm 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.
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 network of taut strings with piecewise constant mass density provides an experimentally realizable analogue system of scaling quantum graphs.