Affiliation:
1. Optics Section, Blackett Laboratory, Imperial College, London, SW7 2BW, UK
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.
Publisher
World Scientific Pub Co Pte Lt
Subject
Physics and Astronomy (miscellaneous)
Cited by
66 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献