文档介绍：arXiv:quant-ph/0210064 v1 10 Oct 2002
h edo lsia loihs h applica the algorithms, classical co provides of chains field Markov the classical Within to transiti walks. these non-zero a of has relation which The of each operations, chains unitary Markov of wa classical random discrete quantum generalizing time algorithms Discrete evolution. time continuous
a vnulyla oetrl e algorithms. new entirely f wa to direction pr lead random new eventually a useful quantum provides may possess also a Opt may It from and implementation. walk. algorithm physical algorithms random search search quantum The this established of In the kind 9]. certain model. 8, a walk v known[7, from random a derived t the to be be on may previous can based these However, algorithms of some quantum counterparts. that no of hoped classical features is their it promising algorit walks, than the quantum random novel of of build terms One to in which 5]. on 4, framework 3, intuitive 2, [1, counterparts
eti ucin:W ilsay will We functions: certain
iiaiisaddffrne ewe h admwl search V. walk Sec. prov random in and the presented algorithm between are search differences walk and random similarities the describes III Sec.
ewl osdrtedsrt-iemdlonly. adja proba model small) the discrete-time (exponentially walk the an consider continuous-time is evolution will there the time we times continuous In small a i for to model even rise 6]. walk gives obtaine 5, random which quantum Hamiltonian be [4, second could in The advances introduced algorithmic walks. random similar quantum that hoped and approximation be new providing revolutionary, quite been
n
hsoeao cso ibr space Hilbert a on acts operator This
H
S
≥
urn eerhue w itntmdl o unu rando quantum for models distinct two uses research Current
eetsuiso unu admwlshv ugse htt that suggested have walks random quantum of studies Recent
Notation:
h ae sognzda Ipoie re in brief a provides II Sec. follows. anized is paper The
h iceetm