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

Series on directions in condensed matter physics

QUANTUM CHAOS, IS THERE ANY?

Joseph Ford

Published Apr 1, 1988• 10 citations
Publisher

Abstract

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.

DOI
10.1142/9789814415729_0006

Related papers

Quantum Chaos and Semiclassical Mechanics

Robert W. Batterman

This paper discusses the problem of finding and defining chaos in quantum mechanics. While chaotic time evolution appears to be ubiquitous in classical mechanics, it is apparently absent in quantum mechanics in part because for a bound, isolated quantum system, the evolution of its state is multiply periodic. This has led a number of investigators to search for semiclassical signatures of chaos. Here I am concerned with the status of semiclassical mechanics as a distinct third theory of the asymptotic domain between classical and quantum mechanics. I discuss in some detail the meaning of such crucial locutions as the "classical counterpart to a quantum system" and a quantum system's "underlying classical motion". A proper elucidation of these concepts requires a semiclassical association between phase space surfaces and wave-functions. This significance of this association is discussed in some detail.

PSA Proceedings of the Biennial Meeting of the Philosophy of Science Association•Jan 1, 1992•11 citations

Quantum simulation of classically chaotic systems

Asher Peres, Lawrence S. Schulman

The evolution of a classically chaotic Hamiltonian system is characterised by a computational complexity that increases exponentially with the time elapsed. Quantum systems do not exhibit such behaviour. It is therefore tempting to solve a classical problem by quantising it and following the motion of a small wavepacket. This paper shows that nothing can be gained by this subterfuge: an adequate quantum simulation requires a Hilbert space whose dimension increases exponentially with the planned duration of the simulation.

Journal of Physics A Mathematical and General•Oct 21, 1988•4 citations

Eigenfunctions, eigenvalues, and time evolution of finite, bounded, undriven, quantum systems are not chaotic

Joseph Ford, Matthias Ilg

We prove here that the eigenvalues, eigenfunctions, and time evolutions for a broad class of spatially bounded, finite particle number, undriven, quantum systems can be computed by algorithms containing logarithmically less information than the quantities themselves. Algorithmic complexity theory asserts that such quantal systems are nonchaotic. These results are shown to be valid independent of the size of system parameters such as mass or Planck's constant, provided they are not set equal to zero or infinity. However, rather than confronting quantum mechanics with classical mechanics via the correspondence principle, we suggest a direct comparison of quantum mechanics with macroscopic laboratory reality. Specifically, we here propose the double pendulum---a simple, two-degree-of-freedom, macroscopic system exhibiting a transition to chaos as its amplitude increases---as a model suitable for testing whether a nonchaotic quantum mechanics can accurately predict laboratory observation. Neither theory nor experiment appears to offer insurmountable difficulties to the performance of this comparison.

Physical Review A•May 1, 1992•41 citations

Simulating quantum chaos without chaos

Andi Gu, Yihui Quek, Susanne F. Yelin +2 more

Quantum chaos is a quantum many-body phenomenon that is associated with a number of intricate properties, such as level repulsion in energy spectra or distinct scalings of out-of-time ordered correlation functions. In this work, we introduce a novel class of "pseudochaotic" quantum Hamiltonians that fundamentally challenges the conventional understanding of quantum chaos and its relationship to computational complexity. Our ensemble is computationally indistinguishable from the Gaussian unitary ensemble (GUE) of strongly-interacting Hamiltonians, widely considered to be a quintessential model for quantum chaos. Surprisingly, despite this effective indistinguishability, our Hamiltonians lack all conventional signatures of chaos: it exhibits Poissonian level statistics, low operator complexity, and weak scrambling properties. This stark contrast between efficient computational indistinguishability and traditional chaos indicators calls into question fundamental assumptions about the nature of quantum chaos. We, furthermore, give an efficient quantum algorithm to simulate Hamiltonians from our ensemble, even though simulating Hamiltonians from the true GUE is known to require exponential time. Our work establishes fundamental limitations on Hamiltonian learning and testing protocols and derives stronger bounds on entanglement and magic state distillation. These results reveal a surprising separation between computational and information-theoretic perspectives on quantum chaos, opening new avenues for research at the intersection of quantum chaos, computational complexity, and quantum information. Above all, it challenges conventional notions of what it fundamentally means to actually observe complex quantum systems.

arXiv:2410.18196•Oct 23, 2024•14 citations

Does quantum mechanics obey the correspondence principle? Is it complete?

Joseph Ford, Giorgio Mantica

This elementary review paper presents the compelling evidence which supports the notion that quantum mechanics is much too simple a theory to adequately describe a complex world. Rigorous arguments based on algorithmic complexity theory are used to show that both the quantum Arnol’d cat and a broad category of finite, bounded, undriven, quantum systems do not obey the correspondence principle, implying that quantum mechanics is also not complete. An experiment, well within current laboratory capability, is proposed which can expose the inability of quantum mechanics to adequately describe macroscopic chaos. In its final section, this paper describes a theoretical framework that provides a proper setting for interpreting these surprising results.

American Journal of Physics•Dec 1, 1992•84 citations

The Emergence of Chaos in Quantum Mechanics

Emilio Fiordilino

Nonlinearity in Quantum Mechanics may have extrinsic or intrinsic origins and is a liable route to a chaotic behaviour that can be of difficult observations. In this paper, we propose two forms of nonlinear Hamiltonian, which explicitly depend upon the phase of the wave function and produce chaotic behaviour. To speed up the slow manifestation of chaotic effects, a resonant laser field assisting the time evolution of the systems causes cumulative effects that might be revealed, at least in principle. The nonlinear Schrödinger equation is solved within the two-state approximation; the solution displays features with characteristics similar to those found in chaotic Classical Mechanics: sensitivity on the initial state, dense power spectrum, irregular filling of the Poincaré map and exponential separation of the trajectories of the Bloch vector σ in the Bloch sphere.

Symmetry•May 8, 2020•6 citations
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.
This paper discusses the problem of finding and defining chaos in quantum mechanics. While chaotic time evolution appears to be ubiquitous in classical mechanics, it is apparently absent in quantum mechanics in part because for a bound, isolated quantum system, the evolution of its state is multiply periodic. This has led a number of investigators to search for semiclassical signatures of chaos. Here I am concerned with the status of semiclassical mechanics as a distinct third theory of the asymptotic domain between classical and quantum mechanics. I discuss in some detail the meaning of such crucial locutions as the "classical counterpart to a quantum system" and a quantum system's "underlying classical motion". A proper elucidation of these concepts requires a semiclassical association between phase space surfaces and wave-functions. This significance of this association is discussed in some detail.
The evolution of a classically chaotic Hamiltonian system is characterised by a computational complexity that increases exponentially with the time elapsed. Quantum systems do not exhibit such behaviour. It is therefore tempting to solve a classical problem by quantising it and following the motion of a small wavepacket. This paper shows that nothing can be gained by this subterfuge: an adequate quantum simulation requires a Hilbert space whose dimension increases exponentially with the planned duration of the simulation.
We prove here that the eigenvalues, eigenfunctions, and time evolutions for a broad class of spatially bounded, finite particle number, undriven, quantum systems can be computed by algorithms containing logarithmically less information than the quantities themselves. Algorithmic complexity theory asserts that such quantal systems are nonchaotic. These results are shown to be valid independent of the size of system parameters such as mass or Planck's constant, provided they are not set equal to zero or infinity. However, rather than confronting quantum mechanics with classical mechanics via the correspondence principle, we suggest a direct comparison of quantum mechanics with macroscopic laboratory reality. Specifically, we here propose the double pendulum---a simple, two-degree-of-freedom, macroscopic system exhibiting a transition to chaos as its amplitude increases---as a model suitable for testing whether a nonchaotic quantum mechanics can accurately predict laboratory observation. Neither theory nor experiment appears to offer insurmountable difficulties to the performance of this comparison.
Quantum chaos is a quantum many-body phenomenon that is associated with a number of intricate properties, such as level repulsion in energy spectra or distinct scalings of out-of-time ordered correlation functions. In this work, we introduce a novel class of "pseudochaotic" quantum Hamiltonians that fundamentally challenges the conventional understanding of quantum chaos and its relationship to computational complexity. Our ensemble is computationally indistinguishable from the Gaussian unitary ensemble (GUE) of strongly-interacting Hamiltonians, widely considered to be a quintessential model for quantum chaos. Surprisingly, despite this effective indistinguishability, our Hamiltonians lack all conventional signatures of chaos: it exhibits Poissonian level statistics, low operator complexity, and weak scrambling properties. This stark contrast between efficient computational indistinguishability and traditional chaos indicators calls into question fundamental assumptions about the nature of quantum chaos. We, furthermore, give an efficient quantum algorithm to simulate Hamiltonians from our ensemble, even though simulating Hamiltonians from the true GUE is known to require exponential time. Our work establishes fundamental limitations on Hamiltonian learning and testing protocols and derives stronger bounds on entanglement and magic state distillation. These results reveal a surprising separation between computational and information-theoretic perspectives on quantum chaos, opening new avenues for research at the intersection of quantum chaos, computational complexity, and quantum information. Above all, it challenges conventional notions of what it fundamentally means to actually observe complex quantum systems.
This elementary review paper presents the compelling evidence which supports the notion that quantum mechanics is much too simple a theory to adequately describe a complex world. Rigorous arguments based on algorithmic complexity theory are used to show that both the quantum Arnol’d cat and a broad category of finite, bounded, undriven, quantum systems do not obey the correspondence principle, implying that quantum mechanics is also not complete. An experiment, well within current laboratory capability, is proposed which can expose the inability of quantum mechanics to adequately describe macroscopic chaos. In its final section, this paper describes a theoretical framework that provides a proper setting for interpreting these surprising results.
Nonlinearity in Quantum Mechanics may have extrinsic or intrinsic origins and is a liable route to a chaotic behaviour that can be of difficult observations. In this paper, we propose two forms of nonlinear Hamiltonian, which explicitly depend upon the phase of the wave function and produce chaotic behaviour. To speed up the slow manifestation of chaotic effects, a resonant laser field assisting the time evolution of the systems causes cumulative effects that might be revealed, at least in principle. The nonlinear Schrödinger equation is solved within the two-state approximation; the solution displays features with characteristics similar to those found in chaotic Classical Mechanics: sensitivity on the initial state, dense power spectrum, irregular filling of the Poincaré map and exponential separation of the trajectories of the Bloch vector σ in the Bloch sphere.