Gate-efficient discrete simulations of continuous-time quantum query algorithms (pp0001-0030)
          Dominic W. Berry, Richard Cleve, and Sevag Gharibian
          doi: https://doi.org/10.26421/QIC14.1-2-1
Abstracts: We show how to efficiently simulate continuous-time quantum query algorithms that run in time T in a manner that preserves the query complexity (within a polylogarithmic factor) while also incurring a small overhead cost in the total number of gates between queries. By small overhead, we mean T within a factor that is polylogarithmic in terms of T and a cost measure that reflects the cost of computing the driving Hamiltonian. This permits any continuous-time quantum algorithm based on an efficiently computable driving Hamiltonian to be converted into a gate-efficient algorithm with similar running time.
Key words: Quantum computation, quantum query complexity