Measuring Trotter error and its application to precision-guaranteed Hamiltonian simulations

Abstract

Trotterization is the most common and convenient approximation method for Hamiltonian simulations on digital quantum computers, but estimating its error accurately is computationally difficult for large quantum systems. Here, we develop a method for measuring the Trotter error without ancillary qubits on quantum circuits by combining the $m$th- and $n$th-order ($m<n$) Trotterizations rather than consulting with mathematical error bounds. Using this method, we make Trotterization precision-guaranteed, developing an algorithm named Trotter$(m,n)$, in which the Trotter error at each time step is within an error tolerance $\epsilon$ preset for our purpose. Trotter$(m,n)$ is applicable to both time- independent and dependent Hamiltonians, and it adaptively chooses almost the largest stepsize $\mathrm{d}t$, which keeps quantum circuits shallowest within the error tolerance. Benchmarking it in a quantum spin chain, we find the adaptively chosen $\mathrm{d}t$ to be about ten times larger than that inferred from known upper bounds of Trotter errors.

11+5 pages, 6+2 figures

References in corpus (36)

• Quantum Computing in the NISQ era and beyond
• Variational Quantum Algorithms
• Efficient simulation of one-dimensional quantum many-body systems
• Quantum Chemistry in the Age of Quantum Computing
• Simulated Quantum Computation of Molecular Energies
• Observation of a Discrete Time Crystal
• Quantum Computational Supremacy
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Quantum Error Mitigation
• Practical Quantum Error Mitigation for Near-Future Applications
• Measuring the scrambling of quantum information
• A Theory of Trotter Error
• Simulation of Electronic Structure Hamiltonians Using Quantum Computers
• Variational Quantum Computation of Excited States
• Verified Quantum Information Scrambling
• A random compiler for fast Hamiltonian simulation
• Qulacs: a fast and versatile quantum circuit simulator for research purpose
• Variational quantum algorithms for discovering Hamiltonian spectra
• Variational Fast Forwarding for Quantum Simulation Beyond the Coherence Time
• Real- and imaginary-time evolution with compressed quantum circuits
• Chemical Basis of Trotter-Suzuki Errors in Quantum Chemistry Simulation
• Loschmidt Echo
• Improved Fault-Tolerant Quantum Simulation of Condensed-Phase Correlated Electrons via Trotterization
• Adaptive Variational Quantum Dynamics Simulations
• An efficient quantum algorithm for the time evolution of parameterized circuits
• Mitigating algorithmic errors in Hamiltonian simulation
• Time-dependent unbounded Hamiltonian simulation with vector norm scaling
• Hamiltonian simulation with random inputs
• Variational quantum eigensolvers for sparse Hamiltonians
• Time-dependent Hamiltonian Simulation of Highly Oscillatory Dynamics and Superconvergence for Schrödinger Equation
• Quantum simulation of real-space dynamics
• Low-depth Hamiltonian Simulation by Adaptive Product Formula
• Improved Accuracy for Trotter Simulations Using Chebyshev Interpolation
• Problem specific classical optimization of Hamiltonian simulation
• Adaptive Trotterization for time-dependent Hamiltonian quantum dynamics using piecewise conservation laws
• Minimum Trotterization Formulas for a Time-Dependent Hamiltonian

Cited by in corpus (7)

• Fault-tolerant quantum algorithms for quantum molecular systems: A survey
• Quantum simulation of time-dependent Hamiltonians via commutator-free quasi-Magnus operators
• Probing entanglement dynamics and topological transitions on noisy intermediate-scale quantum computers
• Low Depth Phase Oracle Using a Parallel Piecewise Circuit
• Concurrence-Driven Path Entanglement in Phase-Modified Interferometry
• Gate Efficient Composition of Hamiltonian Simulation and Block-Encoding with its Application on HUBO, Chemistry and Finite Difference Method
• Diagonal-Budgeted Trotterization for Efficient Quantum Hamiltonian Simulation