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/0102082

Efficient quantum computing insensitive to phase errors

Bertrand Georgeot, Dima L. Shepelyansky

Published Feb 16, 2001• 6 citations
arXivHTMLPDF

Abstract

We show that certain computational algorithms can be simulated on a quantum computer with exponential efficiency and be insensitive to phase errors. Our explicit algorithm simulates accurately the classical chaotic dynamics for exponentially many orbits even when the quantum fidelity drops to zero. Such phase-insensitive algorithms open new possibilities for computation on realistic quantum computers.

DOI
10.48550/arxiv.quant-ph/0102082

Related papers

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

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

Resilient Quantum Computation: Error Models and Thresholds

Knill, E H, Laflamme, R, Zurek, W H

Recent research has demonstrated that quantum computers can solve certain types of problems substantially faster than the known classical algorithms. These problems include factoring integers and certain physics simulations. Practical quantum computation requires overcoming the problems of environmental noise and operational errors, problems which appear to be much more severe than in classical computation due to the inherent fragility of quantum superpositions involving many degrees of freedom. Here we show that arbitrarily accurate quantum computations are possible provided that the error per operation is below a threshold value. The result is obtained by combining quantum error-correction, fault tolerant state recovery, fault tolerant encoding of operations and concatenation. It holds under physically realistic assumptions on the errors.

•Jan 1, 1997•296 citations

Resilient quantum computation: error models and thresholds

Emanuel Knill, Raymond Laflamme, Wojciech H. Zurek

Recent research has demonstrated that quantum computers can solve certain types of problems substantially faster than the known classical algorithms. These problems include factoring integers and certain physics simulations. Practical quantum computation requires overcoming the problems of environmental noise and operational errors, problems which appear to be much more severe than in classical computation due to the inherent fragility of quantum superpositions involving many degrees of freedom. Here we show that arbitrarily accurate quantum computations are possible provided that the error per operation is below a threshold value. The result is obtained by combining quantum error–correction, fault–tolerant state recovery, fault–tolerant encoding of operations and concatenation. It holds under physically realistic assumptions on the errors.

arXiv:quant-ph/9702058•Proceedings of the Royal Society A Mathematical Physical and Engineering Sciences•Jan 8, 1998•436 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

Exponential Gain in Quantum Computing of Quantum Chaos and Localization

Bertrand Georgeot, Dima L. Shepelyansky

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.

arXiv:quant-ph/0010005•Physical Review Letters•Mar 26, 2001•78 citations
We show that certain computational algorithms can be simulated on a quantum computer with exponential efficiency and be insensitive to phase errors. Our explicit algorithm simulates accurately the classical chaotic dynamics for exponentially many orbits even when the quantum fidelity drops to zero. Such phase-insensitive algorithms open new possibilities for computation on realistic quantum computers.
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.
Recent research has demonstrated that quantum computers can solve certain types of problems substantially faster than the known classical algorithms. These problems include factoring integers and certain physics simulations. Practical quantum computation requires overcoming the problems of environmental noise and operational errors, problems which appear to be much more severe than in classical computation due to the inherent fragility of quantum superpositions involving many degrees of freedom. Here we show that arbitrarily accurate quantum computations are possible provided that the error per operation is below a threshold value. The result is obtained by combining quantum error-correction, fault tolerant state recovery, fault tolerant encoding of operations and concatenation. It holds under physically realistic assumptions on the errors.
Recent research has demonstrated that quantum computers can solve certain types of problems substantially faster than the known classical algorithms. These problems include factoring integers and certain physics simulations. Practical quantum computation requires overcoming the problems of environmental noise and operational errors, problems which appear to be much more severe than in classical computation due to the inherent fragility of quantum superpositions involving many degrees of freedom. Here we show that arbitrarily accurate quantum computations are possible provided that the error per operation is below a threshold value. The result is obtained by combining quantum error–correction, fault–tolerant state recovery, fault–tolerant encoding of operations and concatenation. It holds under physically realistic assumptions on the errors.
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.