arXiv:quant-ph/0009005 · Physical Review Letters

Quantum Computing of Quantum Chaos and Imperfection Effects

Pil Hun Song, Dima L. Shepelyansky

Published Mar 5, 2001• 42 citations

Abstract

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.

DOI: 10.1103/physrevlett.86.2162

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/0210154Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topicsApr 25, 200341 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 SinicaJan 1, 20072 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/0010005Physical Review LettersMar 26, 200177 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/0006073Physica ScriptaJan 1, 200131 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 ScienceNov 23, 20074 citations

Quantum Chaos & 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.

Jan 1, 20010 citations