Efficient Sparse State Preparation with Dynamic Quantum Walks

Continuous-time quantum walks (CTQWs) on dynamic graphs are a recently introduced universal model of computation that offers a new paradigm in which to envision quantum algorithms. While it is not straightforward to implement CTQWs on dynamic graphs, it is easy to construct a dynamic CTQW equivalent of a universal gate set in the circuit model. In this talk, we discuss how to use these dynamic CTQWs to deterministically prepare quantum states in polynomial time.