QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS

被引：427

作者：

Ambainis, Andris ^{[1
]}

机构：

[1] Univ Calif Berkeley, Div Comp Sci, Berkeley, CA 94720 USA

来源：

INTERNATIONAL JOURNAL OF QUANTUM INFORMATION | 2003年 / 1卷 / 04期

关键词：

Quantum algorithms; quantum walks; quantum search;

D O I：

10.1142/S0219749903000383

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

Quantum walks are quantum counterparts of Markov chains. In this article, we give a brief overview of quantum walks, with emphasis on their algorithmic applications.

引用

页码：507 / 518

页数：12

共 30 条

[1]

AARONSON S, P FOCS 03, P200

[2]

Aharonov D., P STOC 01, P50

[3] QUANTUM RANDOM-WALKS [J].

AHARONOV, Y ;

DAVIDOVICH, L ;

ZAGURY, N .

PHYSICAL REVIEW A, 1993, 48 (02) :1687-1690

[4]

AMBAINIS A, QUANTPH0305179

[5]

AMBAINIS A, QUANTPH0311001

[6]

[Anonymous], QUANTPH0010117

[7]

[Anonymous], P STOC 96

[8]

Bach E., QUANTPH0207008

[9]

Benioff P., 2002, AMS CONT MATH SERIES

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

Bennett, CH ;

Bernstein, E ;

Brassard, G ;

Vazirani, U .

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

← 1 2 3 →