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:
| Main Author: | |
|---|---|
| Corporate Author: | |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
New York, NY :
Springer New York : Imprint: Springer,
2013.
|
| Edition: | 1st ed. 2013. |
| Series: | Quantum Science and Technology,
|
| Subjects: | |
| Online Access: | https://doi.org/10.1007/978-1-4614-6336-8 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- 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.