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:2610.16379

Benchmarking a randomized quantum algorithm for estimating expectation values of molecular observables

Anna Schroeder, Gian-Luca R. Anselmetti, Matthias Degroote, Florian Dommert, Michael Kaicher, Chandan Kumar, Michael Streif, Davide Vodola

quant-phSubmitted Oct 12, 2026• Announced Oct 13, 2026• 0 citations
arXivHTMLPDF

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.

AI Summary

The paper asks whether the depth–sampling tradeoff in randomized ground-state property sampling (RGPS) permits practical molecular-observable estimation on early fault-tolerant hardware. It benchmarks an existing algorithm combining a Fourier approximation to Gaussian imaginary-time filtering, randomized Pauli compilation, and numerator/normalization estimation, using one auxiliary qubit. Classical simulations treat $\mathrm{H}_2$ in STO-3G, with ten repetitions of $10^6$ sampled circuits for several compilation depths. They show decreasing sampling error followed by a filtering-bias plateau; analytical error bounds exceed the observed errors. These simulations evaluate each circuit expectation exactly and omit Hadamard-test measurement noise. Resource estimates use DMRG-derived gaps and initial-state overlaps for cytochrome P450 active spaces spanning 8–58 orbitals. Optimizing the numerator/denominator sampling allocation gives a cost estimate scaling as $M\propto R^4(\|O\|+|\langle O\rangle|)^2e^{2\lambda_0^2\tau^2}/(\varepsilon^2\gamma^4)$. At $1$ mHa precision and failure probability $0.01$, estimated counts range from approximately $10^{10}$ to $10^{14}$–$10^{15}$ per Hamiltonian expectation, with maximal depths around $10^{11}$ non-Clifford operations for the largest space. Reducing depth below the scale $(\lambda\tau)^2$ rapidly increases sampling costs. For a 15-orbital space, the analytical filtering time exceeds a DMRG-based estimate by about 44%. The large-system estimates rely on conservative sampling bounds, heuristic gap/overlap inputs, an assumed $1$ mHa residual energy after shifting, and uncompressed Pauli decompositions. The DMRG filtering-time comparison extrapolates far beyond simulated times. Large-system force measurements and full workflow costs are not evaluated.

Little sign of AI-generated textIncrementalStrong assumptionsPossible error

Central claim may not hold: The P450 counts are conservative bound-based budgets rather than necessary sampling requirements, and the hydrogen comparison additionally removes measurement noise present in the analytical bounds. The reported 44% imaginary-time comparison is numerically correct but rests on extrapolating DMRG evolution from tau^2 = 10 to approximately 1090 Ha^-2, not direct verification near the target. The resource estimates do not establish a combined 1 mHa ground-state-energy error guarantee accounting for state preparation, Fourier approximation, and statistical estimation. An overlap obtained by compressing a DMRG state does not certify an upper bound on the overlap achievable by arbitrary single-determinant initial states. The optimized sampling-budget derivation combines confidence tolerances using Gaussian error propagation without establishing the claimed high-probability bound for the ratio estimator.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

Enabling Chemically Accurate Quantum Phase Estimation in the Early Fault-Tolerant Regime

Shota Kanasugi, Riki Toshio, Kazunori Maruyama +1 more

Quantum simulation of molecular electronic structure is one of the most promising applications of quantum computing. However, achieving chemically accurate predictions for strongly correlated systems requires quantum phase estimation (QPE) on fault-tolerant quantum computing (FTQC) devices. Existing resource estimates for typical FTQC architectures suggest that such calculations demand millions of physical qubits, thereby placing them beyond the reach of near-term devices. Here, we investigate the feasibility of performing QPE for chemically relevant molecular systems in an early-FTQC regime, characterized by partial fault tolerance, constrained qubit budgets, and limited circuit depth. Our framework is based on single-ancilla, Trotter-based QPE implementations combined with partially randomized time evolution. Within this framework, we develop a novel Hamiltonian optimization strategy, termed unitary weight concentration, that reduces algorithmic cost by reshaping linear-combination-of-unitaries representations. Applying this framework to active-space models of iron-sulfur clusters, cytochrome P450 active sites, and CO$_2$-utilization catalysts, we perform end-to-end resource estimation using the latest version of the space-time efficient analog rotation (STAR) architecture. Our results indicate that ground-state energy estimation for active spaces of approximately 20 to 50 spatial orbitals, well beyond the reach of classical full configuration interaction, is achievable using $\sim 10^5$ physical qubits, with runtimes on the order of days to weeks. These findings demonstrate that while full-fledged fault-tolerant quantum computers will be required for even larger molecular simulations, chemically meaningful quantum chemistry problems are already within reach in an experimentally relevant, early-FTQC regime.

quant-pharXiv:2603.22778•PRX Quantum•Mar 25, 2026•9 citations

Fault-tolerant quantum computation of molecular observables

Mark Steudtner, Sam Morley-Short, William Pol +8 more

Over the past three decades significant reductions have been made to the cost of estimating ground-state energies of molecular Hamiltonians with quantum computers. However, comparatively little attention has been paid to estimating the expectation values of other observables with respect to said ground states, which is important for many industrial applications. In this work we present a novel expectation value estimation (EVE) quantum algorithm which can be applied to estimate the expectation values of arbitrary observables with respect to any of the system's eigenstates. In particular, we consider two variants of EVE: std-EVE, based on standard quantum phase estimation, and QSP-EVE, which utilizes quantum signal processing (QSP) techniques. We provide rigorous error analysis for both both variants and minimize the number of individual phase factors for QSPEVE. These error analyses enable us to produce constant-factor quantum resource estimates for both std-EVE and QSP-EVE across a variety of molecular systems and observables. For the systems considered, we show that QSP-EVE reduces (Toffoli) gate counts by up to three orders of magnitude and reduces qubit width by up to 25% compared to std-EVE. While estimated resource counts remain far too high for the first generations of fault-tolerant quantum computers, our estimates mark a first of their kind for both the application of expectation value estimation and modern QSP-based techniques.

arXiv:2303.14118•Quantum•Nov 6, 2023•33 citations

Quantum computation, quantum chemistry and Hamiltonian moments

Michael Alexander Jones

While sufficiently large and accurate quantum computers are expected to exploit quantum effects such as superposition and entanglement to gain an advantage over their classical counterparts for specific problems, it is unclear whether near- and medium-term quantum devices can provide such an advantage. For the problem of ground-state energy estimation, which is of particular interest as a first step into quantum chemistry, small-scale proof-of-principle experiments have been performed on current noisy devices, but scaling to larger problem instances has been hindered by noise inherent in today's quantum hardware making it difficult to achieve the required precision. In this thesis, we investigate the use of Hamiltonian moments for improving on ground-state energy estimates from quantum devices, finding that the additional information incorporated into moments-corrected ground-state energy estimates allows accuracy beyond what would normally be possible for a given quantum circuit depth. This, combined with the inherent error robustness of the moments-based method, allowed us to perform calculations for Hydrogen chains beyond the Hartree-Fock approximation (Chapter 2), and subsequently, the largest quantum chemical calculation to date to achieve millihartree accuracy on existing quantum hardware (Chapter 3) - computing the ground-state energy of the water molecule on 8 qubits. We then consider extensions to the moments-based method allowing for estimation of non-energetic properties, obtaining the electric dipole moment of the water molecule to an error of 2% (Chapter 4) and qualitatively accurate molecular forces over a range of molecular geometries from a single quantum calculation (Chapter 5). Finally, we examine the scaling of the Hamiltonian moments evaluation through three different methods and verify the analytic results with numerical simulation (Chapter 6). While the methods do not scale as well as quantum phase estimation in the asymptotic limit, and further work is needed to provide concrete resource estimates, the hope is that the required circuit depths will be more reasonable for early fault-tolerant quantum devices.

•Jan 1, 2025•0 citations

Early Fault-Tolerant Quantum Algorithms in Practice: Application to Ground-State Energy Estimation

Oriel Kiss, Utkarsh Azad, Borja Requena +3 more

We investigate the feasibility of early fault-tolerant quantum algorithms focusing on ground-state energy estimation problems. In particular, we examine the computation of the cumulative distribution function (CDF) of the spectral measure of a Hamiltonian and the identification of its discontinuities. Scaling these methods to larger system sizes reveals three key challenges: the smoothness of the CDF for large supports, the lack of tight lower bounds on the overlap with the true ground state, and the difficulty of preparing high-quality initial states. To address these challenges, we propose a signal processing approach to find these estimates automatically, in the regime where the quality of the initial state is unknown. Rather than aiming for exact ground-state energy, we advocate for improving classical estimates by targeting the low-energy support of the initial state. Additionally, we provide quantitative resource estimates, demonstrating a constant factor improvement in the number of samples required to detect a specified change in CDF. Our numerical experiments, conducted on a 26-qubit fully connected Heisenberg model, leverage a truncated density-matrix renormalization group (DMRG) initial state with a low bond dimension. The results show that the predictions from the quantum algorithm align closely with the DMRG-converged energies at larger bond dimensions while requiring several orders of magnitude fewer samples than theoretical estimates suggest. These findings underscore that CDF-based quantum algorithms are a practical and resource-efficient alternative to quantum phase estimation, particularly in resource-constrained scenarios.

arXiv:2405.03754•Quantum•Apr 1, 2025•17 citations

Quantum algorithm for weakly correlated molecular electronic ground states with sub-quintic scaling in the system size

Oskar Leimkuhler, Marvin Kronenberger, Davide Castaldo +8 more

Weakly correlated electronic structures are predominant among molecules, and are routinely solved with heuristic classical methods such as the ``gold standard'' CCSD(T) coupled cluster model, incurring a formal time complexity $O(n^7)$ in the number of molecular orbitals and with no guarantee of energy error $\varepsilon$ at or below chemical accuracy. In this work, a quantum algorithm is presented for ground state energy estimation of weakly correlated molecules using Trotterized time evolution, with an end-to-end quantum operations cost that scales as $\tilde{O}(n^{4.8}/\varepsilon^2)$ in the limit of high-order product formulae when run as a low-depth, shot-noise limited algorithm, or $\tilde{O}(n^{4.8} + n^{3.8}/\varepsilon)$ when scaling the simulation time $T\propto 1/\varepsilon$. The algorithm combines adiabatic state preparation using a smoothed Gevrey schedule with eigenstate filtering via quantum prolate diagonalization (QPD). Both steps of the algorithm rely on a size-independent spectral gap assumption, which is validated by numerical studies on alanine chains with up to 64 monomers. We benchmark the performance of our eigenstate filtering algorithm on a set of 28 molecules to compare our approach against prior phase estimation algorithms, finding that QPD achieves state-of-the-art cost tradeoffs for $\varepsilon$-accurate results. Physical quantum resource estimates are obtained for running Trotter step circuits with up to 40 spin-orbitals, providing a clear path for scaling up quantum simulation of chemistry on early fault-tolerant hardware.

quant-pharXiv:2611.00751•Nov 3, 2026•0 citations

On proving the robustness of algorithms for early fault-tolerant quantum computers

Rutuja Kshirsagar, Amara Katabarwa, Peter Johnson

The hope of the quantum computing field is that quantum architectures are able to scale up and realize fault-tolerant quantum computing. Due to engineering challenges, such ''cheap'' error correction may be decades away. In the meantime, we anticipate an era of ''costly'' error correction, or early fault-tolerant quantum computing . Costly error correction might warrant settling for error-prone quantum computations. This motivates the development of quantum algorithms which are robust to some degree of error as well as methods to analyze their performance in the presence of error. Several such algorithms have recently been developed; what is missing is a methodology to analyze their robustness. To this end, we introduce a randomized algorithm for the task of phase estimation and give an analysis of its performance under two simple noise models. In both cases the analysis leads to a noise threshold, below which arbitrarily high accuracy can be achieved by increasing the number of samples used in the algorithm. As an application of this general analysis, we compute the maximum ratio of the largest circuit depth and the dephasing scale such that performance guarantees hold. We calculate that the randomized algorithm can succeed with arbitrarily high probability as long as the required circuit depth is less than 0.916 times the dephasing scale.

arXiv:2209.11322•Quantum•Nov 20, 2024•22 citations
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.
The paper asks whether the depth–sampling tradeoff in randomized ground-state property sampling (RGPS) permits practical molecular-observable estimation on early fault-tolerant hardware. It benchmarks an existing algorithm combining a Fourier approximation to Gaussian imaginary-time filtering, randomized Pauli compilation, and numerator/normalization estimation, using one auxiliary qubit.
Classical simulations treat H2\mathrm{H}_2H2​ in STO-3G, with ten repetitions of 10610^6106 sampled circuits for several compilation depths. They show decreasing sampling error followed by a filtering-bias plateau; analytical error bounds exceed the observed errors. These simulations evaluate each circuit expectation exactly and omit Hadamard-test measurement noise.
Resource estimates use DMRG-derived gaps and initial-state overlaps for cytochrome P450 active spaces spanning 8–58 orbitals. Optimizing the numerator/denominator sampling allocation gives a cost estimate scaling as M∝R4(∥O∥+∣⟨O⟩∣)2e2λ02τ2/(ε2γ4)M\propto R^4(\|O\|+|\langle O\rangle|)^2e^{2\lambda_0^2\tau^2}/(\varepsilon^2\gamma^4)M∝R4(∥O∥+∣⟨O⟩∣)2e2λ02​τ2/(ε2γ4). At 111 mHa precision and failure probability 0.010.010.01, estimated counts range from approximately 101010^{10}1010 to 101410^{14}1014–101510^{15}1015 per Hamiltonian expectation, with maximal depths around 101110^{11}1011 non-Clifford operations for the largest space. Reducing depth below the scale (λτ)2(\lambda\tau)^2(λτ)2 rapidly increases sampling costs. For a 15-orbital space, the analytical filtering time exceeds a DMRG-based estimate by about 44%.
The large-system estimates rely on conservative sampling bounds, heuristic gap/overlap inputs, an assumed 111 mHa residual energy after shifting, and uncompressed Pauli decompositions. The DMRG filtering-time comparison extrapolates far beyond simulated times. Large-system force measurements and full workflow costs are not evaluated.
Quantum simulation of molecular electronic structure is one of the most promising applications of quantum computing. However, achieving chemically accurate predictions for strongly correlated systems requires quantum phase estimation (QPE) on fault-tolerant quantum computing (FTQC) devices. Existing resource estimates for typical FTQC architectures suggest that such calculations demand millions of physical qubits, thereby placing them beyond the reach of near-term devices. Here, we investigate the feasibility of performing QPE for chemically relevant molecular systems in an early-FTQC regime, characterized by partial fault tolerance, constrained qubit budgets, and limited circuit depth. Our framework is based on single-ancilla, Trotter-based QPE implementations combined with partially randomized time evolution. Within this framework, we develop a novel Hamiltonian optimization strategy, termed unitary weight concentration, that reduces algorithmic cost by reshaping linear-combination-of-unitaries representations. Applying this framework to active-space models of iron-sulfur clusters, cytochrome P450 active sites, and CO2_22​-utilization catalysts, we perform end-to-end resource estimation using the latest version of the space-time efficient analog rotation (STAR) architecture. Our results indicate that ground-state energy estimation for active spaces of approximately 20 to 50 spatial orbitals, well beyond the reach of classical full configuration interaction, is achievable using ∼105\sim 10^5∼105 physical qubits, with runtimes on the order of days to weeks. These findings demonstrate that while full-fledged fault-tolerant quantum computers will be required for even larger molecular simulations, chemically meaningful quantum chemistry problems are already within reach in an experimentally relevant, early-FTQC regime.
Over the past three decades significant reductions have been made to the cost of estimating ground-state energies of molecular Hamiltonians with quantum computers. However, comparatively little attention has been paid to estimating the expectation values of other observables with respect to said ground states, which is important for many industrial applications. In this work we present a novel expectation value estimation (EVE) quantum algorithm which can be applied to estimate the expectation values of arbitrary observables with respect to any of the system's eigenstates. In particular, we consider two variants of EVE: std-EVE, based on standard quantum phase estimation, and QSP-EVE, which utilizes quantum signal processing (QSP) techniques. We provide rigorous error analysis for both both variants and minimize the number of individual phase factors for QSPEVE. These error analyses enable us to produce constant-factor quantum resource estimates for both std-EVE and QSP-EVE across a variety of molecular systems and observables. For the systems considered, we show that QSP-EVE reduces (Toffoli) gate counts by up to three orders of magnitude and reduces qubit width by up to 25% compared to std-EVE. While estimated resource counts remain far too high for the first generations of fault-tolerant quantum computers, our estimates mark a first of their kind for both the application of expectation value estimation and modern QSP-based techniques.
While sufficiently large and accurate quantum computers are expected to exploit quantum effects such as superposition and entanglement to gain an advantage over their classical counterparts for specific problems, it is unclear whether near- and medium-term quantum devices can provide such an advantage. For the problem of ground-state energy estimation, which is of particular interest as a first step into quantum chemistry, small-scale proof-of-principle experiments have been performed on current noisy devices, but scaling to larger problem instances has been hindered by noise inherent in today's quantum hardware making it difficult to achieve the required precision. In this thesis, we investigate the use of Hamiltonian moments for improving on ground-state energy estimates from quantum devices, finding that the additional information incorporated into moments-corrected ground-state energy estimates allows accuracy beyond what would normally be possible for a given quantum circuit depth. This, combined with the inherent error robustness of the moments-based method, allowed us to perform calculations for Hydrogen chains beyond the Hartree-Fock approximation (Chapter 2), and subsequently, the largest quantum chemical calculation to date to achieve millihartree accuracy on existing quantum hardware (Chapter 3) - computing the ground-state energy of the water molecule on 8 qubits. We then consider extensions to the moments-based method allowing for estimation of non-energetic properties, obtaining the electric dipole moment of the water molecule to an error of 2% (Chapter 4) and qualitatively accurate molecular forces over a range of molecular geometries from a single quantum calculation (Chapter 5). Finally, we examine the scaling of the Hamiltonian moments evaluation through three different methods and verify the analytic results with numerical simulation (Chapter 6). While the methods do not scale as well as quantum phase estimation in the asymptotic limit, and further work is needed to provide concrete resource estimates, the hope is that the required circuit depths will be more reasonable for early fault-tolerant quantum devices.
We investigate the feasibility of early fault-tolerant quantum algorithms focusing on ground-state energy estimation problems. In particular, we examine the computation of the cumulative distribution function (CDF) of the spectral measure of a Hamiltonian and the identification of its discontinuities. Scaling these methods to larger system sizes reveals three key challenges: the smoothness of the CDF for large supports, the lack of tight lower bounds on the overlap with the true ground state, and the difficulty of preparing high-quality initial states. To address these challenges, we propose a signal processing approach to find these estimates automatically, in the regime where the quality of the initial state is unknown. Rather than aiming for exact ground-state energy, we advocate for improving classical estimates by targeting the low-energy support of the initial state. Additionally, we provide quantitative resource estimates, demonstrating a constant factor improvement in the number of samples required to detect a specified change in CDF. Our numerical experiments, conducted on a 26-qubit fully connected Heisenberg model, leverage a truncated density-matrix renormalization group (DMRG) initial state with a low bond dimension. The results show that the predictions from the quantum algorithm align closely with the DMRG-converged energies at larger bond dimensions while requiring several orders of magnitude fewer samples than theoretical estimates suggest. These findings underscore that CDF-based quantum algorithms are a practical and resource-efficient alternative to quantum phase estimation, particularly in resource-constrained scenarios.
Weakly correlated electronic structures are predominant among molecules, and are routinely solved with heuristic classical methods such as the ``gold standard'' CCSD(T) coupled cluster model, incurring a formal time complexity O(n7)O(n^7)O(n7) in the number of molecular orbitals and with no guarantee of energy error ε\varepsilonε at or below chemical accuracy. In this work, a quantum algorithm is presented for ground state energy estimation of weakly correlated molecules using Trotterized time evolution, with an end-to-end quantum operations cost that scales as O~(n4.8/ε2)\tilde{O}(n^{4.8}/\varepsilon^2)O~(n4.8/ε2) in the limit of high-order product formulae when run as a low-depth, shot-noise limited algorithm, or O~(n4.8+n3.8/ε)\tilde{O}(n^{4.8} + n^{3.8}/\varepsilon)O~(n4.8+n3.8/ε) when scaling the simulation time T∝1/εT\propto 1/\varepsilonT∝1/ε. The algorithm combines adiabatic state preparation using a smoothed Gevrey schedule with eigenstate filtering via quantum prolate diagonalization (QPD). Both steps of the algorithm rely on a size-independent spectral gap assumption, which is validated by numerical studies on alanine chains with up to 64 monomers. We benchmark the performance of our eigenstate filtering algorithm on a set of 28 molecules to compare our approach against prior phase estimation algorithms, finding that QPD achieves state-of-the-art cost tradeoffs for ε\varepsilonε-accurate results. Physical quantum resource estimates are obtained for running Trotter step circuits with up to 40 spin-orbitals, providing a clear path for scaling up quantum simulation of chemistry on early fault-tolerant hardware.
The hope of the quantum computing field is that quantum architectures are able to scale up and realize fault-tolerant quantum computing. Due to engineering challenges, such ''cheap'' error correction may be decades away. In the meantime, we anticipate an era of ''costly'' error correction, or early fault-tolerant quantum computing . Costly error correction might warrant settling for error-prone quantum computations. This motivates the development of quantum algorithms which are robust to some degree of error as well as methods to analyze their performance in the presence of error. Several such algorithms have recently been developed; what is missing is a methodology to analyze their robustness. To this end, we introduce a randomized algorithm for the task of phase estimation and give an analysis of its performance under two simple noise models. In both cases the analysis leads to a noise threshold, below which arbitrarily high accuracy can be achieved by increasing the number of samples used in the algorithm. As an application of this general analysis, we compute the maximum ratio of the largest circuit depth and the dephasing scale such that performance guarantees hold. We calculate that the randomized algorithm can succeed with arbitrarily high probability as long as the required circuit depth is less than 0.916 times the dephasing scale.