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:
| Other Authors: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Springer
2017
|
| Subjects: | |
| Online Access: | http://repository.vnu.edu.vn/handle/VNU_123/29982 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Vietnam National University, Hanoi |
| Language: | English |
| Summary: | 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. |
|---|