[{"type":"journal_article","issue":"1-2","status":"public","oa":1,"date_created":"2019-03-01T11:59:24Z","user_id":"71541","citation":{"short":"D. W. Berry, R. Cleve, S. Gharibian, Quantum Information &#38; Computation 14 (2014) 1–30.","ama":"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.","mla":"W. Berry, Dominic, et al. “Gate-Efficient Discrete Simulations of Continuous-Time Quantum Query Algorithms.” <i>Quantum Information &#38; Computation</i>, vol. 14, no. 1–2, 2014, pp. 1–30.","apa":"W. Berry, D., Cleve, R., &#38; Gharibian, S. (2014). Gate-efficient discrete simulations of continuous-time quantum query algorithms. <i>Quantum Information &#38; Computation</i>, <i>14</i>(1–2), 1–30.","ieee":"D. W. Berry, R. Cleve, and S. Gharibian, “Gate-efficient discrete simulations of continuous-time quantum query algorithms,” <i>Quantum Information &#38; Computation</i>, vol. 14, no. 1–2, pp. 1–30, 2014.","chicago":"W. Berry, Dominic, Richard Cleve, and Sevag Gharibian. “Gate-Efficient Discrete Simulations of Continuous-Time Quantum Query Algorithms.” <i>Quantum Information &#38; Computation</i> 14, no. 1–2 (2014): 1–30.","bibtex":"@article{W. Berry_Cleve_Gharibian_2014, title={Gate-efficient discrete simulations of continuous-time quantum query algorithms}, volume={14}, number={1–2}, journal={Quantum Information &#38; Computation}, author={W. Berry, Dominic and Cleve, Richard and Gharibian, Sevag}, year={2014}, pages={1–30} }"},"extern":"1","page":"1-30","year":"2014","department":[{"_id":"596"}],"intvolume":"        14","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1211.4637","open_access":"1"}],"author":[{"last_name":"W. Berry","first_name":"Dominic","full_name":"W. Berry, Dominic"},{"last_name":"Cleve","first_name":"Richard","full_name":"Cleve, Richard"},{"full_name":"Gharibian, Sevag","id":"71541","last_name":"Gharibian","first_name":"Sevag","orcid":"0000-0002-9992-3379"}],"publication":"Quantum Information & Computation","article_type":"original","external_id":{"arxiv":["1211.4637"]},"date_updated":"2019-03-06T21:59:56Z","abstract":[{"lang":"eng","text":"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."}],"publication_status":"published","_id":"8172","title":"Gate-efficient discrete simulations of continuous-time quantum query algorithms","volume":14}]