Quantum walks on general graphs

Tools

Kendon, Viv (2006) Quantum walks on general graphs. International Journal of Quantum Information, 4 (5). pp. 791-805. ISSN 1793-6918 (https://doi.org/10.1142/S0219749906002195)

[thumbnail of Kendon-IJQI-2006-Quantum-walks-on-general-graphs]
Preview
 Text. Filename: Kendon_IJQI_2006_Quantum_walks_on_general_graphs.pdf
Accepted Author Manuscript
Download (155kB)| Preview

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.

ORCID iDs

Kendon, Viv ORCID logoORCID: https://orcid.org/0000-0002-6551-3056;
CORE (COnnecting REpositories)