Quantum Walks and Search Algorithms
This book addresses an interesting area of quantum computation called quantum walks, which play an important role in building quantum algorithms, in particular search algorithms. Quantum walks are the quantum analogue of classical random walks. It is known that quantum computers have great power for...
Saved in:
| 主要作者: | |
|---|---|
| 企業作者: | |
| 格式: | 電子 電子書 |
| 語言: | English |
| 出版: |
New York, NY :
Springer New York : Imprint: Springer,
2013.
|
| 版: | 1st ed. 2013. |
| 叢編: | Quantum Science and Technology,
|
| 主題: | |
| 在線閱讀: | https://doi.org/10.1007/978-1-4614-6336-8 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
書本目錄:
- Introduction
- The Postulates of Quantum Mechanics
- Introduction to Quantum Walks
- Grover's Algorithm and its Generalization
- Quantum Walks on Infinite Graphs
- Quantum Walks on Finite Graphs
- Limiting Distribution and Mixing Time
- Spatial Algorithms
- Hitting Time
- Appendix: Linear Algebra for Quantum Computation.