arXiv:quant-ph/0104025AbstractReferencesReviewsResources
Perturbation Theory for Quantum Computation with Large Number of Qubits
G. P. Berman, G. D. Doolen, D. I. Kamenev, V. I. Tsifrinovich
Published 2001-04-04Version 1
We describe a new and consistent perturbation theory for solid-state quantum computation with many qubits. The errors in the implementation of simple quantum logic operations caused by non-resonant transitions are estimated. We verify our perturbation approach using exact numerical solution for relatively small (L=10) number of qubits. A preferred range of parameters is found in which the errors in processing quantum information are small. Our results are needed for experimental testing of scalable solid-state quantum computers.
Comments: 8 pages RevTex including 2 figures
Categories: quant-ph
Keywords: large number, simple quantum logic operations, solid-state quantum computation, consistent perturbation theory, scalable solid-state quantum computers
Tags: journal article
Related articles: Most relevant | Search more
arXiv:0806.2644 [quant-ph] (Published 2008-06-16)
Second-order shaped pulses for solid-state quantum computation
arXiv:quant-ph/0206158 (Published 2002-06-21)
Dynamical fidelity of a solid-state quantum computation
arXiv:quant-ph/0110069 (Published 2001-10-10)
Perturbation Approach for a Solid-State Quantum Computation