Abstract
Quantum walks, both discrete (coined) and continuous time, on a general graph of N vertices with undirected edges are reviewed in some detail. The resource requirements for implementing a quantum walk as a program on a quantum computer are compared and found to be very similar for both discrete and continuous time walks. The role of the oracle, and how it changes if more prior information about the graph is available, is also discussed.
| Original language | English |
|---|---|
| Pages (from-to) | 791-805 |
| Number of pages | 15 |
| Journal | International Journal of Quantum Information |
| Volume | 4 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - 31 Oct 2006 |
Keywords
- quantum algorithms
- quantum information
- quantum walks
- continuous time systems
- quantum computers
- quantum theory
- continuous-time
- general graph
- prior information
- quantum walk
- resource requirements
- graph structures