Answers are grounded in this paper and cite their sources.
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.
No takes yet. Share an insight, caveat, or question.
Viv Kendon (2006) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: