Simulating the dynamics of time-dependent Hamiltonians with a truncated Dyson series

Abstract

We provide a general method for efficiently simulating time-dependent Hamiltonian dynamics on a circuit-model based quantum computer. Our approach is based on approximating the truncated Dyson series of the evolution operator, extending the earlier proposal by Berry to evolution generated by explicitly time-dependent Hamiltonians. Two alternative strategies are proposed to implement time ordering while exploiting the superposition principle for sampling the Hamiltonian at different times. The resource cost of our simulation algorithm retains the optimal logarithmic dependence on the inverse of the desired precision.

References in corpus (20)

• Quantum Computing in the NISQ era and beyond
• Quantum Simulation
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• A Quantum Approximate Optimization Algorithm
• Simulated Quantum Computation of Molecular Energies
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Simulation of Many-Body Fermi Systems on a Universal Quantum Computer
• On the relationship between continuous- and discrete-time quantum walk
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Hamiltonian simulation with nearly optimal dependence on all parameters
• Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space
• Efficient Distributed Quantum Computing
• Optimal adaptive control for quantum metrology with time-dependent Hamiltonians
• Higher Order Decompositions of Ordered Operator Exponentials
• The methodology of resonant equiangular composite quantum gates
• Improved Techniques for Preparing Eigenstates of Fermionic Hamiltonians
• Exponentially more precise quantum simulation of fermions I: Quantum chemistry in second quantization
• Black-box quantum state preparation without arithmetic
• Simulating Quantum Dynamics On A Quantum Computer

Cited by in corpus (44)

• Quantum computational chemistry
• Quantum Chemistry in the Age of Quantum Computing
• A Theory of Trotter Error
• Nearly optimal lattice simulation by product formulas
• Quantum algorithm for simulating real time evolution of lattice Hamiltonians
• Fault-Tolerant Quantum Simulations of Chemistry in First Quantization
• Time-dependent Hamiltonian simulation with $L^1$-norm scaling
• Simulating Quantum Materials with Digital Quantum Computers
• Time-marching based quantum solvers for time-dependent linear differential equations
• Quantum Algorithms for Estimating Physical Quantities using Block-Encodings
• Hybridized Methods for Quantum Simulation in the Interaction Picture
• Practical Quantum Computing: solving the wave equation using a quantum approach
• Time-dependent Hamiltonian Simulation of Highly Oscillatory Dynamics and Superconvergence for Schrödinger Equation
• Perturbative quantum simulation
• Quantum algorithm for time-dependent Hamiltonian simulation by permutation expansion
• Quantum algorithm for time-dependent differential equations using Dyson series
• An efficient quantum algorithm for preparation of uniform quantum superposition states
• Toward simulating Superstring/M-theory on a quantum computer
• Nearly-optimal state preparation for quantum simulations of lattice gauge theories
• Quantum simulation of battery materials using ionic pseudopotentials
• Improved Accuracy for Trotter Simulations Using Chebyshev Interpolation
• Improved Quantum Computing with the Higher-order Trotter Decomposition
• Fault-tolerant quantum algorithms for quantum molecular systems: A survey
• Optimal Hamiltonian simulation for time-periodic systems
• Efficient and precise quantum simulation of ultra-relativistic quark-nucleus scattering
• Exponentially faster implementations of Select(H) for fermionic Hamiltonians
• Floquet engineering of continuous-time quantum walks: towards the simulation of complex and next-to-nearest neighbor couplings
• Parallel Quantum Algorithm for Hamiltonian Simulation
• TFermion: A non-Clifford gate cost assessment library of quantum phase estimation algorithms for quantum chemistry
• Fast digital methods for adiabatic state preparation
• Practicality of quantum adiabatic algorithm for chemistry applications
• Time-dependent Hamiltonian Simulation via Magnus Expansion: Algorithm and Superconvergence
• TE-PAI: Exact Time Evolution by Sampling Random Circuits
• Quantum algorithm for the Vlasov simulation of the large-scale structure formation with massive neutrinos
• Quantum simulation of time-dependent Hamiltonians via commutator-free quasi-Magnus operators
• Statistics of topological defects across a phase transition in a digital superconducting quantum processor
• Quantifying athermality and quantum induced deviations from classical fluctuation relations
• 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
• Multi-target quantum compilation algorithm
• On the Trotter Error in Many-body Quantum Dynamics with Coulomb Potentials
• Divergence-free algorithms for solving nonlinear differential equations on quantum computers
• Discrete Superconvergence Analysis for Quantum Magnus Algorithms of Unbounded Hamiltonian Simulation
• Quantum Gates via Dynamical Decoupling of Central Qubit on IBMQ and 15NV Center in Diamond