@article{8172,
  abstract     = {{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.}},
  author       = {{W. Berry, Dominic and Cleve, Richard and Gharibian, Sevag}},
  journal      = {{Quantum Information & Computation}},
  number       = {{1-2}},
  pages        = {{1--30}},
  title        = {{{Gate-efficient discrete simulations of continuous-time quantum query algorithms}}},
  volume       = {{14}},
  year         = {{2014}},
}