Salvato in:
Dettagli Bibliografici
Autori principali: Ikeda, Tatsuhiko N., Kono, Hideki, Fujii, Keisuke
Natura: Preprint
Pubblicazione: 2023
Soggetti:
Accesso online:https://arxiv.org/abs/2307.05406
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866913504922959872
author Ikeda, Tatsuhiko N.
Kono, Hideki
Fujii, Keisuke
author_facet Ikeda, Tatsuhiko N.
Kono, Hideki
Fujii, Keisuke
contents 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 $m$th- and $n$th-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 stepsize $\mathrm{d}t$, which keeps quantum circuits shallowest within the error tolerance. Benchmarking it in a quantum spin chain, we find the adaptively chosen $\mathrm{d}t$ to be about ten times larger than that inferred from known upper bounds of Trotter errors.
format Preprint
id arxiv_https___arxiv_org_abs_2307_05406
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Measuring Trotter error and its application to precision-guaranteed Hamiltonian simulations
Ikeda, Tatsuhiko N.
Kono, Hideki
Fujii, Keisuke
Quantum Physics
Materials Science
Strongly Correlated Electrons
High Energy Physics - Lattice
Computational Physics
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 $m$th- and $n$th-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 stepsize $\mathrm{d}t$, which keeps quantum circuits shallowest within the error tolerance. Benchmarking it in a quantum spin chain, we find the adaptively chosen $\mathrm{d}t$ to be about ten times larger than that inferred from known upper bounds of Trotter errors.
title Measuring Trotter error and its application to precision-guaranteed Hamiltonian simulations
topic Quantum Physics
Materials Science
Strongly Correlated Electrons
High Energy Physics - Lattice
Computational Physics
url https://arxiv.org/abs/2307.05406