Decoherence-Free Subspaces for Quantum Computation

D. A. Lidar, I. L. Chuang, and K. B. Whaley
Phys. Rev. Lett. 81, 2594 – Published 21 September 1998
PDFExport Citation

Abstract

Decoherence in quantum computers is formulated within the semigroup approach. The error generators are identified with the generators of a Lie algebra. This allows for a comprehensive description which includes as a special case the frequently assumed spin-boson model. A generic condition is presented for errorless quantum computation: decoherence-free subspaces are spanned by those states which are annihilated by all the generators. It is shown that these subspaces are stable to perturbations and, moreover, that universal quantum computation is possible within them.

  • Received 27 April 1998

DOI:https://doi.org/10.1103/PhysRevLett.81.2594

©1998 American Physical Society

Authors & Affiliations

D. A. Lidar1, I. L. Chuang2, and K. B. Whaley1

  • 1Department of Chemistry, The University of California, Berkeley, California 94720
  • 2IBM Almaden Research Center, San Jose, California 94120

References (Subscription Required)

Click to Expand
Issue

Vol. 81, Iss. 12 — 21 September 1998

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review Letters

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×