---
res:
  bibo_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.@eng
  bibo_authorlist:
  - foaf_Person:
      foaf_givenName: Dominic
      foaf_name: W. Berry, Dominic
      foaf_surname: W. Berry
  - foaf_Person:
      foaf_givenName: Richard
      foaf_name: Cleve, Richard
      foaf_surname: Cleve
  - foaf_Person:
      foaf_givenName: Sevag
      foaf_name: Gharibian, Sevag
      foaf_surname: Gharibian
      foaf_workInfoHomepage: http://www.librecat.org/personId=71541
    orcid: 0000-0002-9992-3379
  bibo_issue: 1-2
  bibo_volume: 14
  dct_date: 2014^xs_gYear
  dct_language: eng
  dct_title: Gate-efficient discrete simulations of continuous-time quantum query
    algorithms@
...