Abstract
Trotterization is the most common and convenient approximation method for Hamiltonian simulations on digital quantum computers, but estimating its error accurately is computationally difficult for large quantum systems. Here, we develop a method for measuring the Trotter error without ancillary qubits on quantum circuits by combining the mth- and nth-order (m<n) Trotterizations rather than consulting with mathematical error bounds. Using this method, we make Trotterization precision guaranteed, developing an algorithm named Trotter(m,n), in which the Trotter error at each time step is within an error tolerance ε preset for our purpose. Trotter(m,n) is applicable to both time-independent and -dependent Hamiltonians, and it adaptively chooses almost the largest step size δt, which keeps quantum circuits shallowest, within the error tolerance. Benchmarking it in a quantum spin chain, we find the adaptively chosen δt to be about 10 times larger than that inferred from known upper bounds of Trotter errors. Published by the American Physical Society 2024
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
