分析單一標記的量子隨機漫步

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.