Time-dependent Hamiltonian Simulation via Magnus Expansion: Algorithm and Superconvergence

Abstract

Hamiltonian simulation becomes more challenging as the underlying unitary becomes more oscillatory. In such cases, an algorithm with commutator scaling and a weak dependence, such as logarithmic, on the derivatives of the Hamiltonian is desired. We introduce a new time-dependent Hamiltonian simulation algorithm based on the Magnus series expansion that exhibits both features. Importantly, when applied to unbounded Hamiltonian simulation in the interaction picture, we prove that the commutator in the second-order algorithm leads to a surprising fourth-order superconvergence, with an error preconstant independent of the number of spatial grids. This extends the qHOP algorithm [An, Fang, Lin, Quantum 2022] based on first-order Magnus expansion, and the proof of superconvergence is based on semiclassical analysis that is of independent interest.

45 pages

References in corpus (39)

• Adiabatic Quantum Computing
• The Magnus expansion and some of its applications
• Hamiltonian Simulation by Qubitization
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Quantum control theory and applications: A survey
• Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
• Floquet-Magnus Theory and Generic Transient Dynamics in Periodically Driven Many-Body Quantum Systems
• Quantum Simulation of Electronic Structure with Linear Depth and Connectivity
• Hamiltonian simulation with nearly optimal dependence on all parameters
• Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space
• Nearly optimal lattice simulation by product formulas
• Higher Order Decompositions of Ordered Operator Exponentials
• Optimal control, geometry, and quantum computing
• Black-box quantum state preparation without arithmetic
• Time-dependent Hamiltonian simulation with $L^1$-norm scaling
• Hamiltonian simulation in the low-energy subspace
• Provably accurate simulation of gauge theories and bosonic systems
• Time-dependent unbounded Hamiltonian simulation with vector norm scaling
• Simulating the dynamics of time-dependent Hamiltonians with a truncated Dyson series
• Time-marching based quantum solvers for time-dependent linear differential equations
• Bounding the costs of quantum simulation of many-body physics in real space
• Nearly tight Trotterization of interacting electrons
• Hamiltonian simulation with random inputs
• Hybridized Methods for Quantum Simulation in the Interaction Picture
• Block-encoding structured matrices for data input in quantum computing
• First-Order Trotter Error from a Second-Order Perspective
• Destructive Error Interference in Product-Formula Lattice Simulation
• Time-dependent Hamiltonian Simulation of Highly Oscillatory Dynamics and Superconvergence for Schrödinger Equation
• On the complexity of implementing Trotter steps
• Quantum simulation of real-space dynamics
• Quantum computation of stopping power for inertial fusion target design
• On efficient quantum block encoding of pseudo-differential operators
• Exponentially faster implementations of Select(H) for fermionic Hamiltonians
• On Quantum Speedups for Nonconvex Optimization via Quantum Tunneling Walks
• Quantum algorithms for escaping from saddle points
• Large-scale simulations of Floquet physics on near-term quantum computers
• Efficient and practical Hamiltonian simulation from time-dependent product formulas
• Observable Error Bounds of the Time-splitting Scheme for Quantum-Classical Molecular Dynamics

Cited by in corpus (5)

• Unifying framework for quantum simulation algorithms for time-dependent Hamiltonian dynamics
• Quantum Computing Beyond Ground State Electronic Structure: A Review of Progress Toward Quantum Chemistry Out of the Ground State
• On the Trotter Error in Many-body Quantum Dynamics with Coulomb Potentials
• Simulating quantum collision models with Hamiltonian simulations using early fault-tolerant quantum computers
• Discrete Superconvergence Analysis for Quantum Magnus Algorithms of Unbounded Hamiltonian Simulation