Quantum simulation of highly-oscillatory many-body Hamiltonians for near-term devices
Guannan Chen, Mohammadali Foroozandeh, Chris Budd, Pranav Singh

TL;DR
This paper introduces a fourth-order Magnus expansion quantum algorithm that efficiently simulates highly-oscillatory many-body Hamiltonians on near-term quantum devices, reducing circuit depth and complexity.
Contribution
It develops a novel technique to eliminate commutator terms in the Magnus expansion, enabling efficient simulation of time-dependent Hamiltonians with larger time-steps.
Findings
Single time-step cost is comparable to time-independent cases.
Achieves shorter circuit depths than lower-order and other fourth-order methods.
Effective for highly-oscillatory Hamiltonians in NMR applications.
Abstract
We develop a fourth-order Magnus expansion based quantum algorithm for the simulation of many-body problems involving two-level quantum systems with time-dependent Hamiltonians, . A major hurdle in the utilization of the Magnus expansion is the appearance of a commutator term which leads to prohibitively long circuits. We present a technique for eliminating this commutator and find that a single time-step of the resulting algorithm is only marginally costlier than that required for time-stepping with a time-independent Hamiltonian, requiring only three additional single-qubit layers. For a large class of Hamiltonians appearing in liquid-state nuclear magnetic resonance (NMR) applications, we further exploit symmetries of the Hamiltonian and achieve a surprising reduction in the expansion, whereby a single time-step of our fourth-order method has a circuit structure and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum and electron transport phenomena · Advanced NMR Techniques and Applications · Quantum Computing Algorithms and Architecture
