Quantum simulation of time-dependent Hamiltonians via commutator-free quasi-Magnus operators
arXiv:2403.13889 · doi:10.22331/q-2024-12-17-1567
Abstract
Hamiltonian simulation is arguably the most fundamental application of quantum computers. The Magnus operator is a popular method for time-dependent Hamiltonian simulation in computational mathematics, yet its usage requires the implementation of exponentials of commutators, which has previously made it unappealing for quantum computing. The development of commutator-free quasi-Magnus operators (CFQMs) circumvents this obstacle, at the expense of a lack of provable global numeric error bounds. In this work, we establish one such error bound for CFQM-based time-dependent quantum Hamiltonian simulation by carefully estimating the error of each step involved in their definition. This allows us to compare its cost with the alternatives, and show that CFQMs are often the most efficient product-formula technique available by more than an order of magnitude. As a result, we find that CFQMs may be particularly useful to simulate time-dependent Hamiltonians on early fault-tolerant quantum computers.
arXiv comment32 pages, 7 figures
References in corpus (41)
- The Magnus expansion and some of its applications
- Simulating Hamiltonian dynamics with a truncated Taylor series
- Toward the first quantum simulation with quantum speedup
- A Theory of Trotter Error
- A random compiler for fast Hamiltonian simulation
- Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space
- High-order quantum algorithm for solving linear differential equations
- Exponential improvement in precision for simulating sparse Hamiltonians
- Quantum algorithm for linear differential equations with exponentially improved dependence on precision
- Optimal adaptive control for quantum metrology with time-dependent Hamiltonians
- Nearly optimal lattice simulation by product formulas
- Higher Order Decompositions of Ordered Operator Exponentials
- Optimal control, geometry, and quantum computing
- Quantum algorithm for simulating real time evolution of lattice Hamiltonians
- Quantum spectral methods for differential equations
- High-order commutator-free exponential time-propagation of driven quantum systems
- Time-dependent Hamiltonian simulation with -norm scaling
- Quantum Simulation of Chemistry with Sublinear Scaling in Basis Size
- Quantum algorithm for non-homogeneous linear partial differential equations
- Simulating the dynamics of time-dependent Hamiltonians with a truncated Dyson series
- Time-dependent unbounded Hamiltonian simulation with vector norm scaling
- Hamiltonian Simulation in the Interaction Picture
- Theory of robust multi-qubit non-adiabatic gates for trapped-ions
- Time-dependent Hamiltonian Simulation of Highly Oscillatory Dynamics and Superconvergence for Schrödinger Equation
- Systematic Magnus-based approach for suppressing leakage and non-adiabatic errors in quantum dynamics
- Quantum algorithm for time-dependent Hamiltonian simulation by permutation expansion
- Numerical time propagation of quantum systems in radiation fields
- Linear and logarithmic time compositions of quantum many-body operators
- Efficient Product Formulas for Commutators and Applications to Quantum Simulation
- Product Formulas for Exponentials of Commutators
- Analytic Filter Function Derivatives for Quantum Optimal Control
- Optimal Hamiltonian simulation for time-periodic systems
- Adaptive Trotterization for time-dependent Hamiltonian quantum dynamics using piecewise conservation laws
- Minimum Trotterization Formulas for a Time-Dependent Hamiltonian
- Exponential propagators for the Schrödinger equation with a time-dependent potential
- Measuring Trotter error and its application to precision-guaranteed Hamiltonian simulations
- Efficient Magnus-type integrators for solar energy conversion in Hubbard models
- Approximating exponentials of commutators by optimized product formulas
- Hamiltonian Simulation in the Interaction Picture Using the Magnus Expansion
- Quantum simulation of highly-oscillatory many-body Hamiltonians for near-term devices
- The hardness of quantum spin dynamics