Universal Fault-Tolerant Quantum Computation on Decoherence-Free Subspaces

D. Bacon, J. Kempe, D. A. Lidar, and K. B. Whaley
Phys. Rev. Lett. 85, 1758 – Published 21 August 2000
PDFExport Citation

Abstract

A general scheme to perform universal, fault-tolerant quantum computation within decoherence-free subspaces (DFSs) is presented. At most two-qubit interactions are required, and the system remains within the DFS throughout the entire implementation of a quantum gate. We show explicitly how to perform universal computation on clusters of the four-qubit DFS encoding one logical qubit each under spatially symmetric (collective) decoherence. Our results have immediate relevance to quantum computer implementations in which quantum logic is implemented through exchange interactions, such as the recently proposed spin-spin coupled quantum dot arrays and donor-atom arrays.

  • Received 20 September 1999

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

©2000 American Physical Society

Authors & Affiliations

D. Bacon1,2, J. Kempe1,3,4, D. A. Lidar1,*, and K. B. Whaley1

  • 1Department of Chemistry, University of California, Berkeley, California 94720
  • 2Physics Department, University of California, Berkeley, California 94720
  • 3Mathematics Department, University of California, Berkeley, California 94720
  • 4École Nationale Superieure des Télécommunications, Paris, France 75634

  • *Permanent address: Department of Chemistry, 80 St. George Street, University of Toronto, Toronto, Ontario, Canada M5S 3H6.

References (Subscription Required)

Click to Expand
Issue

Vol. 85, Iss. 8 — 21 August 2000

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
×