arXiv Analytics

Sign in

arXiv:quant-ph/0405189AbstractReferencesReviewsResources

Classical versus quantum errors in quantum computation of dynamical systems

Davide Rossini, Giuliano Benenti, Giulio Casati

Published 2004-05-31Version 1

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 analogue. 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.

Comments: 8 pages, 7 figures
Journal: Phys. Rev. E 70, 056216 (2004)
Related articles: Most relevant | Search more
arXiv:quant-ph/9802029 (Published 1998-02-11, updated 1998-02-19)
On decoherence in quantum algorithm via dynamic models for quantum measurement
arXiv:quant-ph/9910091 (Published 1999-10-22, updated 2000-01-03)
Quantum CPU and Quantum Algorithm
arXiv:quant-ph/0303063 (Published 2003-03-11, updated 2003-09-19)
Programmable networks for quantum algorithms