Gate-efficient discrete simulations of continuous-time quantum query algorithms W. Berry, Dominic Cleve, Richard Gharibian, Sevag 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. 2014 info:eu-repo/semantics/article doc-type:article text http://purl.org/coar/resource_type/c_6501 https://ris.uni-paderborn.de/record/8172 W. Berry D, Cleve R, Gharibian S. Gate-efficient discrete simulations of continuous-time quantum query algorithms. <i>Quantum Information &#38; Computation</i>. 2014;14(1-2):1-30. eng info:eu-repo/semantics/altIdentifier/arxiv/1211.4637 info:eu-repo/semantics/openAccess