Faster Algorithmic Quantum and Classical Simulations by Corrected Product Formulas
arXiv:2409.08265 · doi:10.1103/phk5-slkl
Abstract
Hamiltonian simulation using product formulas is arguably the most straightforward and practical approach for algorithmic simulation of a quantum system's dynamics on a quantum computer. Here we present corrected product formulas (CPFs), a variation of product formulas achieved by injecting auxiliary terms called correctors into standard product formulas. We establish several correctors that improve the accuracy of standard product formulas by orders of magnitude when simulating Hamiltonians comprised of two exactly simulatable partitions, a common structure of lattice Hamiltonians. Importantly, injecting these correctors increases the overall simulation cost by only a small additive or multiplicative factor. We show that correctors are particularly advantageous for perturbed systems, where one partition has a relatively small norm compared to the other, as they allow the small norm to be utilized as an additional parameter for controlling the simulation error. We demonstrate the performance of CPFs by numerical simulations for several lattice Hamiltonians. Numerical results show that our theoretical error bounds for CPFs match or outperform the empirical error scaling of standard product formulas for these systems. We also demonstrate improvements offered by CPFs by implementing small-size systems on actual quantum hardware, as well as on noisy and noiseless quantum simulators. CPFs could be a valuable algorithmic tool for early fault-tolerant quantum computers with limited computing resources. As for standard product formulas, CPFs could also be used for simulations on a classical computer.
37 pages; 9 figures (extended the numerical simulations; provided better compilations for correctors; and improved presentation)
References in corpus (34)
- 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
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Universal digital quantum simulation with trapped ions
- Toward the first quantum simulation with quantum speedup
- A Theory of Trotter Error
- WHFast: A fast and unbiased implementation of a symplectic Wisdom-Holman integrator for long term gravitational simulations
- Polynomial-time quantum algorithm for the simulation of chemical dynamics
- A random compiler for fast Hamiltonian simulation
- Digital quantum simulation of fermionic models with a superconducting circuit
- Nearly optimal lattice simulation by product formulas
- Faster quantum simulation by randomization
- Quantum circuits for strongly correlated quantum systems
- Quantum localization bounds Trotter errors in digital quantum simulation
- New families of symplectic splitting methods for numerical integration in dynamical astronomy
- Limitations of Quantum Simulation Examined by Simulating a Pairing Hamiltonian using Nuclear Magnetic Resonance
- Quantum Simulation of Chemistry with Sublinear Scaling in Basis Size
- Hamiltonian simulation in the low-energy subspace
- Time-dependent unbounded Hamiltonian simulation with vector norm scaling
- Hamiltonian simulation with random inputs
- High order symplectic integrators for planetary dynamics and their implementation in REBOUND
- Efficient Product Formulas for Commutators and Applications to Quantum Simulation
- qSWIFT: High-order randomized compiler for Hamiltonian simulation
- Strong Error Bounds for Trotter & Strang-Splittings and Their Implications for Quantum Chemistry
- Composite Quantum Simulations
- Product Formulas for Exponentials of Commutators
- Entanglement accelerates quantum simulation
- Nearly optimal quantum algorithm for generating the ground state of a free quantum field theory
- State-dependent Trotter Limits and their approximations
- Doubling the order of approximation via the randomized product formula
- Selection and improvement of product formulae for best performance of quantum simulation
- Uniform observable error bounds of Trotter formulae for the semiclassical Schrödinger equation