A Partially Random Trotter Algorithm for Quantum Hamiltonian Simulations
arXiv:2109.07987
Abstract
Given the Hamiltonian, the evaluation of unitary operators has been at the heart of many quantum algorithms. Motivated by existing deterministic and random methods, we present a hybrid approach, where Hamiltonians with large amplitude are evaluated at each time step, while the remaining terms are evaluated at random. The bound for the mean square error is obtained, together with a concentration bound. The mean square error consists of a variance term and a bias term, arising respectively from the random sampling of the Hamiltonian terms and the operator splitting error. Leveraging on the bias/variance trade-off, the error can be minimized by balancing the two. The concentration bound provides an estimate on the number of gates. The estimates are verified by using numerical experiments on classical computers.
References in corpus (14)
- Quantum algorithm for solving linear systems of equations
- Simulated Quantum Computation of Molecular Energies
- Quantum Algorithms Revisited
- Fermionic quantum computation
- A random compiler for fast Hamiltonian simulation
- Quantum speedup of Monte Carlo methods
- Gate count estimates for performing quantum chemistry on small quantum computers
- Chemical Basis of Trotter-Suzuki Errors in Quantum Chemistry Simulation
- Nearly optimal lattice simulation by product formulas
- On the Random Batch Method for second order interacting particle systems
- A comparison of the Bravyi-Kitaev and Jordan-Wigner transformations for the quantum simulation of quantum chemistry
- Operator Locality in Quantum Simulation of Fermionic Models
- Time-dependent unbounded Hamiltonian simulation with vector norm scaling
- Efficient Quantum Algorithms for Simulating Lindblad Evolution