Published January 1, 2002
| public
Journal Article
Open
Robustness of adiabatic quantum computation
- Creators
- Childs, Andrew M.
- Farhi, Edward
-
Preskill, John
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.
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.Files
CHIpra02.pdf
Files
(159.8 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:534aa1f1d38520903dcab38d57b3c689
|
159.8 kB | Preview Download |
Additional details
- Eprint ID
- 2867
- Resolver ID
- CaltechAUTHORS:CHIpra02
- Created
-
2006-05-03Created from EPrint's datestamp field
- Updated
-
2021-11-08Created from EPrint's last_modified field