Analyzing Quantum Random Walks with Unitary Labeling
Date Issued
2006
Date
2006
Author(s)
Chang, Tzu-Hsuan
DOI
en-US
Abstract
In this thesis, we discover a new way to analyze quantum random walks over general graphs. We first define distance of the graph to compare classical random walks and quantum random walks. Then we run unitary quantum random walk algorithm over general graphs and do discover the existence of the advantages of the quantum walks. Next we perform the algorithm to solve a tiny problem “Tile Puzzle”. During the simulation, we find out the rules in how to choose the solution of edge-coloring problems. Finally, we define the general form of unitary quantum random walk and discuss the characteristic of the formula.
Subjects
隨機漫步
單位量子隨機漫步
測量的量子隨機漫步
quantum random walk
QWUL
QWIM
quantum random walk with measurement
Type
thesis
File(s)![Thumbnail Image]()
Loading...
Name
ntu-95-R93921034-1.pdf
Size
23.31 KB
Format
Adobe PDF
Checksum
(MD5):7b8e47cabee76e07051b08fd3815777a