Analyzing Quantum Random Walks with Unitary Labeling
碩士 === 國立臺灣大學 === 電機工程學研究所 === 94 === 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...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/90045942360639621139 |