Work

Quantum Walks on General Graphs

Year: 2006

Type: article

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.

Source: International Journal of Quantum Information

DOI: 10.1142/s0219749906002195

Author: VIV KENDON

Institution: Imperial College London

Language: English

Topic: Quantum Computing Algorithms and Architecture

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: Kempe Foundation, Engineering and Physical Sciences Research Council

OpenAlex ID: W2007672744

FWCI: 9.53

Cites: 19

Cited by: 114

Related to: 10