TY - JOUR

T1 - A Partially Random Trotter Algorithm for Quantum Hamiltonian Simulations

AU - Jin, Shi

AU - Li, Xiantao

N1 - Publisher Copyright:
© 2023, Shanghai University.

PY - 2023

Y1 - 2023

N2 - 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 of the number of gates. The estimates are verified using numerical experiments on classical computers.

AB - 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 of the number of gates. The estimates are verified using numerical experiments on classical computers.

UR - http://www.scopus.com/inward/record.url?scp=85180721720&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85180721720&partnerID=8YFLogxK

U2 - 10.1007/s42967-023-00336-z

DO - 10.1007/s42967-023-00336-z

M3 - Article

AN - SCOPUS:85180721720

SN - 2096-6385

JO - Communications on Applied Mathematics and Computation

JF - Communications on Applied Mathematics and Computation

ER -