{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T16:58:51Z","timestamp":1765040331048},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,7,28]],"date-time":"2011-07-28T00:00:00Z","timestamp":1311811200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s11128-011-0263-9","type":"journal-article","created":{"date-parts":[[2011,7,27]],"date-time":"2011-07-27T09:02:33Z","timestamp":1311757353000},"page":"541-561","source":"Crossref","is-referenced-by-count":26,"title":["On the efficiency of quantum algorithms for Hamiltonian simulation"],"prefix":"10.1007","volume":"11","author":[{"given":"Anargyros","family":"Papageorgiou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chi","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,7,28]]},"reference":[{"key":"263_CR1","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/BF02650179","volume":"21","author":"R.P. Feynman","year":"1982","unstructured":"Feynman R.P.: Simulating physics with computers. Int. J. Theoret. Phys. 21, 467\u2013488 (1982)","journal-title":"Int. J. Theoret. Phys."},{"key":"263_CR2","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1126\/science.273.5278.1073","volume":"273","author":"S. Lloyd","year":"1996","unstructured":"Lloyd S.: Universal quantum simulators. Science 273, 1073\u20131078 (1996)","journal-title":"Science"},{"key":"263_CR3","doi-asserted-by":"crossref","first-page":"18681","DOI":"10.1073\/pnas.0808245105","volume":"105","author":"I. Kassal","year":"2008","unstructured":"Kassal I., Jordan S.P., Love P.J., Mohseni M., Aspuru-Guzik A.: Polynomial-time quantum algorithm for the simulation of chemical dynamics. Proc. Nat. Acad. Sci. 105, 18681 (2008)","journal-title":"Proc. Nat. Acad. Sci."},{"key":"263_CR4","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1126\/science.1177838","volume":"326","author":"I. Buluta","year":"2009","unstructured":"Buluta I., Nori F.: Quantum simulators. Science 326, 108 (2009)","journal-title":"Science"},{"key":"263_CR5","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1098\/rspa.1998.0162","volume":"454","author":"C. Zalka","year":"1998","unstructured":"Zalka C.: Simulating quantum systems on a quantum computer. Proc. R. Soc. Lond. A 454, 313 (1998)","journal-title":"Proc. R. Soc. Lond. A"},{"key":"263_CR6","doi-asserted-by":"crossref","first-page":"877","DOI":"10.1002\/(SICI)1521-3978(199811)46:6\/8<877::AID-PROP877>3.0.CO;2-A","volume":"46","author":"C. Zalka","year":"1998","unstructured":"Zalka C.: Efficient simulation of quantum systems by quantum computers. Fortschritte der Physik 46, 877 (1998)","journal-title":"Fortschritte der Physik"},{"key":"263_CR7","doi-asserted-by":"crossref","unstructured":"Aharonov, D., Ta-Shma, A.: Adiabatic quantum state generation and statistical zero knowledge. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, pp. 20\u201329 (2003)","DOI":"10.1145\/780543.780546"},{"key":"263_CR8","unstructured":"Farhi, E., Goldstone, J., Gutmann, S., Sipser M.: Quantum computation by adiabatic evolution, quant-ph\/0001106 (2000)"},{"key":"263_CR9","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1023\/A:1019609420309","volume":"1","author":"A. Childs","year":"2002","unstructured":"Childs A., Farhi E., Gutmann S.: An example of the difference between quantum and classical random walks. J. Quant. Inf. Proc. 1, 35\u201343 (2002)","journal-title":"J. Quant. Inf. Proc."},{"key":"263_CR10","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A Quantum algorithm for the Hamiltonian NAND Tree, quant-ph\/0702144 (2007)"},{"key":"263_CR11","doi-asserted-by":"crossref","first-page":"180501","DOI":"10.1103\/PhysRevLett.102.180501","volume":"102","author":"A. Childs","year":"2009","unstructured":"Childs A.: Universal computation by quantum walk. Phys. Rev. Lett. 102, 180501 (2009)","journal-title":"Phys. Rev. Lett."},{"key":"263_CR12","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1007\/s00220-009-0930-1","volume":"294","author":"A. Childs","year":"2010","unstructured":"Childs A.: On the relationship between continuous- and discrete-time quantum walk. Commun. Math. Phys 294, 581\u2013603 (2010)","journal-title":"Commun. Math. Phys"},{"key":"263_CR13","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/s00220-006-0150-x","volume":"270","author":"D.W. Berry","year":"2007","unstructured":"Berry D.W., Ahokas G., Cleve R., Sanders B.C.: Efficient quantum algorithms for simulating sparse Hamiltonians. Commun. Math. Phys. 270, 359 (2007)","journal-title":"Commun. Math. Phys."},{"key":"263_CR14","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0375-9601(90)90962-N","volume":"146","author":"M. Suzuki","year":"1990","unstructured":"Suzuki M.: Fractal decomposition of exponential operators with application to many-body theories and Monte Carlo simulations. Phys. Lett. A 146, 319\u2013323 (1990)","journal-title":"Phys. Lett. A"},{"key":"263_CR15","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1063\/1.529425","volume":"32","author":"M. Suzuki","year":"1991","unstructured":"Suzuki M.: General theory of fractal path integrals with application to many-body theories and statistical physics. J. Math. Phys. 32, 400\u2013407 (1991)","journal-title":"J. Math. Phys."},{"key":"263_CR16","doi-asserted-by":"crossref","first-page":"065203","DOI":"10.1088\/1751-8113\/43\/6\/065203","volume":"43","author":"N. Wiebe","year":"2010","unstructured":"Wiebe N., Berry D., Hoyer P., Sanders B.C.: Higher order decompositions of ordered operator exponentials. J. Phys. A: Math. Theor. 43, 065203 (2010)","journal-title":"J. Phys. A: Math. Theor."},{"key":"263_CR17","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1017\/S0269964800142032","volume":"14","author":"B. Klar","year":"2000","unstructured":"Klar B.: Bounds on tail probabilities of discrete distributions. Probab. Eng. Inf. Sci. 14, 161\u2013171 (2000)","journal-title":"Probab. Eng. Inf. Sci."},{"key":"263_CR18","volume-title":"Handbook of Mathematical Functions","author":"M. Abramowitz","year":"1972","unstructured":"Abramowitz M., Stegun A.: Handbook of Mathematical Functions. Dover, New York (1972)"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-011-0263-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-011-0263-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-011-0263-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T09:09:33Z","timestamp":1560416973000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-011-0263-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,7,28]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["263"],"URL":"https:\/\/doi.org\/10.1007\/s11128-011-0263-9","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,7,28]]}}}