Benchmarking a randomized quantum algorithm for estimating expectation values of molecular observables
Abstract
Randomized quantum algorithms for the estimation of expectation values of molecular observables offer a promising route to early fault-tolerant quantum advantage by trading circuit depth for an increased number of samples. However, this begs the question whether the resulting measurement overhead remains feasible for industrially relevant molecular systems. In this work, we benchmark the randomized sampling algorithm of Wang et al. [1] through numerical simulations on a hydrogen molecule and resource estimates for various active spaces of the cytochrome P450, an industry-relevant system in the pharmaceutical industry. Our numerical simulations reveal that the analytical error bounds significantly overestimate the actual sampling error, whereas the analytical bound on the required imaginary evolution time is comparatively tight, exceeding a direct DMRG estimate by roughly 44% for the active space where the comparison is feasible. The measurement overhead nevertheless remains prohibitively high: even for the smallest active spaces, the expectation-value estimation alone requires around 1010 samples, scaling to beyond 1015 for the largest active spaces considered. These results suggest that substantial improvements in measurement strategies or algorithmic scaling are necessary before randomized early-fault-tolerant algorithms become competitive for industrial quantum chemistry applications.
Related
- A Margolus-Levitin speed limit for observables: mean energy bounds expectation-value change quadratically
- Minimal Projective Measurement Settings for Estimating Multiple Observables
- Efficient classical algorithm for estimating linear statistics of Boson Sampling
- Lifting Multiplicity in Randomized Benchmarking
- Phase-Altered Interleaved Randomized Benchmarking for Compiled Non-Clifford Gates
BibTeX
@misc{schroeder2026benchmarking,
title = {{Benchmarking a randomized quantum algorithm for estimating expectation values of molecular observables}},
author = {Anna Schroeder and Gian-Luca R. Anselmetti and Matthias Degroote and Florian Dommert and Michael Kaicher and Chandan Kumar and Michael Streif and Davide Vodola},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.16379},
eprint = {2610.16379},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.16379},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Benchmarking a randomized quantum algorithm for estimating expectation values of molecular observables
AU - Anna Schroeder
AU - Gian-Luca R. Anselmetti
AU - Matthias Degroote
AU - Florian Dommert
AU - Michael Kaicher
AU - Chandan Kumar
AU - Michael Streif
AU - Davide Vodola
PY - 2026
DA - 2026/10/12
PB - arXiv
DO - 10.48550/arxiv.2610.16379
UR - https://arxiv.org/abs/2610.16379
AB - Randomized quantum algorithms for the estimation of expectation values of molecular observables offer a promising route to early fault-tolerant quantum advantage by trading circuit depth for an increased number of samples. However, this begs the question whether the resulting measurement overhead remains feasible for industrially relevant molecular systems. In this work, we benchmark the randomized sampling algorithm of Wang et al. [1] through numerical simulations on a hydrogen molecule and resource estimates for various active spaces of the cytochrome P450, an industry-relevant system in the pharmaceutical industry. Our numerical simulations reveal that the analytical error bounds significantly overestimate the actual sampling error, whereas the analytical bound on the required imaginary evolution time is comparatively tight, exceeding a direct DMRG estimate by roughly 44% for the active space where the comparison is feasible. The measurement overhead nevertheless remains prohibitively high: even for the smallest active spaces, the expectation-value estimation alone requires around 1010 samples, scaling to beyond 1015 for the largest active spaces considered. These results suggest that substantial improvements in measurement strategies or algorithmic scaling are necessary before randomized early-fault-tolerant algorithms become competitive for industrial quantum chemistry applications.
ER -