Efficient Sparse State Preparation with Dynamic Quantum Walks

ORAL

Abstract

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.

*DOE-145-SE-14055-CTQW-FY23, DE-AC02-06CH11357, DE-SC0024290.

–

Publication: https://arxiv.org/abs/2405.20273

Presenters

  • Rebekah Herrman

    • University of Tennessee

Authors

  • Rebekah Herrman

    • University of Tennessee

  • Alvin Gonzales

    • Argonne National Laboratory

  • Colin Campbell

    • Infleqtion

  • Ji Liu

    • Argonne National Laboratory

  • Zain H Saleem

    • Argonne National Laboratory

  • Igor Gaidai

    • The University of Tennessee Knoxville

  • Teague Tomesh

    • Infleqtion