A Caltech Library Service

Robustness of adiabatic quantum computation

Childs, Andrew M. and Farhi, Edward and Preskill, John (2002) Robustness of adiabatic quantum computation. Physical Review A, 65 (1). Art. No. 012322. ISSN 1050-2947. doi:10.1103/PhysRevA.65.012322.

See Usage Policy.


Use this Persistent URL to link to this item:


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.

Item Type:Article
Related URLs:
URLURL TypeDescription
Additional Information:©2001 The American Physical Society Received 23 August 2001; published 14 December 2001 We thank Todd Brun, Evan Fortunato, Jeffrey Goldstone, Sam Gutmann, Jeff Kimble, Alesha Kitaev, and Seth Lloyd for helpful discussions. A.M.C. gratefully acknowledges the support of the Fannie and John Hertz Foundation. This work was supported in part by the Department of Energy under Grant No. DE-FG03-92-ER40701 and Grant No. DE-FC02-94-ER40818, by the National Science Foundation under Grant No. EIA-0086038, by the Caltech MURI Center for Quantum Networks under ARO Grant No. DAAD19-00-1-0374, by the National Security Agency (NSA) and Advanced Research and Development Activity (ARDA) under Army Research Office (ARO) Contract No. DAAD19-01-1-0656, and by an IBM Faculty Partnership Award.
Issue or Number:1
Record Number:CaltechAUTHORS:CHIpra02
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:2867
Deposited By: Archive Administrator
Deposited On:03 May 2006
Last Modified:08 Nov 2021 19:51

Repository Staff Only: item control page