SOFSEM 2008: Theory and Practice of Computer Science
Quantum walks are quantum counterparts of random walks. In the last 5 years, they have become one of main methods of designing quantum algorithms. Quantum walk based algorithms include element distinctness, spatial search, quantum speedup of Markov chains, evaluation of Boolean formulas and search...
Saved in:
| 其他作者: | |
|---|---|
| 格式: | 圖書 |
| 語言: | English |
| 出版: |
Springer
2017
|
| 主題: | |
| 在線閱讀: | http://repository.vnu.edu.vn/handle/VNU_123/29982 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | Quantum walks are quantum counterparts of random walks.
In the last 5 years, they have become one of main methods of designing quantum algorithms. Quantum walk based algorithms include element distinctness, spatial search, quantum speedup of Markov chains, evaluation of Boolean formulas and search on ”glued trees” graph. In this talk, I will describe the quantum walk method for designing search algorithms and show several of its applications. |
|---|