English

Hamiltonian Simulation in the Interaction Picture

Quantum Physics 2019-06-07 v2

Abstract

We present a low-space overhead simulation algorithm based on the truncated Dyson series for time-dependent quantum dynamics. This algorithm is applied to simulating time-independent Hamiltonians by transitioning to the interaction picture, where some portions are made time-dependent. This can provide a favorable complexity trade-off as the algorithm scales exponentially better with derivatives of the time-dependent component than the original Hamiltonian. We show that this leads to an exponential improvement in gate complexity for simulating some classes of diagonally dominant Hamiltonian. Additionally we show that this can reduce the gate-complexity scaling for simulating NN-site Hubbard models for time tt with arbitrary long-range interactions as well as reduce the cost of quantum chemistry simulations within a similar-sized plane-wave basis to O~(N2t)\widetilde{\mathcal{O}}(N^2t) from O~(N11/3t)\widetilde{\mathcal{O}}(N^{11/3}t). We also show a quadratic improvement in query complexity for simulating sparse time-dependent Hamiltonians, which may be of independent interest.

Keywords

Cite

@article{arxiv.1805.00675,
  title  = {Hamiltonian Simulation in the Interaction Picture},
  author = {Guang Hao Low and Nathan Wiebe},
  journal= {arXiv preprint arXiv:1805.00675},
  year   = {2019}
}

Comments

30 pages, 5 figures. v2: Fix some errors in equations and figures

R2 v1 2026-06-23T01:42:29.464Z