A Unified Framework for Quantum Random Walk Algorithms on General Graphs
Date Issued
2007
Date
2007
Author(s)
Yang, Yu-Han
DOI
en-US
Abstract
In the literature, several quantum computation algorithms have been shown to have superiority over their classical counterparts. The most recent one is quantum random walks. We propose a unified framework for quantum walk algorithms on general graphs. We introduce the concept of unitary labeling into the quantum walk algorithm, and also provide another solution with intermediate measurement if the unitary constraint is not satisfied. We also demonstrate that the designed algorithms maintain the quantum interfering property with a few examples.
Subjects
量子演算法
隨機漫步
quantum algorithm
random walk
Type
thesis