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:quant-ph/0010005 · Physical Review Letters

Exponential Gain in Quantum Computing of Quantum Chaos and Localization

Bertrand Georgeot, Dima L. Shepelyansky

Published Mar 26, 2001• 78 citations
arXivHTMLPDF

Abstract

We present a quantum algorithm which simulates the quantum kicked rotator model exponentially faster than classical algorithms. This shows that important physical problems of quantum chaos, localization, and Anderson transition can be modeled efficiently on a quantum computer. We also show that a similar algorithm simulates efficiently classical chaos in certain area-preserving maps.

DOI
10.1103/physrevlett.86.2890

Related papers

Quantum computing of quantum chaos in the kicked rotator model

B. Lévi, Bertrand Georgeot, Dima L. Shepelyansky

We investigate a quantum algorithm that simulates efficiently the quantum kicked rotator model, a system that displays rich physical properties and enables to study problems of quantum chaos, atomic physics, and localization of electrons in solids. The effects of errors in gate operations are tested on this algorithm in numerical simulations with up to 20 qubits. In this way various physical quantities are investigated. Some of them, such as second moment of probability distribution and tunneling transitions through invariant curves, are shown to be particularly sensitive to errors. However, investigations of the fidelity and the Wigner and Husimi distributions show that these physical quantities are robust in presence of imperfections. This implies that the algorithm can simulate the dynamics of quantum chaos in presence of a moderate amount of noise.

arXiv:quant-ph/0210154•Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics•Apr 25, 2003•40 citations

Quantum Computing of Quantum Chaos and Imperfection Effects

Pil Hun Song, Dima L. Shepelyansky

We study numerically the imperfection effects in the quantum computing of the kicked rotator model in the regime of quantum chaos. It is shown that there are two types of physical characteristics: for one of them the quantum computation errors grow exponentially with the number of qubits in the computer, while for the other the growth is polynomial. A certain similarity between classical and quantum computing errors is also discussed.

arXiv:quant-ph/0009005•Physical Review Letters•Mar 5, 2001•43 citations

Complexity of chaos and quantum computation

Bertrand Georgeot

This paper reviews recent work related to the interplay between quantum information and computation on the one hand and classical and quantum chaos on the other. First, we present several models of quantum chaos that can be simulated efficiently on a quantum computer. Then a discussion of information extraction shows that such models can give rise to complete algorithms including measurements that can achieve an increase in speed compared with classical computation. It is also shown that models of classical chaos can be simulated efficiently on a quantum computer, and again information can be extracted efficiently from the final wave function. The total gain can be exponential or polynomial, depending on the model chosen and the observable measured. The simulation of such systems is also economical in the number of qubits, allowing implementation on present-day quantum computers, some of these algorithms having been already experimentally implemented. The second topic considered concerns the analysis of errors on quantum computers. It is shown that quantum chaos algorithms can be used to explore the effect of errors on quantum algorithms, such as random unitary errors or dissipative errors. Furthermore, the tools of quantum chaos allows a direct analysis of the effects of static errors on quantum computers. Finally, we consider the different resources used by quantum information, and show that quantum chaos has some precise consequences on entanglement generation, which becomes close to maximal. For another resource, interference, a proposal is presented for quantifying it, enabling a discussion on entanglement and interference generation in quantum algorithms.

Mathematical Structures in Computer Science•Nov 23, 2007•3 citations

Stable Quantum Computation of Unstable Classical Chaos

Bertrand Georgeot, Dima L. Shepelyansky

We show on the example of the Arnold cat map that classical chaotic systems can be simulated with exponential efficiency on a quantum computer. Although classical computer errors grow exponentially with time, the quantum algorithm with moderate imperfections is able to simulate accurately the unstable chaotic classical nonlinear dynamics for long times. The algorithm can be easily implemented on systems of a few qubits.

arXiv:quant-ph/0101004•Physical Review Letters•Jun 4, 2001•46 citations

Numerical Studies of Quantum Chaos in Various Dynamical Systems

Efim B. Rozenbaum

We study two classes of quantum phenomena associated with classical chaos in a variety of quantum models: (i) dynamical localization and its extension and generalization to interacting few- and many-body systems and (ii) quantum exponential divergences in high-order correlators and other diagnostics of quantum chaos. Dynamical localization (DL) is a subtle phenomenon related to Anderson localization. It hinges on quantum interference and is typically destroyed in presence of interactions. DL often manifests as a failure of a driven system to heat up, violating the foundations of statistical physics. Kicked rotor (KR) is a prototypical chaotic classical model that exhibits linear energy growth with time. The quantum kicked rotor (QKR) features DL instead: its energy saturates. Multiple attempts of many-body generalizations faced difficulties in preserving DL. Recently, DL was shown in a special integrable many-body model. We study non-integrable models of few- and many-body QKR-like systems and provide direct evidence that DL can persist there. In addition, we show how a novel related concept of localization landscape can be applied to study transport in rippled channels. Out-of-time-ordered correlator (OTOC) was proposed as an indicator of quantum chaos, since in the semiclassical limit, this correlator's possible exponential growth rate (CGR) resembles the classical Lyapunov exponent (LE). We show that the CGR in QKR is related, but distinct from the LE in KR. We also show a singularity in the OTOC at the Ehrenfest time tᴱ due to a delay in the onset of quantum interference. Next, we study scaling of OTOC beyond tᴱ. We then explore how the OTOC-based approach to quantum chaos relates to the random-matrix-theoretical description by introducing an operator we dub the Lyapunovian. Its level statistics is calculated for quantum stadium billiard, a seminal model of quantum chaos, and aligns perfectly with the Wigner-Dyson surmise. In the semiclassical limit, the Lyapunovian reduces to the matrix of uncorrelated finite-time Lyapunov exponents, connecting the CGR at early times, when the quantum effects are weak, to universal level repulsion that hinges on strong quantum interference. Finally, we consider quantum polygonal billiards: their classical counterparts are non-chaotic. We show exponential growth of the OTOCs in these systems, sharply contrasted with the classical behavior even before quantum interference develops.

•Jan 1, 2020•0 citations

Les ordinateurs quantiques affrontent le chaos

Bertrand Georgeot, Dima L. Shepelyansky

Quantum computers facing chaos. Quantum parallelism allows to perform computation in a radically new manner. A quantum computer based on these new principles may resolve certain problems exponentially faster than a classical computer. We discuss how quantum computers can simulate complex dynamics, in particularly the dynamics of chaotic systems, where the errors of classical computation grow exponentially fast. ----- Le parallelisme autorise par la mecanique quantique permet d'effectuer des calculs d'une maniere radicalement nouvelle. Un ordinateur quantique fonde sur ces principes pourrait resoudre certains problemes exponentiellement plus vite qu'un ordinateur classique. Nous discutons comment un ordinateur quantique realiste peut simuler une dynamique complexe, en particulier les systemes chaotiques ou les fautes de l'ordinateur classique croissent exponentiellement vite.

arXiv:quant-ph/0307103•Jul 15, 2003•2 citations
We present a quantum algorithm which simulates the quantum kicked rotator model exponentially faster than classical algorithms. This shows that important physical problems of quantum chaos, localization, and Anderson transition can be modeled efficiently on a quantum computer. We also show that a similar algorithm simulates efficiently classical chaos in certain area-preserving maps.
We investigate a quantum algorithm that simulates efficiently the quantum kicked rotator model, a system that displays rich physical properties and enables to study problems of quantum chaos, atomic physics, and localization of electrons in solids. The effects of errors in gate operations are tested on this algorithm in numerical simulations with up to 20 qubits. In this way various physical quantities are investigated. Some of them, such as second moment of probability distribution and tunneling transitions through invariant curves, are shown to be particularly sensitive to errors. However, investigations of the fidelity and the Wigner and Husimi distributions show that these physical quantities are robust in presence of imperfections. This implies that the algorithm can simulate the dynamics of quantum chaos in presence of a moderate amount of noise.
This paper reviews recent work related to the interplay between quantum information and computation on the one hand and classical and quantum chaos on the other. First, we present several models of quantum chaos that can be simulated efficiently on a quantum computer. Then a discussion of information extraction shows that such models can give rise to complete algorithms including measurements that can achieve an increase in speed compared with classical computation. It is also shown that models of classical chaos can be simulated efficiently on a quantum computer, and again information can be extracted efficiently from the final wave function. The total gain can be exponential or polynomial, depending on the model chosen and the observable measured. The simulation of such systems is also economical in the number of qubits, allowing implementation on present-day quantum computers, some of these algorithms having been already experimentally implemented. The second topic considered concerns the analysis of errors on quantum computers. It is shown that quantum chaos algorithms can be used to explore the effect of errors on quantum algorithms, such as random unitary errors or dissipative errors. Furthermore, the tools of quantum chaos allows a direct analysis of the effects of static errors on quantum computers. Finally, we consider the different resources used by quantum information, and show that quantum chaos has some precise consequences on entanglement generation, which becomes close to maximal. For another resource, interference, a proposal is presented for quantifying it, enabling a discussion on entanglement and interference generation in quantum algorithms.
We study two classes of quantum phenomena associated with classical chaos in a variety of quantum models: (i) dynamical localization and its extension and generalization to interacting few- and many-body systems and (ii) quantum exponential divergences in high-order correlators and other diagnostics of quantum chaos. Dynamical localization (DL) is a subtle phenomenon related to Anderson localization. It hinges on quantum interference and is typically destroyed in presence of interactions. DL often manifests as a failure of a driven system to heat up, violating the foundations of statistical physics. Kicked rotor (KR) is a prototypical chaotic classical model that exhibits linear energy growth with time. The quantum kicked rotor (QKR) features DL instead: its energy saturates. Multiple attempts of many-body generalizations faced difficulties in preserving DL. Recently, DL was shown in a special integrable many-body model. We study non-integrable models of few- and many-body QKR-like systems and provide direct evidence that DL can persist there. In addition, we show how a novel related concept of localization landscape can be applied to study transport in rippled channels. Out-of-time-ordered correlator (OTOC) was proposed as an indicator of quantum chaos, since in the semiclassical limit, this correlator's possible exponential growth rate (CGR) resembles the classical Lyapunov exponent (LE). We show that the CGR in QKR is related, but distinct from the LE in KR. We also show a singularity in the OTOC at the Ehrenfest time tᴱ due to a delay in the onset of quantum interference. Next, we study scaling of OTOC beyond tᴱ. We then explore how the OTOC-based approach to quantum chaos relates to the random-matrix-theoretical description by introducing an operator we dub the Lyapunovian. Its level statistics is calculated for quantum stadium billiard, a seminal model of quantum chaos, and aligns perfectly with the Wigner-Dyson surmise. In the semiclassical limit, the Lyapunovian reduces to the matrix of uncorrelated finite-time Lyapunov exponents, connecting the CGR at early times, when the quantum effects are weak, to universal level repulsion that hinges on strong quantum interference. Finally, we consider quantum polygonal billiards: their classical counterparts are non-chaotic. We show exponential growth of the OTOCs in these systems, sharply contrasted with the classical behavior even before quantum interference develops.
Quantum computers facing chaos. Quantum parallelism allows to perform computation in a radically new manner. A quantum computer based on these new principles may resolve certain problems exponentially faster than a classical computer. We discuss how quantum computers can simulate complex dynamics, in particularly the dynamics of chaotic systems, where the errors of classical computation grow exponentially fast. ----- Le parallelisme autorise par la mecanique quantique permet d'effectuer des calculs d'une maniere radicalement nouvelle. Un ordinateur quantique fonde sur ces principes pourrait resoudre certains problemes exponentiellement plus vite qu'un ordinateur classique. Nous discutons comment un ordinateur quantique realiste peut simuler une dynamique complexe, en particulier les systemes chaotiques ou les fautes de l'ordinateur classique croissent exponentiellement vite.