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 |
| id |
oai:112.137.131.14:VNU_123-29982 |
|---|---|
| record_format |
dspace |
| spelling |
oai:112.137.131.14:VNU_123-299822020-06-09T08:13:48Z SOFSEM 2008: Theory and Practice of Computer Science Geffert, V., Karhumäki J., Bertoni A., Preneel B., Návrat P., Bieliková, M. Computer Science 004 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. 2017-04-17T08:49:54Z 2017-04-17T08:49:54Z 2008 Book 9783540775652 http://repository.vnu.edu.vn/handle/VNU_123/29982 en 806 p. application/pdf Springer |
| institution |
Vietnam National University, Hanoi |
| building |
VNU Library & Information Center |
| country |
Vietnam |
| collection |
VNU Digital Repository |
| language |
English |
| topic |
Computer Science 004 |
| spellingShingle |
Computer Science 004 SOFSEM 2008: Theory and Practice of Computer Science |
| description |
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. |
| author2 |
Geffert, V., Karhumäki |
| author_facet |
Geffert, V., Karhumäki |
| format |
Book |
| title |
SOFSEM 2008: Theory and Practice of Computer Science |
| title_short |
SOFSEM 2008: Theory and Practice of Computer Science |
| title_full |
SOFSEM 2008: Theory and Practice of Computer Science |
| title_fullStr |
SOFSEM 2008: Theory and Practice of Computer Science |
| title_full_unstemmed |
SOFSEM 2008: Theory and Practice of Computer Science |
| title_sort |
sofsem 2008: theory and practice of computer science |
| publisher |
Springer |
| publishDate |
2017 |
| url |
http://repository.vnu.edu.vn/handle/VNU_123/29982 |
| _version_ |
1680967313835163648 |