Journal of Computational and Theoretical Nanoscience · 2013 · 50 citations · 17 references
Natural SciencesMathematicsPhysicsMathematical PhysicsQuantum MechanicsStochastic ProcessesMarkov ChainsMarkov ProcessesQuantum DynamicsQuantum StatisticsRandom WalksEigenvectorsPositive RecurrenceQuantum Random WalksQuantum WalksRecurrenceRecurrence Properties
We study a quantum walk (QW) whose time evolution is induced by a random walk (RW) first introduced by Szegedy ( 2004).We focus on a relation between recurrent properties of the RW and localization of the corresponding QW.We find the following two fundamental derivations of localization of the QW.The first one is the set of all the ℓ 2 summable eigenvectors of the corresponding RW.The second one is the orthogonal complement, whose eigenvalues are ±1, of the subspace induced by the RW.In particular, as a consequence, for an infinite half line, we show that localization of the QW can be ensured by the positive recurrence of the corresponding RWs, and also that the existence of only one self loop affects localization properties.
17
Quantum random-walk search algorithm
Neil Shenvi, Julia Kempe, K. Birgitta Whaley · Physical Review A · 2003 · 1.2K citations · Full text
Computing, Computer Science, Physics +11
Quantum Walk Algorithm for Element Distinctness
Andris Ambainis · SIAM Journal on Computing · 2007 · 730 citations
Quantum Speed-Up of Markov Chain Based Algorithms
Márió Szegedy · 2004 · 629 citations