Simulating quantum dynamics on a quantum computer

From MaRDI portal
Publication:3102253

DOI10.1088/1751-8113/44/44/445308zbMATH Open1270.81064arXiv1011.3489OpenAlexW3105523254WikidataQ59438296 ScholiaQ59438296MaRDI QIDQ3102253FDOQ3102253


Authors: Nathan Wiebe, Dominic W. Berry, Peter Høyer, Barry C. Sanders Edit this on Wikidata


Publication date: 2 December 2011

Published in: Journal of Physics A: Mathematical and Theoretical (Search for Journal in Brave)

Abstract: We present efficient quantum algorithms for simulating time-dependent Hamiltonian evolution of general input states using an oracular model of a quantum computer. Our algorithms use either constant or adaptively chosen time steps and are significant because they are the first to have time-complexities that are comparable to the best known methods for simulating time-independent Hamiltonian evolution, given appropriate smoothness criteria on the Hamiltonian are satisfied. We provide a thorough cost analysis of these algorithms that considers discretizion errors in both the time and the representation of the Hamiltonian. In addition, we provide the first upper bounds for the error in Lie-Trotter-Suzuki approximations to unitary evolution operators, that use adaptively chosen time steps.


Full work available at URL: https://arxiv.org/abs/1011.3489




Recommendations




Cited In (33)





This page was built for publication: Simulating quantum dynamics on a quantum computer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3102253)