Quantum algorithm for time-dependent Hamiltonian simulation by permutation expansion

Abstract

We present a quantum algorithm for the dynamical simulation of time-dependent Hamiltonians. Our method involves expanding the interaction-picture Hamiltonian as a sum of generalized permutations, which leads to an integral-free Dyson series of the time-evolution operator. Under this representation, we perform a quantum simulation for the time-evolution operator by means of the linear combination of unitaries technique. We optimize the time steps of the evolution based on the Hamiltonian's dynamical characteristics, leading to a gate count that scales with an $L^1$-norm-like scaling with respect only to the norm of the interaction Hamiltonian, rather than that of the total Hamiltonian. We demonstrate that the cost of the algorithm is independent of the Hamiltonian's frequencies, implying its advantage for systems with highly oscillating components, and for time-decaying systems the cost does not scale with the total evolution time asymptotically. In addition, our algorithm retains the near optimal $\log (1/\epsilon )/\log \log (1/\epsilon )$ scaling with simulation error $\epsilon$.

References in corpus (15)

• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Elucidating Reaction Mechanisms on Quantum Computers
• Synthesis of Quantum Logic Circuits
• Quantum simulation of time-dependent Hamiltonians and the convenient illusion of Hilbert space
• Low Depth Quantum Simulation of Electronic Structure
• Exponential improvement in precision for simulating sparse Hamiltonians
• Optimal adaptive control for quantum metrology with time-dependent Hamiltonians
• Time-dependent Hamiltonian simulation with $L^1$-norm scaling
• Simulating Quantum Dynamics On A Quantum Computer
• Simulating the dynamics of time-dependent Hamiltonians with a truncated Dyson series
• Hamiltonian Simulation in the Interaction Picture
• Quantum Algorithm for Simulating Hamiltonian Dynamics with an Off-diagonal Series Expansion
• Permutation Matrix Representation Quantum Monte Carlo
• Calculating the divided differences of the exponential function by addition and removal of inputs

Cited by in corpus (22)

• Time-marching based quantum solvers for time-dependent linear differential equations
• Efficient Fully-Coherent Quantum Signal Processing Algorithms for Real-Time Dynamics Simulation
• Time-dependent Hamiltonian Simulation of Highly Oscillatory Dynamics and Superconvergence for Schrödinger Equation
• Constant-Depth Circuits for Dynamic Simulations of Materials on Quantum Computers
• Perturbative quantum simulation
• Efficient Hamiltonian Simulation for Solving Option Price Dynamics
• Fault-tolerant quantum algorithms for quantum molecular systems: A survey
• Quantum Simulation of Second-Quantized Hamiltonians in Compact Encoding
• Optimal Hamiltonian simulation for time-periodic systems
• Adaptive Trotterization for time-dependent Hamiltonian quantum dynamics using piecewise conservation laws
• Parallel Quantum Algorithm for Hamiltonian Simulation
• An integral-free representation of the Dyson series using divided differences
• Quantum simulation of time-dependent Hamiltonians via commutator-free quasi-Magnus operators
• Unifying framework for quantum simulation algorithms for time-dependent Hamiltonian dynamics
• Cost of Emulating a Small Quantum Annealing Problem in the Circuit-Model
• Some Error Analysis for the Quantum Phase Estimation Algorithms
• Scalable Quantum Computational Science: A Perspective from Block-Encodings and Polynomial Transformations
• Prospects for NMR Spectral Prediction on Fault-Tolerant Quantum Computers
• Simulating quantum collision models with Hamiltonian simulations using early fault-tolerant quantum computers
• Engineering Precise and Robust Effective Hamiltonians
• Advanced measurement techniques in quantum Monte Carlo: The permutation matrix representation approach
• A simple quantum simulation algorithm with near-optimal precision scaling