Efficient quantum walk on a quantum processor
Citations Over TimeTop 10% of 2016 papers
Abstract
The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise, quantum walks have shown much potential as a framework for developing new quantum algorithms. Here we present explicit efficient quantum circuits for implementing continuous-time quantum walks on the circulant class of graphs. These circuits allow us to sample from the output probability distributions of quantum walks on circulant graphs efficiently. We also show that solving the same sampling problem for arbitrary circulant quantum circuits is intractable for a classical computer, assuming conjectures from computational complexity theory. This is a new link between continuous-time quantum walks and computational complexity theory and it indicates a family of tasks that could ultimately demonstrate quantum supremacy over classical computers. As a proof of principle, we experimentally implement the proposed quantum circuit on an example circulant graph using a two-qubit photonics quantum processor.
Related Papers
- → Efficient quantum circuit implementation of quantum walks(2009)101 cited
- → Design of Quantum Circuits for Random Walk Algorithms(2012)9 cited
- Can quantum walks provide exponential speedups(2007)
- Can quantum walks provide practical exponential speedups(2007)
- → Quantum walk search algorithm based on phase matching and circuit cmplementation(2015)