Trotterization is Substantially Efficient for Low-Energy States

Trotterization is one of the central approaches for simulating quantum many-body dynamics on quantum computers or tensor networks. In addition to its simple implementation, recent studies have revealed that its error and cost can be reduced if the initial state is closed in the low-energy subspace. However, the improvement by the low-energy property diminishes rapidly as the Trotter order grows in the previous studies, and thus, it is mysterious whether there exists a genuine advantage of low-energy initial states. In this Letter, we resolve this problem by proving the optimal error bound and cost of Trotterization for low-energy initial states. For generic local Hamiltonians composed of positive-semidefinite terms, we show that the Trotter error is at most linear in the initial state energy Δ and polylogarithmic in the system size N. As a result, the computational cost becomes substantially small for low-energy states with Δ∈o(Ng) compared to the one for arbitrary initial states, where g denotes the energy per site and Ng means the whole-system energy. Our error bound and cost of Trotterization achieve the theoretically best scaling in the initial state energy Δ. In addition, they can be partially extended to weakly correlated initial states having low-energy expectation values, which are not necessarily closed in the low-energy subspace. Our results will pave the way for fast and accurate simulations of low-energy states, which are one of the central targets in condensed matter physics and quantum chemistry.

Authors

Institutions

Publication Details

Journal
Physical Review Letters
Published
2025-09-23
DOI
https://doi.org/10.1103/q87n-5xhz
Citations
2
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
4.96

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Trotterization is Substantially Efficient for Low-Energy States

Tomotaka Kuwahara, Kaoru Mizuta
2 citations
Physical Review Letters
Quantum Computing Algorithms and Architecture
4.96
article

Trotterization is Substantially Efficient for Low-Energy States

Tomotaka Kuwahara, Kaoru Mizuta
article en
2 citations

Abstract

Trotterization is one of the central approaches for simulating quantum many-body dynamics on quantum computers or tensor networks. In addition to its simple implementation, recent studies have revealed that its error and cost can be reduced if the initial state is closed in the low-energy subspace. However, the improvement by the low-energy property diminishes rapidly as the Trotter order grows in the previous studies, and thus, it is mysterious whether there exists a genuine advantage of low-energy initial states. In this Letter, we resolve this problem by proving the optimal error bound and cost of Trotterization for low-energy initial states. For generic local Hamiltonians composed of positive-semidefinite terms, we show that the Trotter error is at most linear in the initial state energy Δ and polylogarithmic in the system size N. As a result, the computational cost becomes substantially small for low-energy states with Δ∈o(Ng) compared to the one for arbitrary initial states, where g denotes the energy per site and Ng means the whole-system energy. Our error bound and cost of Trotterization achieve the theoretically best scaling in the initial state energy Δ. In addition, they can be partially extended to weakly correlated initial states having low-energy expectation values, which are not necessarily closed in the low-energy subspace. Our results will pave the way for fast and accurate simulations of low-energy states, which are one of the central targets in condensed matter physics and quantum chemistry.

Physical Review LettersVol. 135(13)
Pioneer (United States) (US), Japan Science and Technology Agency (JP), Computing Center (RU), RIKEN Center for Quantum Computing, The University of Tokyo (JP)
Japan Society for the Promotion of Science, RIKEN, Precursory Research for Embryonic Science and Technology, Exploratory Research for Advanced Technology, Moonshot Research and Development Program
Openalex Percentile: Top 5%
Quantum Computing Algorithms and Architecture
4.96
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.