Robustness of adiabatic quantum computation

Andrew M. Childs, Edward Farhi, and John Preskill
Phys. Rev. A 65, 012322 – Published 14 December 2001
PDFExport Citation

Abstract

We study the fault tolerance of quantum computation by adiabatic evolution, a quantum algorithm for solving various combinatorial search problems. We describe an inherent robustness of adiabatic computation against two kinds of errors, unitary control errors and decoherence, and we study this robustness using numerical simulations of the algorithm.

  • Received 23 August 2001

DOI:https://doi.org/10.1103/PhysRevA.65.012322

©2001 American Physical Society

Authors & Affiliations

Andrew M. Childs* and Edward Farhi

  • Center for Theoretical Physics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139

John Preskill

  • Institute for Quantum Information, California Institute of Technology, Pasadena, California 91125

  • *Electronic address: amchilds@mit.edu
  • Electronic address: farhi@mit.edu
  • Electronic address: preskill@theory.caltech.edu

References (Subscription Required)

Click to Expand
Issue

Vol. 65, Iss. 1 — January 2002

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 A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×