Title: Discrete quantum walks, embeddings and designs
We construct a quantum walk from an embedding of a graph. This generalizes a search algorithm due to Patel, Raghunathan and Rungta. We show that when the embedding satisfies certain design theoretic conditions, the walk can be seen as a continuous quantum walk on some oriented graph.
200 University Avenue West
Waterloo, ON N2L 3G1