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

Journal of Physics A Mathematical and General

Quantum simulation of classically chaotic systems

Asher Peres, Lawrence S. Schulman

Published Oct 21, 1988• 4 citations
Publisher

Abstract

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.

DOI
10.1088/0305-4470/21/20/009

Related papers

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

Chaotic evolution in quantum mechanics

Asher Peres

A quantum system is described whose wave function has a complexity that increases exponentially with time. Namely, for any fixed orthonormal basis, the number of components required for an accurate representation of the wave function increases exponentially.

arXiv:chao-dyn/9508003•Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•May 1, 1996•8 citations

Quantum Simulations

Antti Regelin

Quantum simulation involves using a quantum system to study another quantum system. The proposal to simulate quantum physics using quantum mechanical devices, as outlined by Richard Feynman in 1982, stems from classical computers' challenges in simulating quantum systems. The pursuit of simulating complex quantum systems has led to the intersection of quantum mechanics and quantum computing. This offers new opportunities to understand and manipulate the quantum world. Central to describing quantum dynamics is the Hamiltonian operator $\hat{H}$, which governs the time evolution of physical systems and serves as the mathematical foundation for quantum simulations. This thesis explores the methodologies and advancements in simulating Hamiltonian operators on quantum computers, focusing on decomposing these operators into quantum gates and the efficiency gains over classical computational approaches. Initially, the thesis explains the fundamental theory and basics of quantum computing. Further it dives into the foundations of the Hamiltonian operator within quantum mechanics, highlighting its role in describing the dynamics of quantum systems. The complexity and high-dimensional nature of Hamiltonian matrices necessitate using quantum computers to simulate quantum phenomena accurately and efficiently. The process of simulating the Hamiltonian operator on a quantum computer involves a detailed examination of the strategies for decomposing the operator into a sequence of quantum gates. This decomposition is crucial for translating the abstract mathematical description of quantum systems into the physical operations of a quantum computer. By utilizing the principles of quantum mechanics, such as superposition and entanglement, quantum gates manipulate qubits to mimic the evolution of quantum states as the Hamiltonian operator dictates. Latter portions of the thesis are dedicated to comparing the efficiency of quantum simulations against traditional classical simulations and inspecting efficient quantum simulations. Quantum computers offer a polynomial or an exponential speedup for certain classes of problems, such as those involving highly entangled quantum states or requiring the simulation of complex quantum dynamics. This advantage is due to the quantum computer's ability to naturally represent and process quantum information - a task for which classical computers require exponential resources as the system size increases. The efficiency of simulating the Hamiltonian operator on a quantum computer is further enhanced through optimization techniques and algorithmic improvements. These include error mitigation strategies and the development of quantum algorithms tailored to specific types of Hamiltonian operators. The thesis presents a comprehensive analysis of these methods, demonstrating how they make quantum simulations more practical and accessible for scientific research and technological development. In conclusion this thesis is a literature review that examines the transformative potential of quantum simulations. By efficiently simulating the Hamiltonian operator on quantum computers researchers can explore quantum phenomena with precision, paving the way for breakthroughs in quantum physics, materials science, and beyond. The advancements in quantum computing technology and algorithmic approaches discussed here highlight the current capabilities and future explorations in the quantum realm.

•Sep 9, 2026•0 citations

Ergodicity probes: using time-fluctuations to measure the Hilbert space dimension

Charlie Nation, Diego Porras

Quantum devices, such as quantum simulators, quantum annealers, and quantum computers, may be exploited to solve problems beyond what is tractable with classical computers. This may be achieved as the Hilbert space available to perform such `calculations' is far larger than that which may be classically simulated. In practice, however, quantum devices have imperfections, which may limit the accessibility to the whole Hilbert space. We thus determine that the dimension of the space of quantum states that are available to a quantum device is a meaningful measure of its functionality, though unfortunately this quantity cannot be directly experimentally determined. Here we outline an experimentally realisable approach to obtaining the required Hilbert space dimension of such a device to compute its time evolution, by exploiting the thermalization dynamics of a probe qubit. This is achieved by obtaining a fluctuation-dissipation theorem for high-temperature chaotic quantum systems, which facilitates the extraction of information on the Hilbert space dimension via measurements of the decay rate, and time-fluctuations.

arXiv:1906.06206•Quantum•Dec 2, 2019•11 citations

Chaos and Quantum Mechanics

Salman Habib, Tanmoy Bhattacharya A, Benjamin D. Greenbaum +3 more

The relationship between chaos and quantum mechanics has been somewhat uneasy--even stormy, in the minds of some people. However, much of the confusion may stem from inappropriate comparisons using formal analyses. In contrast, our starting point here is that a complete dynamical description requires a full understanding of the evolution of measured systems, necessary to explain actual experimental results. This is of course true, both classically and quantum mechanically. Because the evolution of the physical state is now conditioned on measurement results, the dynamics of such systems is intrinsically nonlinear even at the level of distribution functions. Due to this feature, the physically more complete treatment reveals the existence of dynamical regimes--such as chaos--that have no direct counterpart in the linear (unobserved) case. Moreover, this treatment allows for understanding how an effective classical behavior can result from the dynamics of an observed quantum system, both at the level of trajectories as well as distribution functions. Finally, we have the striking prediction that time-series from measured quantum systems can be chaotic far from the classical regime, with Lyapunov exponents differing from their classical values. These predictions can be tested in next-generation experiments.

arXiv:quant-ph/0505085•Annals of the New York Academy of Sciences•Jun 1, 2005•27 citations

Limitations for Quantum Algorithms to Solve Turbulent and Chaotic Systems

Dylan Lewis, Stephan Eidenbenz, Balasubramanya Nadiga +1 more

We investigate the limitations of quantum computers for solving nonlinear dynamical systems. In particular, we tighten the worst-case bounds of the quantum Carleman linearisation (QCL) algorithm [Liu et al., PNAS 118, 2021] answering one of their open questions. We provide a further significant limitation for any quantum algorithm that aims to output a quantum state that approximates the normalized solution vector. Given a natural choice of coordinates for a dynamical system with one or more positive Lyapunov exponents and solutions that grow sub-exponentially, we prove that any such algorithm has complexity scaling at least exponentially in the integration time. As such, an efficient quantum algorithm for simulating chaotic systems or regimes is likely not possible.

arXiv:2307.09593•Quantum•Oct 24, 2024•22 citations
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.
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.
Quantum simulation involves using a quantum system to study another quantum system. The proposal to simulate quantum physics using quantum mechanical devices, as outlined by Richard Feynman in 1982, stems from classical computers' challenges in simulating quantum systems. The pursuit of simulating complex quantum systems has led to the intersection of quantum mechanics and quantum computing. This offers new opportunities to understand and manipulate the quantum world. Central to describing quantum dynamics is the Hamiltonian operator H^\hat{H}H^, which governs the time evolution of physical systems and serves as the mathematical foundation for quantum simulations. This thesis explores the methodologies and advancements in simulating Hamiltonian operators on quantum computers, focusing on decomposing these operators into quantum gates and the efficiency gains over classical computational approaches. Initially, the thesis explains the fundamental theory and basics of quantum computing. Further it dives into the foundations of the Hamiltonian operator within quantum mechanics, highlighting its role in describing the dynamics of quantum systems. The complexity and high-dimensional nature of Hamiltonian matrices necessitate using quantum computers to simulate quantum phenomena accurately and efficiently. The process of simulating the Hamiltonian operator on a quantum computer involves a detailed examination of the strategies for decomposing the operator into a sequence of quantum gates. This decomposition is crucial for translating the abstract mathematical description of quantum systems into the physical operations of a quantum computer. By utilizing the principles of quantum mechanics, such as superposition and entanglement, quantum gates manipulate qubits to mimic the evolution of quantum states as the Hamiltonian operator dictates. Latter portions of the thesis are dedicated to comparing the efficiency of quantum simulations against traditional classical simulations and inspecting efficient quantum simulations. Quantum computers offer a polynomial or an exponential speedup for certain classes of problems, such as those involving highly entangled quantum states or requiring the simulation of complex quantum dynamics. This advantage is due to the quantum computer's ability to naturally represent and process quantum information - a task for which classical computers require exponential resources as the system size increases. The efficiency of simulating the Hamiltonian operator on a quantum computer is further enhanced through optimization techniques and algorithmic improvements. These include error mitigation strategies and the development of quantum algorithms tailored to specific types of Hamiltonian operators. The thesis presents a comprehensive analysis of these methods, demonstrating how they make quantum simulations more practical and accessible for scientific research and technological development. In conclusion this thesis is a literature review that examines the transformative potential of quantum simulations. By efficiently simulating the Hamiltonian operator on quantum computers researchers can explore quantum phenomena with precision, paving the way for breakthroughs in quantum physics, materials science, and beyond. The advancements in quantum computing technology and algorithmic approaches discussed here highlight the current capabilities and future explorations in the quantum realm.
Quantum devices, such as quantum simulators, quantum annealers, and quantum computers, may be exploited to solve problems beyond what is tractable with classical computers. This may be achieved as the Hilbert space available to perform such `calculations' is far larger than that which may be classically simulated. In practice, however, quantum devices have imperfections, which may limit the accessibility to the whole Hilbert space. We thus determine that the dimension of the space of quantum states that are available to a quantum device is a meaningful measure of its functionality, though unfortunately this quantity cannot be directly experimentally determined. Here we outline an experimentally realisable approach to obtaining the required Hilbert space dimension of such a device to compute its time evolution, by exploiting the thermalization dynamics of a probe qubit. This is achieved by obtaining a fluctuation-dissipation theorem for high-temperature chaotic quantum systems, which facilitates the extraction of information on the Hilbert space dimension via measurements of the decay rate, and time-fluctuations.
The relationship between chaos and quantum mechanics has been somewhat uneasy--even stormy, in the minds of some people. However, much of the confusion may stem from inappropriate comparisons using formal analyses. In contrast, our starting point here is that a complete dynamical description requires a full understanding of the evolution of measured systems, necessary to explain actual experimental results. This is of course true, both classically and quantum mechanically. Because the evolution of the physical state is now conditioned on measurement results, the dynamics of such systems is intrinsically nonlinear even at the level of distribution functions. Due to this feature, the physically more complete treatment reveals the existence of dynamical regimes--such as chaos--that have no direct counterpart in the linear (unobserved) case. Moreover, this treatment allows for understanding how an effective classical behavior can result from the dynamics of an observed quantum system, both at the level of trajectories as well as distribution functions. Finally, we have the striking prediction that time-series from measured quantum systems can be chaotic far from the classical regime, with Lyapunov exponents differing from their classical values. These predictions can be tested in next-generation experiments.
We investigate the limitations of quantum computers for solving nonlinear dynamical systems. In particular, we tighten the worst-case bounds of the quantum Carleman linearisation (QCL) algorithm [Liu et al., PNAS 118, 2021] answering one of their open questions. We provide a further significant limitation for any quantum algorithm that aims to output a quantum state that approximates the normalized solution vector. Given a natural choice of coordinates for a dynamical system with one or more positive Lyapunov exponents and solutions that grow sub-exponentially, we prove that any such algorithm has complexity scaling at least exponentially in the integration time. As such, an efficient quantum algorithm for simulating chaotic systems or regimes is likely not possible.