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/0312120 · The European Physical Journal D

Quantum chaos and random matrix theory for fidelity decay in quantum computations with static imperfections

Klaus M. Frahm, Robert Fleckinger, Dima L. Shepelyansky

Published Mar 24, 2004• 67 citations
arXivHTMLPDF
DOI
10.1140/epjd/e2004-00038-x

Related papers

Effects of decoherence and imperfections for quantum algorithms

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

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.

arXiv:quant-ph/0407264•Jul 30, 2004•4 citations

Quantum Chaos Systems and Fidelity

Joanna K. Kalaga, A. Kowalewska-Kudłaszyk, W. Leoński

Acta Physiologica Hungarica•Nov 1, 2006•3 citations

Fidelity decay for complex quantum dynamics and quantum computations

Tomaž Prosen

•Sep 12, 2006•0 citations

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

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

Lecture Notes on Information Scrambling, Quantum Chaos, and Haar-Random States

Marcin Płodzień

Information scrambling, the process by which quantum information spreads and becomes effectively inaccessible, is central to modern quantum statistical physics and quantum chaos. These lecture notes provide an introduction to information scrambling from both static and dynamical perspectives. The spectral properties of reduced density matrices arising from Haar-random states are developed through the geometry of the unitary group and the universal results of random matrix theory. This geometric framework yields universal, model-independent predictions for entanglement and spectral statistics, capturing generic features of quantum chaos without reference to microscopic details. Dynamical diagnostics such as the spectral form factor and out-of-time-ordered correlators further reveal the onset of chaos in time-dependent evolution. The notes are aimed at advanced undergraduate and graduate students in physics, mathematics, and computer science who are interested in the connections between quantum chaos, information dynamics, and quantum computing. Concepts such as entanglement growth, Haar randomness, random-matrix statistics, and unitary t-designs are introduced through their realization in random quantum circuits and circuit complexity. The same mathematical framework also underpins modern quantum-device benchmarking, where approximate unitary designs and random circuits translate geometric ideas into quantitative tools for assessing fidelity, noise, and scrambling efficiency in real quantum processors.

quant-pharXiv:2511.14397•Nov 19, 2025•9 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.
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.
Information scrambling, the process by which quantum information spreads and becomes effectively inaccessible, is central to modern quantum statistical physics and quantum chaos. These lecture notes provide an introduction to information scrambling from both static and dynamical perspectives. The spectral properties of reduced density matrices arising from Haar-random states are developed through the geometry of the unitary group and the universal results of random matrix theory. This geometric framework yields universal, model-independent predictions for entanglement and spectral statistics, capturing generic features of quantum chaos without reference to microscopic details. Dynamical diagnostics such as the spectral form factor and out-of-time-ordered correlators further reveal the onset of chaos in time-dependent evolution. The notes are aimed at advanced undergraduate and graduate students in physics, mathematics, and computer science who are interested in the connections between quantum chaos, information dynamics, and quantum computing. Concepts such as entanglement growth, Haar randomness, random-matrix statistics, and unitary t-designs are introduced through their realization in random quantum circuits and circuit complexity. The same mathematical framework also underpins modern quantum-device benchmarking, where approximate unitary designs and random circuits translate geometric ideas into quantitative tools for assessing fidelity, noise, and scrambling efficiency in real quantum processors.