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

Russian Physics Journal

Classical limit of quantum mechanics and the quantum billiards problem

O. G. Mishnev

Published May 1, 1982• 0 citations
Publisher
DOI
10.1007/bf00891775

Related papers

Bohmian Mechanics, the Quantum-Classical Correspondence and the Classical Limit: The Case of the Square Billiard

A. Matzkin

arXiv:0806.3240•Foundations of Physics•Apr 6, 2009•20 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

On the Classical Limit of Quantum Mechanics

Valia Allori, Nino Zanghì

arXiv:quant-ph/0112009•Foundations of Physics•Dec 1, 2008•46 citations

On the classical limit of quantum mechanics

Jorge Bernal, A. Martín-Ruiz, J. C. García-Melgarejo

•Jan 6, 2011•0 citations

Optical billiards break new ground in quantum chaos

Sri Sridhar

Physicists are fond of billiards, both in the lab and in the pool hall. From a physics viewpoint, billiards is a game played within a hard-wall enclosure in which particles can bounce elastically. Billiards is also the embodiment of model problems in classical and quantum mechanics.

Physics World•May 1, 2001•1 citation

Classical system underlying a diffracting quantum billiard

Manan Jain

Pramana•Jan 5, 2018•1 citation
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.