Hamiltonian simulation with random inputs

Abstract

The algorithmic error of digital quantum simulations is usually explored in terms of the spectral norm distance between the actual and ideal evolution operators. In practice, this worst-case error analysis may be unnecessarily pessimistic. To address this, we develop a theory of average-case performance of Hamiltonian simulation with random initial states. We relate the average-case error to the Frobenius norm of the multiplicative error and give upper bounds for the product formula (PF) and truncated Taylor series methods. As applications, we estimate average-case error for digital Hamiltonian simulation of general lattice Hamiltonians and $k$-local Hamiltonians. In particular, for the nearest-neighbor Heisenberg chain with $n$ spins, the error is quadratically reduced from $\mathcal{O}(n)$ in the worst case to $\mathcal{O}(\sqrt{n})$ on average for both the PF method and the Taylor series method. Numerical evidence suggests that this theory accurately characterizes the average error for concrete models. We also apply our results to error analysis in the simulation of quantum scrambling.

References in corpus (3)

• Simulating Hamiltonian dynamics with a truncated Taylor series
• Multipartite entanglement, quantum-error-correcting codes, and entangling power of quantum evolutions
• Chemical Basis of Trotter-Suzuki Errors in Quantum Chemistry Simulation

Cited by in corpus (31)

• General quantum algorithms for Hamiltonian simulation with applications to a non-Abelian lattice gauge theory
• Realization of quantum signal processing on a noisy quantum computer
• Implementing any Linear Combination of Unitaries on Intermediate-term Quantum Computers
• Quantum Circuits for partial differential equations via Schrödingerisation
• Entanglement accelerates quantum simulation
• Importance sampling for stochastic quantum simulations
• Fault-tolerant quantum algorithms for quantum molecular systems: A survey
• Average-case Speedup for Product Formulas
• Simple and high-precision Hamiltonian simulation by compensating Trotter error with linear combination of unitary operations
• Efficient and practical Hamiltonian simulation from time-dependent product formulas
• Scalable simulation of non-equilibrium quantum dynamics via classically optimised unitary circuits
• Time-dependent Hamiltonian Simulation via Magnus Expansion: Algorithm and Superconvergence
• Complexity of Digital Quantum Simulation in the Low-Energy Subspace: Applications and a Lower Bound
• Measuring Trotter error and its application to precision-guaranteed Hamiltonian simulations
• Polynomial Equivalence of Complexity Geometries
• Exponentially reduced circuit depths in Lindbladian simulation
• Uniform observable error bounds of Trotter formulae for the semiclassical Schrödinger equation
• Dilution of error in digital Hamiltonian simulation
• Trotterization is substantially efficient for low-energy states
• Subspace-Based Local Compilation of Variational Quantum Circuits for Large-Scale Quantum Many-Body Simulation
• Quantum phase estimation based filtering: performance analysis and application to low-energy spectral calculation
• Coarse-grained effective Hamiltonian via the Magnus Expansion for a three-level system
• Quantum eigenvalue processing
• Phase estimation with partially randomized time evolution
• Nearly query-optimal classical shadow estimation of unitary channels
• On the Trotter Error in Many-body Quantum Dynamics with Coulomb Potentials
• Faster Algorithmic Quantum and Classical Simulations by Corrected Product Formulas
• Discrete Superconvergence Analysis for Quantum Magnus Algorithms of Unbounded Hamiltonian Simulation
• Tight bound for the total time in digital-analog quantum computation
• Error Interference in Quantum Simulation
• Quantum Routing and Entanglement Dynamics Through Bottlenecks