22 citations · 62 across the 6 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
quant-ph2017★ 22 cited
Finding paths in tree graphs with a quantum walk
Daniel Koch, Mark Hillery
In this paper, we analyze the potential for new types of searches using the formalism of scattering random walks on Quantum Computers. Given a particular type of graph consisting o…
quant-ph2017★ 12 cited
Finding paths with quantum walks or quantum walking through a maze
Daniel Reitzner, Mark Hillery, Daniel Koch
We show that it is possible to use a quantum walk to find a path from one marked vertex to another. In the specific case of stars connected in a chain, one can find the path fr…