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/0405189 · Physical Review E

Classical versus quantum errors in quantum computation of dynamical systems

Davide Rossini, Giuliano Benenti, Giulio Casati

Published Nov 22, 2004• 10 citations
arXivHTMLPDF

Abstract

We analyze the stability of a quantum algorithm simulating the quantum dynamics of a system with different regimes, ranging from global chaos to integrability. We compare, in these different regimes, the behavior of the fidelity of quantum motion when the system's parameters are perturbed or when there are unitary errors in the quantum gates implementing the quantum algorithm. While the first kind of errors has a classical limit, the second one has no classical analog. It is shown that, whereas in the first case ("classical errors") the decay of fidelity is very sensitive to the dynamical regime, in the second case ("quantum errors") it is almost independent of the dynamical behavior of the simulated system. Therefore, the rich variety of behaviors found in the study of the stability of quantum motion under "classical" perturbations has no correspondence in the fidelity of quantum computation under its natural perturbations. In particular, in this latter case it is not possible to recover the semiclassical regime in which the fidelity decays with a rate given by the classical Lyapunov exponent.

DOI
10.1103/physreve.70.056216

Related papers

Stability of quantum motion and correlation decay

Tomaž Prosen, Marko Znidaric

We derive a simple and general relation between the fidelity of quantum motion, characterizing the stability of quantum dynamics with respect to arbitrary static perturbation of the unitary evolution propagator, and the integrated time auto-correlation function of the generator of perturbation. Surprisingly, this relation predicts the slower decay of fidelity the faster the decay of correlations. In particular, for non-ergodic and non-mixing dynamics, where asymptotic decay of correlations is absent, a qualitatively different and faster decay of fidelity is predicted on a timescale ∝ 1/δ as opposed to mixing dynamics where the fidelity is found to decay exponentially on a timescale ∝ 1/δ 2 , where δ is the strength of perturbation. A detailed discussion of a semiclassical regime of small effective values of Planck constant is given where classical correlation functions can be used to predict quantum fidelity decay. Note that the correct and intuitively expected classical stability behaviour is recovered in the classical limit → 0, as the two limits δ → 0 and → 0 do not commute. In addition, we also discuss non-trivial dependence on the number of degrees of freedom. All the theoretical results are clearly demonstrated numerically on the celebrated example of a quantized kicked top.

arXiv:nlin/0111014•Journal of Physics A Mathematical and General•Feb 4, 2002•170 citations

Robust quantum computation of the kicked Harper model and quantum chaos

Bin Ye, Gu Rui-Jun, Wenbo Xu +1 more

The stability of quantum computating of the kicked Harper model with various perturbations is investigated. Above a certain threshold of the imperfections, quantum chaos sets in. The effects of the noise errors and the static imperfections on the quantum computation are analyzed by comparing the statistical ergodic properties and the Husimi functions of the perturbed eigenstates with the ideal eigenstates of the Floquet operator. It is shown that the fidelity decay with static imperfections is exponential while it is Gaussian with noise errors. The time scales of reliable computation with these perturbations are obtained through numerical simulations. Due to the errors in classical computation the distance of two initial states increases exponentially, while the stability of quantum computation is independent of the integrable or chaotic nature of the underlying dynamics.

Acta Physica Sinica•Jan 1, 2007•2 citations

Stability of Quantum Dynamics

Marko Žnidarič

The stability of quantum systems to perturbations of the Hamiltonian is studied. This stability is quantified by the fidelity. Dependence of fidelity on the initial state as well as on the dynamical properties of the system is considered. In particular, systems having a chaotic or regular classical limit are analysed. The fidelity decay rate is given by an integral of the correlation function of the perturbation and is thus smaller the faster correlation function decays. If the perturbation can be written as a time derivative of another operator, meaning that the time averaged perturbation vanishes, fidelity freezes at a constant value and starts to decay only after a long time inversely proportional to the perturbation strength. In composite systems stability of entanglement to perturbations of the Hamiltonian is analysed in terms of purity. For regular systems purity decay is shown to be independent of Planck's constant for coherent initial states in the semiclassical limit. The accelerated decoherence of macroscopic superpositions is also explained. The theory of fidelity decay is applied to the stability of quantum computation and an improved quantum Fourier transform algorithm is designed.

arXiv:quant-ph/0406124•Jun 17, 2004•4 citations

Quantum chaos algorithms and dissipative decoherence with quantum trajectories

Jae Weon Lee, Dima L. Shepelyansky

Using the methods of quantum trajectories we investigate the effects of dissipative decoherence in a quantum computer algorithm simulating dynamics in various regimes of quantum chaos including dynamical localization, the quantum ergodic regime, and quasi-integrable motion. As an example we use the quantum sawtooth algorithm which can be implemented in a polynomial number of quantum gates. It is shown that the fidelity of quantum computation decays exponentially with time and that the decay rate is proportional to the number of qubits, number of quantum gates, and per gate dissipation rate induced by external decoherence. In the limit of strong dissipation the quantum algorithm generates a quantum attractor which may have a complex or simple structure. We also compare the effects of dissipative decoherence with the effects of static imperfections.

arXiv:quant-ph/0501120•Physical Review E•May 5, 2005•13 citations

Observability of fidelity decay at the Lyapunov rate in few-qubit quantum simulations

Max D. Porter, Ilon Joseph

In certain regimes, the fidelity of quantum states will decay at a rate set by the classical Lyapunov exponent. This serves both as one of the most important examples of the quantum-classical correspondence principle and as an accurate test for the presence of chaos. While detecting this phenomenon is one of the first useful calculations that noisy quantum computers without error correction can perform [G. Benenti et al., Phys. Rev. E 65, 066205 (2001)], a thorough study of the quantum sawtooth map reveals that observing the Lyapunov regime is just beyond the reach of present-day devices. We prove that there are three bounds on the ability of any device to observe the Lyapunov regime and give the first quantitatively accurate description of these bounds: (1) the Fermi golden rule decay rate must be larger than the Lyapunov rate, (2) the quantum dynamics must be diffusive rather than localized, and (3) the initial decay rate must be slow enough for Lyapunov decay to be observable. This last bound, which has not been recognized previously, places a limit on the maximum amount of noise that can be tolerated. The theory implies that an absolute minimum of 6 qubits is required. Recent experiments on IBM-Q and IonQ imply that some combination of a noise reduction by up to 100 × per gate and large increases in connectivity and gate parallelization are also necessary. Finally, scaling arguments are given that quantify the ability of future devices to observe the Lyapunov regime based on trade-offs between hardware architecture and performance.

arXiv:2110.07767•Quantum•Sep 8, 2022•6 citations

Quantum chaos, dynamical stability and decoherence

Giulio Casati, Tomaž Prosen

We discuss the stability of quantum motion under system's perturbations in the light of the corresponding classical behavior. In particular we focus our attention on the so called "fidelity" or Loschmidt echo, its relation with the decay of correlations, and discuss the quantum-classical correspondence. We then report on the numerical simulation of the double-slit experiment, where the initial wave-packet is bounded inside a billiard domain with perfectly reflecting walls. If the shape of the billiard is such that the classical ray dynamics is regular, we obtain interference fringes whose visibility can be controlled by changing the parameters of the initial state. However, if we modify the shape of the billiard thus rendering classical (ray) dynamics fully chaotic, the interference fringes disappear and the intensity on the screen becomes the (classical) sum of intensities for the two corresponding one-slit experiments. Thus we show a clear and fundamental example in which transition to chaotic motion in a deterministic classical system, in absence of any external noise, leads to a profound modification in the quantum behavior.

Brazilian Journal of Physics•Jun 1, 2005•2 citations
We analyze the stability of a quantum algorithm simulating the quantum dynamics of a system with different regimes, ranging from global chaos to integrability. We compare, in these different regimes, the behavior of the fidelity of quantum motion when the system's parameters are perturbed or when there are unitary errors in the quantum gates implementing the quantum algorithm. While the first kind of errors has a classical limit, the second one has no classical analog. It is shown that, whereas in the first case ("classical errors") the decay of fidelity is very sensitive to the dynamical regime, in the second case ("quantum errors") it is almost independent of the dynamical behavior of the simulated system. Therefore, the rich variety of behaviors found in the study of the stability of quantum motion under "classical" perturbations has no correspondence in the fidelity of quantum computation under its natural perturbations. In particular, in this latter case it is not possible to recover the semiclassical regime in which the fidelity decays with a rate given by the classical Lyapunov exponent.
We derive a simple and general relation between the fidelity of quantum motion, characterizing the stability of quantum dynamics with respect to arbitrary static perturbation of the unitary evolution propagator, and the integrated time auto-correlation function of the generator of perturbation. Surprisingly, this relation predicts the slower decay of fidelity the faster the decay of correlations. In particular, for non-ergodic and non-mixing dynamics, where asymptotic decay of correlations is absent, a qualitatively different and faster decay of fidelity is predicted on a timescale ∝ 1/δ as opposed to mixing dynamics where the fidelity is found to decay exponentially on a timescale ∝ 1/δ 2 , where δ is the strength of perturbation. A detailed discussion of a semiclassical regime of small effective values of Planck constant is given where classical correlation functions can be used to predict quantum fidelity decay. Note that the correct and intuitively expected classical stability behaviour is recovered in the classical limit → 0, as the two limits δ → 0 and → 0 do not commute. In addition, we also discuss non-trivial dependence on the number of degrees of freedom. All the theoretical results are clearly demonstrated numerically on the celebrated example of a quantized kicked top.
The stability of quantum computating of the kicked Harper model with various perturbations is investigated. Above a certain threshold of the imperfections, quantum chaos sets in. The effects of the noise errors and the static imperfections on the quantum computation are analyzed by comparing the statistical ergodic properties and the Husimi functions of the perturbed eigenstates with the ideal eigenstates of the Floquet operator. It is shown that the fidelity decay with static imperfections is exponential while it is Gaussian with noise errors. The time scales of reliable computation with these perturbations are obtained through numerical simulations. Due to the errors in classical computation the distance of two initial states increases exponentially, while the stability of quantum computation is independent of the integrable or chaotic nature of the underlying dynamics.
The stability of quantum systems to perturbations of the Hamiltonian is studied. This stability is quantified by the fidelity. Dependence of fidelity on the initial state as well as on the dynamical properties of the system is considered. In particular, systems having a chaotic or regular classical limit are analysed. The fidelity decay rate is given by an integral of the correlation function of the perturbation and is thus smaller the faster correlation function decays. If the perturbation can be written as a time derivative of another operator, meaning that the time averaged perturbation vanishes, fidelity freezes at a constant value and starts to decay only after a long time inversely proportional to the perturbation strength. In composite systems stability of entanglement to perturbations of the Hamiltonian is analysed in terms of purity. For regular systems purity decay is shown to be independent of Planck's constant for coherent initial states in the semiclassical limit. The accelerated decoherence of macroscopic superpositions is also explained. The theory of fidelity decay is applied to the stability of quantum computation and an improved quantum Fourier transform algorithm is designed.
Using the methods of quantum trajectories we investigate the effects of dissipative decoherence in a quantum computer algorithm simulating dynamics in various regimes of quantum chaos including dynamical localization, the quantum ergodic regime, and quasi-integrable motion. As an example we use the quantum sawtooth algorithm which can be implemented in a polynomial number of quantum gates. It is shown that the fidelity of quantum computation decays exponentially with time and that the decay rate is proportional to the number of qubits, number of quantum gates, and per gate dissipation rate induced by external decoherence. In the limit of strong dissipation the quantum algorithm generates a quantum attractor which may have a complex or simple structure. We also compare the effects of dissipative decoherence with the effects of static imperfections.
In certain regimes, the fidelity of quantum states will decay at a rate set by the classical Lyapunov exponent. This serves both as one of the most important examples of the quantum-classical correspondence principle and as an accurate test for the presence of chaos. While detecting this phenomenon is one of the first useful calculations that noisy quantum computers without error correction can perform [G. Benenti et al., Phys. Rev. E 65, 066205 (2001)], a thorough study of the quantum sawtooth map reveals that observing the Lyapunov regime is just beyond the reach of present-day devices. We prove that there are three bounds on the ability of any device to observe the Lyapunov regime and give the first quantitatively accurate description of these bounds: (1) the Fermi golden rule decay rate must be larger than the Lyapunov rate, (2) the quantum dynamics must be diffusive rather than localized, and (3) the initial decay rate must be slow enough for Lyapunov decay to be observable. This last bound, which has not been recognized previously, places a limit on the maximum amount of noise that can be tolerated. The theory implies that an absolute minimum of 6 qubits is required. Recent experiments on IBM-Q and IonQ imply that some combination of a noise reduction by up to 100 × per gate and large increases in connectivity and gate parallelization are also necessary. Finally, scaling arguments are given that quantify the ability of future devices to observe the Lyapunov regime based on trade-offs between hardware architecture and performance.
We discuss the stability of quantum motion under system's perturbations in the light of the corresponding classical behavior. In particular we focus our attention on the so called "fidelity" or Loschmidt echo, its relation with the decay of correlations, and discuss the quantum-classical correspondence. We then report on the numerical simulation of the double-slit experiment, where the initial wave-packet is bounded inside a billiard domain with perfectly reflecting walls. If the shape of the billiard is such that the classical ray dynamics is regular, we obtain interference fringes whose visibility can be controlled by changing the parameters of the initial state. However, if we modify the shape of the billiard thus rendering classical (ray) dynamics fully chaotic, the interference fringes disappear and the intensity on the screen becomes the (classical) sum of intensities for the two corresponding one-slit experiments. Thus we show a clear and fundamental example in which transition to chaotic motion in a deterministic classical system, in absence of any external noise, leads to a profound modification in the quantum behavior.