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

Effects of decoherence and imperfections for quantum algorithms

A. A. Pomeransky, O. V. Zhirov, Dima L. Shepelyansky

Published Jul 30, 2004• 4 citations
arXivHTMLPDF

Abstract

We study effects of static inter-qubit interactions and random errors in quantum gates on the stability of various quantum algorithms including the Grover quantum search algorithm and the quantum chaos maps. For the Grover algorithm our numerical and analytical results show existence of regular and chaotic phases depending on the static imperfection strength $ε$. The critical border $ε_c$ between two phases drops polynomially with the number of qubits $n_q$ as $ε_c \sim n_q^{-3/2}$. In the regular phase $(ε< ε_c)$ the algorithm remains robust against imperfections showing the efficiency gain $ε_c / ε$ for $ε> 2^{-n_q/2}$. In the chaotic phase $(ε> ε_c)$ the algorithm is completely destroyed. The results for the Grover algorithm are compared with the imperfection effects for quantum algorithms of quantum chaos maps where the universal law for the fidelity decay is given by the Random Matrix Theory (RMT). We also discuss a new gyroscopic quantum error correction method which allows to reduce the effect of static imperfections. In spite of this decay GYQEC allows to obtain a significant gain in the accuracy of quantum computations.

DOI
10.48550/arxiv.quant-ph/0407264

Related papers

Effects of Imperfections and Residual Inter-Qubit Interaction on Quantum Computing

Dima L. Shepelyansky, Bertrand Georgeot

We study the effects of static interqubit interactions on the accuracy of various quantum algorithms. Extensive numerical simulations show that their effect is stronger compared to external decoherence. Analytical approach based on Random Matrix Theory is developed. It gives universal law for fidelity decay induced by interqubit static interactions. This determines the time scale for reliable quantum computation in presence of realistic static imperfections and external decoherence. New polynomial algorithms are developed for simulation of complex dynamics in the regime of classical and quantum chaos, and Anderson metal- insulator transition. A generic quantum error correction method is developed; it allows to eliminate coherent effect of static errors. The theoretical results are confirmed by numerical computations with up to 28 qubits.

•Sep 15, 2004•0 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•16 citations

Stability of Quantum Computing in the Presence of Imperfections

Giuliano Benenti, Giulio Casati, Simone Montangero

We model an isolated quantum computer as a two-dimensional lattice of qubits (spin halves) with fluctuations in individual qubit energies and residual short-range inter-qubit couplings. We show that above a critical inter-qubit coupling strength, quantum chaos sets in and this results in the interaction induced dynamical thermalization and occupation numbers well described by the Fermi–Dirac distribution. This thermalization destroys the noninteracting qubit structure and sets serious requirements for the quantum computer operability. We then construct a quantum algorithm which uses qubits in an optimal way and efficiently simulates a physical model with rich and complex dynamics. The numerical study of the effect of static imperfections in the quantum computer hardware shows that the main elements of the phase space structures are accurately reproduced up to a time scale which is polynomial in the number of qubits. The errors generated by these imperfections are more significant than the errors of random noise in gate operations.

International Journal of Modern Physics B•Sep 30, 2003•3 citations

EFFECTS OF STATIC IMPERFECTIONS FOR QUANTUM COMPUTING

Giuliano Benenti, Giulio Casati

We model the quantum computer hardware as a two-dimensional lattice of qubits with static imperfections, i.e. fluctuations in individual qubit energies and residual short-range inter-qubit couplings. We show that these imperfections can lead to the emergence of quantum chaos and dynamical thermalization also in a quantum computer ideally decoupled from the environment. We discuss their effect on the stability of (i) the quantum computer hardware and (ii) an efficient quantum algorithm simulating a physical model with rich and complex dynamics described by the quantum sawtooth map.

Solvay Conference on Physics•Aug 1, 2003•0 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

Quantum Chaos and Quantum Computers

Dima L. Shepelyansky

The standard generic quantum computer model is studied analytically and numerically and the border for emergence of quantum chaos, induced by imperfections and residual inter-qubit couplings, is determined. This phenomenon appears in an isolated quantum computer without any external decoherence. The onset of quantum chaos leads to quantum computer hardware melting, strong quantum entropy growth and destruction of computer operability. The time scales for development of quantum chaos and ergodicity are determined. In spite the fact that this phenomenon is rather dangerous for quantum computing it is shown that the quantum chaos border for inter-qubit coupling is exponentially larger than the energy level spacing between quantum computer eigenstates and drops only linearly with the number of qubits n . As a result the ideal multi-qubit structure of the computer remains rather robust against imperfections. This opens a broad parameter region for a possible realization of quantum computer. The obtained results are related to the recent studies of quantum chaos in such many-body systems as nuclei, complex atoms and molecules, finite Fermi systems and quantum spin glass shards which are also reviewed in the paper.

arXiv:quant-ph/0006073•Physica Scripta•Jan 1, 2001•39 citations
We study effects of static inter-qubit interactions and random errors in quantum gates on the stability of various quantum algorithms including the Grover quantum search algorithm and the quantum chaos maps. For the Grover algorithm our numerical and analytical results show existence of regular and chaotic phases depending on the static imperfection strength εεε. The critical border εcε_cεc​ between two phases drops polynomially with the number of qubits nqn_qnq​ as εc∼nq−3/2ε_c \sim n_q^{-3/2}εc​∼nq−3/2​. In the regular phase (ε<εc)(ε< ε_c)(ε<εc​) the algorithm remains robust against imperfections showing the efficiency gain εc/εε_c / εεc​/ε for ε>2−nq/2ε> 2^{-n_q/2}ε>2−nq​/2. In the chaotic phase (ε>εc)(ε> ε_c)(ε>εc​) the algorithm is completely destroyed. The results for the Grover algorithm are compared with the imperfection effects for quantum algorithms of quantum chaos maps where the universal law for the fidelity decay is given by the Random Matrix Theory (RMT). We also discuss a new gyroscopic quantum error correction method which allows to reduce the effect of static imperfections. In spite of this decay GYQEC allows to obtain a significant gain in the accuracy of quantum computations.
We study the effects of static interqubit interactions on the accuracy of various quantum algorithms. Extensive numerical simulations show that their effect is stronger compared to external decoherence. Analytical approach based on Random Matrix Theory is developed. It gives universal law for fidelity decay induced by interqubit static interactions. This determines the time scale for reliable quantum computation in presence of realistic static imperfections and external decoherence. New polynomial algorithms are developed for simulation of complex dynamics in the regime of classical and quantum chaos, and Anderson metal- insulator transition. A generic quantum error correction method is developed; it allows to eliminate coherent effect of static errors. The theoretical results are confirmed by numerical computations with up to 28 qubits.
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.
We model an isolated quantum computer as a two-dimensional lattice of qubits (spin halves) with fluctuations in individual qubit energies and residual short-range inter-qubit couplings. We show that above a critical inter-qubit coupling strength, quantum chaos sets in and this results in the interaction induced dynamical thermalization and occupation numbers well described by the Fermi–Dirac distribution. This thermalization destroys the noninteracting qubit structure and sets serious requirements for the quantum computer operability. We then construct a quantum algorithm which uses qubits in an optimal way and efficiently simulates a physical model with rich and complex dynamics. The numerical study of the effect of static imperfections in the quantum computer hardware shows that the main elements of the phase space structures are accurately reproduced up to a time scale which is polynomial in the number of qubits. The errors generated by these imperfections are more significant than the errors of random noise in gate operations.
We model the quantum computer hardware as a two-dimensional lattice of qubits with static imperfections, i.e. fluctuations in individual qubit energies and residual short-range inter-qubit couplings. We show that these imperfections can lead to the emergence of quantum chaos and dynamical thermalization also in a quantum computer ideally decoupled from the environment. We discuss their effect on the stability of (i) the quantum computer hardware and (ii) an efficient quantum algorithm simulating a physical model with rich and complex dynamics described by the quantum sawtooth map.
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 standard generic quantum computer model is studied analytically and numerically and the border for emergence of quantum chaos, induced by imperfections and residual inter-qubit couplings, is determined. This phenomenon appears in an isolated quantum computer without any external decoherence. The onset of quantum chaos leads to quantum computer hardware melting, strong quantum entropy growth and destruction of computer operability. The time scales for development of quantum chaos and ergodicity are determined. In spite the fact that this phenomenon is rather dangerous for quantum computing it is shown that the quantum chaos border for inter-qubit coupling is exponentially larger than the energy level spacing between quantum computer eigenstates and drops only linearly with the number of qubits n . As a result the ideal multi-qubit structure of the computer remains rather robust against imperfections. This opens a broad parameter region for a possible realization of quantum computer. The obtained results are related to the recent studies of quantum chaos in such many-body systems as nuclei, complex atoms and molecules, finite Fermi systems and quantum spin glass shards which are also reviewed in the paper.