Hamiltonian simulation in the interaction picture

Presenting Author: Nathan Wiebe, Microsoft Research
Contributing Author(s): Guang Hao Low

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 N-site Hubbard models for time with arbitrary long-range interactions as well as reduce the cost of quantum chemistry simulations within a similar-sized plane-wave basis to O(N^2) from O(N^(11/3)). We also show a quadratic improvement in query complexity for simulating sparse time-dependent Hamiltonians, which may be of independent interest.

Read this article online: https://arxiv.org/abs/1805.00675

(Session 5 : Sunday from 5:00pm - 7:00pm)


SQuInT Chief Organizer
Akimasa Miyake, Associate Professor

SQuInT Local Organizers
Rafael Alexander, Postdoctoral Fellow
Chris Jackson, Postdoctoral Fellow

SQuInT Administrator
Gloria Cordova
505 277-1850

SQuInT Assistant
Wendy Jay

SQuInT Founder
Ivan Deutsch, Regents' Professor, CQuIC Director

Tweet About SQuInT 2019!