Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2502.01730

Reducing the sampling complexity of energy estimation in quantum many-body systems using empirical variance information

Alexander Gresch, Uğur Tepe, Martin Kliesch

Published Feb 3, 2025• 1 citation
arXivHTMLPDF

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 one order of magnitude.

DOI
10.48550/arxiv.2502.01730

Related papers

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

Alexander Gresch, Uğur Tepe, Martin Kliesch

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 Computation•Jul 21, 2025•1 citation

Guaranteed efficient energy estimation of quantum many-body Hamiltonians using ShadowGrouping

Alexander Gresch, Martin Kliesch

Estimation of the energy of quantum many-body systems is a paradigmatic task in various research fields. In particular, efficient energy estimation may be crucial in achieving a quantum advantage for a practically relevant problem. For instance, the measurement effort poses a critical bottleneck for variational quantum algorithms. We aim to find the optimal strategy with single-qubit measurements that yields the highest provable accuracy given a total measurement budget. As a central tool, we establish tail bounds for empirical estimators of the energy. They are helpful for identifying measurement settings that improve the energy estimate the most. This task constitutes an NP-hard problem. However, we are able to circumvent this bottleneck and use the tail bounds to develop a practical, efficient estimation strategy, which we call ShadowGrouping. As the name indicates, it combines shadow estimation methods with grouping strategies for Pauli strings. In numerical experiments, we demonstrate that ShadowGrouping improves upon state-of-the-art methods in estimating the electronic ground-state energies of various small molecules, both in provable and practical accuracy benchmarks. Hence, this work provides a promising way, e.g., to tackle the measurement bottleneck associated with quantum many-body Hamiltonians.

Nature Communications•Jan 15, 2025•16 citations

Guaranteed efficient energy estimation of quantum many-body Hamiltonians using ShadowGrouping

Alexander Gresch, Martin Kliesch

Estimation of the energy of quantum many-body systems is a paradigmatic task in various research fields. In particular, efficient energy estimation may be crucial in achieving a quantum advantage for a practically relevant problem. For instance, the measurement effort poses a critical bottleneck for variational quantum algorithms. We aim to find the optimal strategy with single-qubit measurements that yields the highest provable accuracy given a total measurement budget. As a central tool, we establish new tail bounds for empirical estimators of the energy. They are helpful for identifying measurement settings that improve the energy estimate the most. This task constitutes an NP-hard problem. However, we are able to circumvent this bottleneck and use the tail bounds to develop a practical, efficient estimation strategy, which we call ShadowGrouping. As the name indicates, it combines shadow estimation methods with grouping strategies for Pauli strings. In numerical experiments, we demonstrate that ShadowGrouping improves upon state-of-the-art methods in estimating the electronic ground-state energies of various small molecules, both in provable and practical accuracy benchmarks. Hence, this work provides a promising way, e.g., to tackle the measurement bottleneck associated with quantum many-body Hamiltonians.

arXiv:2301.03385•Jan 9, 2023•4 citations

Variance reduction methods in the estimation of Pauli sums

Søren Fuglede Jørgensen, Rafael Emilio Barfknecht, Patrick Ettenhuber +1 more

Accurately estimating expectation values of quantum observables with as few measurements as possible is crucial to many quantum computing applications. We introduce a framework that covers many of existing measurement strategies and introduce heuristics that can be used to enhance randomized schemes, including those based on Pauli grouping with inverse probability weighting and variants of the classical shadow algorithm. We show how to maximize information gain from such schemes, while carefully optimizing the distribution of possible measurements, and show that simple grouping algorithms can get close to, and in some cases exceed, state-of-the-art accuracy for unbiased estimation of expectation values on a standard quantum chemistry benchmark. We show how these randomized methods may be compared to more recent measurement schemes, such as shadow grouping, derandomized shadow, and overlapped grouping measurement, we show how the same strategies can be used to augment these schemes, and we demonstrate that we can reduce measurement costs by up to a factor of two by allowing Clifford measurement circuits for otherwise Clifford-less methods.

quant-pharXiv:2603.20029•Mar 23, 2026•0 citations

Certified Bounds on the Measurement Cost of Molecular Hamiltonians

Federico Zahariev, Vanda Glezakou

Quantum estimates of molecular energy require repeated state preparation and measurement. We bound the minimum repetition count for given measurements and processing rules from above with a practical schedule and from below with independently verified inequalities. For an H$_4$ chain at H-H distances of 0.90 and 1.80 Åwith 2 per cent uniform noise in the ground state, entangling Clifford measurements, which map Pauli products onto one another, cut leading-order repetitions by at least 65.9 and 61.0 per cent, respectively, relative to any schedule using only single-qubit Pauli measurements and Hamiltonian terms. With 69 unaltered measurement settings, each a basis change followed by qubit readout, processing further observables saves at least 12.04 and 6.70 per cent. For four lanthanide and actinide Hamiltonians with depolarized Hartree-Fock covariances, reducing the sum of absolute Hamiltonian coefficients does not proportionally reduce sampling. The bounds cover linear unbiased estimates from independent batches at small error.

quant-pharXiv:2607.16866•Jul 21, 2026•0 citations

Measurement-efficient energy estimator for quantum chemistry of photodynamic materials

Connor Lenihan, Kripa Panchagnula, Luca Erhart +14 more

Accurate modelling of chemical reaction rates requires precise correlated energy differences. Quantum computing offers a potential route to their determination, but extracting energies from quantum-prepared states can demand prohibitive sampling. We demonstrate measurement-efficient correlated energy estimation using an electronically challenging H$_2$DBB--Ru model derived from a Ru-functionalized hafnium metal-organic framework relevant to radiodynamic and photodynamic therapies. The mixed estimator combines a quantum-prepared target with sparse multiconfiguration references and recovers ground-state corrections using magnitude-only compute-uncompute measurements. Analytical variance estimates predict 1.6 mHa precision with a few hundred shots, about 100 times fewer than the single-determinant formulation and three orders of magnitude fewer than optimized Hamiltonian-term sampling. With approximate targets, it reaches comparable accuracy using simpler state preparation than direct expectation-value estimation. Emulator and trapped-ion experiments on Quantinuum Helios validate the approach up to (10,10), including a 50-qubit circuit combining AI-assisted state preparation with error detection, providing a measurement-efficient route to correlated energy differences for challenging chemical problems.

quant-pharXiv:2610.26689•Oct 20, 2026•0 citations
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 one order of magnitude.
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.
Estimation of the energy of quantum many-body systems is a paradigmatic task in various research fields. In particular, efficient energy estimation may be crucial in achieving a quantum advantage for a practically relevant problem. For instance, the measurement effort poses a critical bottleneck for variational quantum algorithms. We aim to find the optimal strategy with single-qubit measurements that yields the highest provable accuracy given a total measurement budget. As a central tool, we establish tail bounds for empirical estimators of the energy. They are helpful for identifying measurement settings that improve the energy estimate the most. This task constitutes an NP-hard problem. However, we are able to circumvent this bottleneck and use the tail bounds to develop a practical, efficient estimation strategy, which we call ShadowGrouping. As the name indicates, it combines shadow estimation methods with grouping strategies for Pauli strings. In numerical experiments, we demonstrate that ShadowGrouping improves upon state-of-the-art methods in estimating the electronic ground-state energies of various small molecules, both in provable and practical accuracy benchmarks. Hence, this work provides a promising way, e.g., to tackle the measurement bottleneck associated with quantum many-body Hamiltonians.
Estimation of the energy of quantum many-body systems is a paradigmatic task in various research fields. In particular, efficient energy estimation may be crucial in achieving a quantum advantage for a practically relevant problem. For instance, the measurement effort poses a critical bottleneck for variational quantum algorithms. We aim to find the optimal strategy with single-qubit measurements that yields the highest provable accuracy given a total measurement budget. As a central tool, we establish new tail bounds for empirical estimators of the energy. They are helpful for identifying measurement settings that improve the energy estimate the most. This task constitutes an NP-hard problem. However, we are able to circumvent this bottleneck and use the tail bounds to develop a practical, efficient estimation strategy, which we call ShadowGrouping. As the name indicates, it combines shadow estimation methods with grouping strategies for Pauli strings. In numerical experiments, we demonstrate that ShadowGrouping improves upon state-of-the-art methods in estimating the electronic ground-state energies of various small molecules, both in provable and practical accuracy benchmarks. Hence, this work provides a promising way, e.g., to tackle the measurement bottleneck associated with quantum many-body Hamiltonians.
Accurately estimating expectation values of quantum observables with as few measurements as possible is crucial to many quantum computing applications. We introduce a framework that covers many of existing measurement strategies and introduce heuristics that can be used to enhance randomized schemes, including those based on Pauli grouping with inverse probability weighting and variants of the classical shadow algorithm. We show how to maximize information gain from such schemes, while carefully optimizing the distribution of possible measurements, and show that simple grouping algorithms can get close to, and in some cases exceed, state-of-the-art accuracy for unbiased estimation of expectation values on a standard quantum chemistry benchmark. We show how these randomized methods may be compared to more recent measurement schemes, such as shadow grouping, derandomized shadow, and overlapped grouping measurement, we show how the same strategies can be used to augment these schemes, and we demonstrate that we can reduce measurement costs by up to a factor of two by allowing Clifford measurement circuits for otherwise Clifford-less methods.
Quantum estimates of molecular energy require repeated state preparation and measurement. We bound the minimum repetition count for given measurements and processing rules from above with a practical schedule and from below with independently verified inequalities. For an H4_44​ chain at H-H distances of 0.90 and 1.80 Åwith 2 per cent uniform noise in the ground state, entangling Clifford measurements, which map Pauli products onto one another, cut leading-order repetitions by at least 65.9 and 61.0 per cent, respectively, relative to any schedule using only single-qubit Pauli measurements and Hamiltonian terms. With 69 unaltered measurement settings, each a basis change followed by qubit readout, processing further observables saves at least 12.04 and 6.70 per cent. For four lanthanide and actinide Hamiltonians with depolarized Hartree-Fock covariances, reducing the sum of absolute Hamiltonian coefficients does not proportionally reduce sampling. The bounds cover linear unbiased estimates from independent batches at small error.
Accurate modelling of chemical reaction rates requires precise correlated energy differences. Quantum computing offers a potential route to their determination, but extracting energies from quantum-prepared states can demand prohibitive sampling. We demonstrate measurement-efficient correlated energy estimation using an electronically challenging H2_22​DBB--Ru model derived from a Ru-functionalized hafnium metal-organic framework relevant to radiodynamic and photodynamic therapies. The mixed estimator combines a quantum-prepared target with sparse multiconfiguration references and recovers ground-state corrections using magnitude-only compute-uncompute measurements. Analytical variance estimates predict 1.6 mHa precision with a few hundred shots, about 100 times fewer than the single-determinant formulation and three orders of magnitude fewer than optimized Hamiltonian-term sampling. With approximate targets, it reaches comparable accuracy using simpler state preparation than direct expectation-value estimation. Emulator and trapped-ion experiments on Quantinuum Helios validate the approach up to (10,10), including a 50-qubit circuit combining AI-assisted state preparation with error detection, providing a measurement-efficient route to correlated energy differences for challenging chemical problems.