How powerful is adiabatic quantum computation?

被引：194

作者：

van Dam, W ^{[1
]}

Mosca, M ^{[1
]}

Vazirani, U ^{[1
]}

机构：

[1] Univ Calif Berkeley, Hewlett Packard Labs, Math Sci Res Inst, Div Comp Sci, Berkeley, CA 94720 USA

来源：

42ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS | 2001年

关键词：

D O I：

10.1109/SFCS.2001.959902

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

We analyze the computational power and limitations of the recently proposed 'quantum adiabatic evolution algorithm'.

引用

页码：279 / 287

页数：9

共 18 条

[1]

ARORA S, 1994, UNPUB ROLE COCKLEVIN

[2]

BENNETT C, 9701001 QUANTPH

[3] Strengths and weaknesses of quantum computing [J].

Bennett, CH ;

Bernstein, E ;

Brassard, G ;

Vazirani, U .

SIAM JOURNAL ON COMPUTING, 1997, 26 (05) :1510-1523

[4]

Bhatia R., 1997, MATRIX ANAL

[5] Proof of Adiabatic law [J].

Born, M. ;

Fock, V. .

ZEITSCHRIFT FUR PHYSIK, 1928, 51 (3-4) :165-180

[6] A quantum adiabatic evolution algorithm applied to random instances of an NP-complete problem [J].

Farhi, E ;

Goldstone, J ;

Gutmann, S ;

Lapan, J ;

Lundgren, A ;

Preda, D .

SCIENCE, 2001, 292 (5516) :472-476

[7] Analog analogue of a digital quantum computation [J].

Farhi, E ;

Gutmann, S .

PHYSICAL REVIEW A, 1998, 57 (04) :2403-2406

[8]

FARHI E, 2000, 0001106 QUANTPH

[9]

FARHI E, 9612026 QUANTPH

[10]

FARHI F, 2000, 0007071 QUANTPH

← 1 2 →