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

arXiv:chao-dyn/9906018 · Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics

Quantum algorithmic integrability: The metaphor of classical polygonal billiards

Giorgio Mantica

Published Jun 1, 2000• 14 citations
arXivHTMLPDF

Abstract

We study the algorithmic complexity of motions in classical polygonal billiards, which, as the number of sides increases, tend to curved billiards, both regular and chaotic. This study unveils the equivalence of this problem to the procedure of quantization: the average complexity of symbolic trajectories in polygonal billiards features the same scaling relations (with respect to the number of sides) that govern quantum systems when a semiclassical parameter is varied. Two cases, the polygonal approximations of the circle and of the stadium, are examined in detail and are presented as paradigms of quantization of integrable and chaotic systems.

DOI
10.1103/physreve.61.6434

Related papers

The polygon quantum-billiard problem

Richard L. Liboff

The present work addresses the quantum polygon billiard problem with attention given to analytic and degeneracy properties of energy eigenstates. The ‘‘polygon ground-state theorem’’ is proven which states that the only polygons that contain respective ground states that are analytic in the closed domain of the entire polygon are the ‘‘elemental polygons’’ (defined in the text). The ‘‘polygon first excited-state theorem’’ is established which states that for every N-sided regular polygon, N equivalent first excited states exist, each of which contains a nodal curve that is a line of mirror symmetry of the related polygon. A vector description of nodal diagonal eigenstates is introduced to establish the second component of this theorem which indicates that the space of first excited states for the N-sided regular polygon is spanned by any two of these N nodal-diagonal eigenstates (i.e., the first excited state is twofold degenerate). At various levels of the discussion attention is drawn to the correspondence between the quantum and classical solutions for these configurations. Thus, for example, correspondence is demonstrated in the common source of integrability in the classical and quantum domains for three inclusive, nonoverlapping classes of polygons. Stemming from the preceding conclusions, a discussion is included on the possibility of employing transverse magnetic (TM) modes in a metal waveguide to determine if an equivalent quantum billiard configuration is chaotic.

Journal of Mathematical Physics•Feb 1, 1994•31 citations

Plane-wave quantization for polygonal billiards

José Luis Vega, T. Uzer, Joseph Ford

There is theoretical evidence indicating that generic polygons do not admit eigenfunctions that are superpositions of plane waves. However, we find that a plane-wave quantization for a family of polygonal billiards gives results in very good agreement with theoretical predictions. Indeed the fraction of missing states decreases as the number of sides is increased. We provide a resolution of this contradiction: While theory says that no plane-wave eigenfunctions are possible for polygonal boundaries, it is not applicable to the curvilinear boundaries approximating these polygons. This is analogous to the classical mechanics of polygonal billiards, where according to continuum mathematics there is no chaos, yet discrete mathematics finds it. In the quantum treatment considered here, according to continuum mathematics there can be no plane-wave eigenfunctions, yet discrete mathematics finds them.

Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Aug 1, 1995•7 citations

Eigenfunctions and periodic orbits in classically chaotic systems: Order in chaos?

Eric J. Heller, Patrick W. O’Connor, John N. Gehlen

We study the quantum mechanics of a Hamiltonian system which is classically chaotic: the stadium billiard. We have examined many of the eigenstates of the stadium, up to about the 10,000th. Complex periodic orbits play an active role in shaping the eigenstates.

AIP conference proceedings•Jan 1, 1987•0 citations

QUANTUM CHAOS, IS THERE ANY?

Joseph Ford

Though not yet widely recognized, there is a growing body of evidence which strongly indicates that quantum mechanics does not adequately encompass chaos. Unfortunately this evidence, while striking, is not yet sufficient to establish that quantum mechanics is a theory of limited validity. Thus, we here present four problems which offer promise of definitively revealing the lack of chaos in quantum mechanics. Specifically, we suggest that judicious use of algorithmic complexity theory can provide rigorous proofs for the following assertions: 1. The algorithms which compute quantum mechanical eigenvalues and eigenfunctions have null complexity. 2. The time evolution of the wave function for any finite, bounded, conservative quantum system has null complexity no matter the smallness of ℏ > 0. 3. The time evolution of a specific time dependent Hamiltonian, known to be classically chaotic, has null complexity not only no matter how small ℏ > 0 but even in the limit as ℏ → 0. 4. An algorithm of null complexity exists for obtaining the time evolution of any quantum billiard confined within a polygon all of whose vertex angles are rational (mπ/n). Here, the term null complexity means that the problem can be solved using finite, recursive algorithms: 1. The algorithma which compute quantum mechanical eigenvalues and eigenfunctions have null complexity. 2. The time evolution of the wave function for any finite, bounded, conservative quantum system has null complexity no matter the smallness of ℏ > 0. 3. The time evolution of a specific time dependent Hamiltonian, known to be classically chaotic, has null complexity not only no matter how small ℏ > 0 but even in tlie limit as ℏ → 0. 4. An algorithm of null complexity exiats for obtaining the time evolution of any quantum billiard confined within a polygon all of whose vertex angles are rational (mπ/n). Here, the term null complexity means that the problem can be solved using finite, recursive algorithms.

Series on directions in condensed matter physics•Apr 1, 1988•10 citations

EVOLUTION OF LIOUVILLE DENSITY IN BILLIARDS: THE QUANTUM CONNECTION

Debabrata Biswas

The study of classical Liouville density arises naturally in chaotic systems where a probabilistic treatment is more appropriate. In this review, we show that the evolution of a density projected onto the configuration space has a quantum connection in billiard systems. The eigenvalues and eigenfunctions of the concerned evolution operator have an approximate one-to-one correspondence with the quantum Neumann eigenvalues and eigenfunctions. For exceptional billiard shapes such as the rectangle, this correspondence is even exact. Despite the approximate nature of the correspondence, we demonstrate that the exact quantum Neumann eigenstates can be used to expand and evolve an arbitrary classical projected-density. For the rectangular and stadium billiards, results are compared with the actual evolution of the density using classical trajectories and are found to be satisfactory.

Modern Physics Letters B•Jun 20, 2006•0 citations

Semiclassical analysis of response functions for integrable systems

B. Mehlig

We derive a semiclassical expansion of quantum spectral functions for integrable systems. This complements a previous analysis of chaotic billiards [B. Mehlig et al., Phys. Rev. Lett. 75, 57 (1995)]. We discuss similarities and differences between the integrable and the chaotic case. As a numerical example, we consider a two-dimensional circular billiard.

Physical review. B, Condensed matter•Apr 15, 1997•5 citations
We study the algorithmic complexity of motions in classical polygonal billiards, which, as the number of sides increases, tend to curved billiards, both regular and chaotic. This study unveils the equivalence of this problem to the procedure of quantization: the average complexity of symbolic trajectories in polygonal billiards features the same scaling relations (with respect to the number of sides) that govern quantum systems when a semiclassical parameter is varied. Two cases, the polygonal approximations of the circle and of the stadium, are examined in detail and are presented as paradigms of quantization of integrable and chaotic systems.
The present work addresses the quantum polygon billiard problem with attention given to analytic and degeneracy properties of energy eigenstates. The ‘‘polygon ground-state theorem’’ is proven which states that the only polygons that contain respective ground states that are analytic in the closed domain of the entire polygon are the ‘‘elemental polygons’’ (defined in the text). The ‘‘polygon first excited-state theorem’’ is established which states that for every N-sided regular polygon, N equivalent first excited states exist, each of which contains a nodal curve that is a line of mirror symmetry of the related polygon. A vector description of nodal diagonal eigenstates is introduced to establish the second component of this theorem which indicates that the space of first excited states for the N-sided regular polygon is spanned by any two of these N nodal-diagonal eigenstates (i.e., the first excited state is twofold degenerate). At various levels of the discussion attention is drawn to the correspondence between the quantum and classical solutions for these configurations. Thus, for example, correspondence is demonstrated in the common source of integrability in the classical and quantum domains for three inclusive, nonoverlapping classes of polygons. Stemming from the preceding conclusions, a discussion is included on the possibility of employing transverse magnetic (TM) modes in a metal waveguide to determine if an equivalent quantum billiard configuration is chaotic.
There is theoretical evidence indicating that generic polygons do not admit eigenfunctions that are superpositions of plane waves. However, we find that a plane-wave quantization for a family of polygonal billiards gives results in very good agreement with theoretical predictions. Indeed the fraction of missing states decreases as the number of sides is increased. We provide a resolution of this contradiction: While theory says that no plane-wave eigenfunctions are possible for polygonal boundaries, it is not applicable to the curvilinear boundaries approximating these polygons. This is analogous to the classical mechanics of polygonal billiards, where according to continuum mathematics there is no chaos, yet discrete mathematics finds it. In the quantum treatment considered here, according to continuum mathematics there can be no plane-wave eigenfunctions, yet discrete mathematics finds them.
Though not yet widely recognized, there is a growing body of evidence which strongly indicates that quantum mechanics does not adequately encompass chaos. Unfortunately this evidence, while striking, is not yet sufficient to establish that quantum mechanics is a theory of limited validity. Thus, we here present four problems which offer promise of definitively revealing the lack of chaos in quantum mechanics. Specifically, we suggest that judicious use of algorithmic complexity theory can provide rigorous proofs for the following assertions: 1. The algorithms which compute quantum mechanical eigenvalues and eigenfunctions have null complexity. 2. The time evolution of the wave function for any finite, bounded, conservative quantum system has null complexity no matter the smallness of ℏ > 0. 3. The time evolution of a specific time dependent Hamiltonian, known to be classically chaotic, has null complexity not only no matter how small ℏ > 0 but even in the limit as ℏ → 0. 4. An algorithm of null complexity exists for obtaining the time evolution of any quantum billiard confined within a polygon all of whose vertex angles are rational (mπ/n). Here, the term null complexity means that the problem can be solved using finite, recursive algorithms: 1. The algorithma which compute quantum mechanical eigenvalues and eigenfunctions have null complexity. 2. The time evolution of the wave function for any finite, bounded, conservative quantum system has null complexity no matter the smallness of ℏ > 0. 3. The time evolution of a specific time dependent Hamiltonian, known to be classically chaotic, has null complexity not only no matter how small ℏ > 0 but even in tlie limit as ℏ → 0. 4. An algorithm of null complexity exiats for obtaining the time evolution of any quantum billiard confined within a polygon all of whose vertex angles are rational (mπ/n). Here, the term null complexity means that the problem can be solved using finite, recursive algorithms.
The study of classical Liouville density arises naturally in chaotic systems where a probabilistic treatment is more appropriate. In this review, we show that the evolution of a density projected onto the configuration space has a quantum connection in billiard systems. The eigenvalues and eigenfunctions of the concerned evolution operator have an approximate one-to-one correspondence with the quantum Neumann eigenvalues and eigenfunctions. For exceptional billiard shapes such as the rectangle, this correspondence is even exact. Despite the approximate nature of the correspondence, we demonstrate that the exact quantum Neumann eigenstates can be used to expand and evolve an arbitrary classical projected-density. For the rectangular and stadium billiards, results are compared with the actual evolution of the density using classical trajectories and are found to be satisfactory.