Selection and improvement of product formulae for best performance of quantum simulation

Abstract

Quantum algorithms for simulation of Hamiltonian evolution are often based on product formulae. The fractal methods give a systematic way to find arbitrarily high-order product formulae, but result in a large number of exponentials. On the other hand, product formulae with fewer exponentials can be found by numerical solution of simultaneous nonlinear equations. It is also possible to reduce the cost of long-time simulations by processing, where a kernel is repeated and a processor need only be applied at the beginning and end of the simulation. In this work, we found thousands of new product formulae, and numerically tested these formulae, together with many formulae from prior literature. We provide methods to fairly compare product formulae of different lengths and different orders. For the case of 8th order, we have found new product formulae with exceptional performance, about two orders of magnitude better accuracy than prior work, both in the processed and non-processed cases. The processed product formula provides the best performance due to being shorter than the non-processed product formula. It outperforms all other tested product formulae over a range of many orders of magnitude in system parameters $T$ (time) and $\epsilon$ (allowable error). That includes reasonable combinations of parameters to be used in quantum algorithms, where the size of the simulation is large enough to be classically intractable, but not so large it takes an impractically long time on a quantum computer.

arXiv commentGreatly expanded with new solutions and new comparisons to prior work. 31 pages, 2 figures

References in corpus (22)

• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Simulating Hamiltonian dynamics with a truncated Taylor series
• How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Toward the first quantum simulation with quantum speedup
• A Theory of Trotter Error
• 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
• Exponential improvement in precision for simulating sparse Hamiltonians
• Chemical Basis of Trotter-Suzuki Errors in Quantum Chemistry Simulation
• Faster quantum simulation by randomization
• Fault-Tolerant Quantum Simulations of Chemistry in First Quantization
• Splitting and composition methods in the numerical integration of differential equations
• Nearly tight Trotterization of interacting electrons
• Optimised Trotter Decompositions for Classical and Quantum Computing
• On the complexity of implementing Trotter steps
• Quantum computation of stopping power for inertial fusion target design
• Hamiltonian simulation with nearly optimal dependence on spectral norm
• Doubling the order of approximation via the randomized product formula
• Simplifying the Reinsch algorithm for the Baker-Campbell-Hausdorff series
• An algorithm based on continuation techniques for minimization problems with highly non-linear equality constraints

Cited by in corpus (4)

• Block encoding bosons by signal processing
• Accelerating two-dimensional electronic spectroscopy simulations with a probe qubit protocol
• Faster Algorithmic Quantum and Classical Simulations by Corrected Product Formulas
• Experiments with Schrödinger Cellular Automata