Simple and high-precision Hamiltonian simulation by compensating Trotter error with linear combination of unitary operations

Abstract

Trotter and linear-combination-of-unitary (LCU) are two popular Hamiltonian simulation methods. We propose Hamiltonian simulation algorithms using LCU to compensate Trotter error, which enjoy both of their advantages. By adding few gates after the Kth-order Trotter, we realize a better time scaling than 2Kth-order Trotter. Our first algorithm exponentially improves the accuracy scaling of the Kth-order Trotter formula. In the second algorithm, we consider the detailed structure of Hamiltonians and construct LCU for Trotter errors with commutator scaling. Consequently, for lattice Hamiltonians, the algorithm enjoys almost linear system-size dependence and quadratically improves the accuracy of the Kth-order Trotter.

44 pages, 17 figures. Comments are welcome

References in corpus (38)

• Quantum algorithm for solving linear systems of equations
• Simulated Quantum Computation of Molecular Energies
• Hamiltonian Simulation by Qubitization
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Elucidating Reaction Mechanisms on Quantum Computers
• Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Toward the first quantum simulation with quantum speedup
• A Theory of Trotter Error
• A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery
• Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
• Hamiltonian simulation with nearly optimal dependence on all parameters
• A random compiler for fast Hamiltonian simulation
• Even more efficient quantum computations of chemistry through tensor hypercontraction
• Low Depth Quantum Simulation of Electronic Structure
• Quantum computing enhanced computational catalysis
• Qubitization of Arbitrary Basis Quantum Chemistry Leveraging Sparsity and Low Rank Factorization
• Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers
• Nearly optimal lattice simulation by product formulas
• Near-optimal ground state preparation
• Faster quantum simulation by randomization
• Efficient synthesis of universal Repeat-Until-Success circuits
• Quantum localization bounds Trotter errors in digital quantum simulation
• A randomized quantum algorithm for statistical phase estimation
• Hamiltonian simulation in the low-energy subspace
• Mitigating algorithmic errors in Hamiltonian simulation
• Concentration for random product formulas
• Nearly tight Trotterization of interacting electrons
• Hamiltonian simulation with random inputs
• Computing Ground State Properties with Early Fault-Tolerant Quantum Computers
• Randomizing multi-product formulas for Hamiltonian simulation
• Destructive Error Interference in Product-Formula Lattice Simulation
• Accelerated quantum Monte Carlo with mitigated error on noisy quantum computer
• Hamiltonian simulation with nearly optimal dependence on spectral norm
• Composite Quantum Simulations
• Doubling the order of approximation via the randomized product formula
• Exploiting anticommutation in Hamiltonian simulation

Cited by in corpus (6)

• Fault-tolerant quantum algorithms for quantum molecular systems: A survey
• Block encoding bosons by signal processing
• Exponentially reduced circuit depths in Lindbladian simulation
• On the Trotter Error in Many-body Quantum Dynamics with Coulomb Potentials
• High-precision and low-depth quantum algorithm design for eigenstate problems
• Simulating sparse SYK model with a randomized algorithm on a trapped-ion quantum computer