Reducing the Sampling Complexity of Energy Estimation in Quantum Many-Body Systems Using Empirical Variance Information

We consider the problem of estimating the energy of a quantum state preparation for a given Hamiltonian in Pauli decomposition. For various quantum algorithms, in particular, in the context of quantum chemistry, it is crucial to have energy estimates with error bounds, as captured by guarantees on the problem's sampling complexity. In particular, when limited to Pauli basis measurements, the smallest sampling complexity guarantee comes from a simple single-shot estimator via a straightforward argument based on Hoeffding's inequality. In this work, we construct an adaptive estimator using the state's actual variance. Technically, our estimation method is based on the empirical Bernstein stopping (EBS) algorithm and grouping schemes, and we provide a rigorous tail bound, which leverages the state's empirical variance. In a numerical benchmark of estimating ground-state energies of several Hamiltonians, we demonstrate that EBS consistently improves upon elementary readout guarantees up to 1 order of magnitude.

Authors

Institutions

Publication Details

Journal
Journal of Chemical Theory and Computation
Published
2025-07-21
DOI
https://doi.org/10.1021/acs.jctc.5c00370
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Reducing the Sampling Complexity of Energy Estimation in Quantum Many-Body Systems Using Empirical Variance Information

Martin Kliesch, Alexander Gresch, Uğur Tepe
Journal of Chemical Theory and Computation
Quantum Computing Algorithms and Architecture
article

Reducing the Sampling Complexity of Energy Estimation in Quantum Many-Body Systems Using Empirical Variance Information

Martin Kliesch, Alexander Gresch, Uğur Tepe
article en

Abstract

We consider the problem of estimating the energy of a quantum state preparation for a given Hamiltonian in Pauli decomposition. For various quantum algorithms, in particular, in the context of quantum chemistry, it is crucial to have energy estimates with error bounds, as captured by guarantees on the problem's sampling complexity. In particular, when limited to Pauli basis measurements, the smallest sampling complexity guarantee comes from a simple single-shot estimator via a straightforward argument based on Hoeffding's inequality. In this work, we construct an adaptive estimator using the state's actual variance. Technically, our estimation method is based on the empirical Bernstein stopping (EBS) algorithm and grouping schemes, and we provide a rigorous tail bound, which leverages the state's empirical variance. In a numerical benchmark of estimating ground-state energies of several Hamiltonians, we demonstrate that EBS consistently improves upon elementary readout guarantees up to 1 order of magnitude.

Journal of Chemical Theory and ComputationVol. 21(15)
Universität Hamburg (DE), Center for Integrated Quantum Science and Technology (DE), Heinrich Heine University Düsseldorf (DE)
Affordable and clean energy
Openalex Percentile: Top 91%
Quantum Computing Algorithms and Architecture
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.

Reducing the Sampling Complexity of Energy Estimation in Quantum Many-Body Systems Using Empirical Variance Information — Martin Kliesch, Alexander Gresch, et al. · Journal of Chemical Theory and Computation (2025) | TGRS Research Map | TGRS