arXiv Analytics

Sign in

arXiv:quant-ph/0206158AbstractReferencesReviewsResources

Dynamical fidelity of a solid-state quantum computation

G. P. Berman, F. Borgonovi, G. Celardo, F. M. Izrailev, D. I. Kamenev

Published 2002-06-21Version 1

In this paper we analyze the dynamics in a spin-model of quantum computer. Main attention is paid to the dynamical fidelity (associated with dynamical errors) of an algorithm that allows to create an entangled state for remote qubits. We show that in the regime of selective resonant excitations of qubits there is no any danger of quantum chaos. Moreover, in this regime a modified perturbation theory gives an adequate description of the dynamics of the system. Our approach allows to explicitly describe all peculiarities of the evolution of the system under time-dependent pulses corresponding to a quantum protocol. Specifically, we analyze, both analytically and numerically, how the fidelity decreases in dependence on the model parameters.

Comments: 9 pages, 6 figures, submitted to PRE
Journal: Phys. Rev. E 66, 056206 (2002)
Categories: quant-ph
Related articles: Most relevant | Search more
arXiv:quant-ph/0108087 (Published 2001-08-20)
'Photosynthetic' Quantum Computers?
arXiv:quant-ph/9512001 (Published 1995-12-02)
Realistic lower bounds for the factorization time of large numbers on a quantum computer
arXiv:quant-ph/9705032 (Published 1997-05-16, updated 1997-08-26)
Quantum Computing: Pro and Con