RECORD
Explicit Spectral formulae for scaling quantum graphs
Quantum Physics · Submitted 8 Oct 2003
abstract compiled · 2026-09-23 · no language-model review
The authors' main claim 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.
The compiled record
The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.
Open the compiled record
The abstract, sentence by sentence
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.
background contribution method result interpretation main claim
| # | sentence | role | the authors' own work | states the main conclusion | strength |
|---|---|---|---|---|---|
| s0 | We present an exact analytical solution of the spectral problem of quasi one-dimensional scaling quantum graphs. | contribution 0.95 | 0.95 | 0.21 | asserted 1.00 |
| s1 | Strongly stochastic in the classical limit, these systems are frequently employed as models of quantum chaos. | background 1.00 | 0.08 | 0.03 | asserted 0.98 |
| s2 | 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. | result 0.96 | 0.94 | 0.85 | asserted 1.00 |
| s3 | 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. | contribution 0.75 | 0.95 | 0.11 | asserted 1.00 |
| s4 | We show that a taut string with piecewise constant mass density provides an experimentally realizable analogue system of scaling quantum graphs. | result 0.49 | 0.84 | 0.05 | asserted 1.00 |
What was examined, and what was not
- arXiv listing abstract v3
- full text
- figures and tables
- references and citing sentences
- relations to other papers
- P abstract
- S sections
- T body sentences
- C citations
- R cross-paper relations
The paper
Original 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.
Human review
How the literature uses it
Papers whose main result relates to this one's
States the same result 1 paper
-
We show that all scaling quantum graphs are explicitly integrable, i.e. any one of their spectral eigenvalues $E_n$ is computable analytically, explicitly, and individually for any given $n$.
Discussion
Know something about this paper? Leave a comment, or highlight any passage above to comment on it.