Robustness of adiabatic quantum computation

被引：349

作者：

Childs, AM ^{[1
]}

Farhi, E

Preskill, J

机构：

[1] MIT, Ctr Theoret Phys, Cambridge, MA 02139 USA

[2] CALTECH, Inst Quantum Informat, Pasadena, CA 91125 USA

来源：

PHYSICAL REVIEW A | 2002年 / 65卷 / 01期

关键词：

Algorithms - Combinatorial mathematics - Computational methods - Computer simulation - Error analysis - Fault tolerant computer systems - Hamiltonians - Perturbation techniques - Problem solving;

D O I：

10.1103/PhysRevA.65.012322

中图分类号：

O43 [光学];

学科分类号：

070207 ; 0803 ;

摘要：

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.

引用

页码：123221 / 1232210

页数：10

共 23 条

[1] ON THE COMPUTATIONAL-COMPLEXITY OF ISING SPIN-GLASS MODELS [J].