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

IEEE International Conference on Consumer Electronics - Taiwan (ICCE-Taiwan)

Likelihood-Based Quantum Computing Monte Carlo for Rare-Event Probability Estimation

Jehn‐Ruey Jiang, Hanas Subakti

Published Jul 1, 2026• 0 citations
Publisher

Abstract

Rare-event probability estimation is essential for reliability analysis in safety-critical engineering. When the target probability$p$is small, classical Monte Carlo (MC) methods require a large number of samples to achieve an additive estimation error$\varepsilon$. Achieving accuracy$\varepsilon$requires$N=\mathrm{O}\left(1/\varepsilon^{2}\right)$samples, since the root-mean-square error (RMSE) of MC scales as$\mathrm{O}(1/\sqrt{N})$. Quantum Computing Monte Carlo (QCMC), based on amplitude estimation, reduces the required oracle complexity to$\mathrm{O}(1/\varepsilon)$, providing a quadratic improvement in sample complexity. This study proposes a QCMC approach for estimating the Gaussian exceedance probability$p=\mathbb{P}(X>\tau)$, where$X \sim \mathcal{N}(0,1)$and$\tau$denotes a failure threshold set to 2.0, 2.5 or 3.0. The continuous distribution is truncated to a finite interval [−4, 4] and discretized into 1024-point grid using$n=10$qubits. We adopt Likelihood-based Iterative Amplitude Estimation (IAE), which avoids the deep circuits required by phase estimation and is thus suitable for near-term quantum devices. Experimental results show that the proposed QCMC-IAE achieves target accuracy with significantly fewer oracle calls than classical MC before reaching a discretization bias of$0.48 \times 10^{-4}$(0.77% relative error for$\tau=2.5)$. The results confirm that QCMC-IAE follows the predicted$O(1/N)$convergence behavior until it reaches the precision limit imposed by the grid resolution.

DOI
10.1109/icce-taiwan71481.2026.11652476

Related papers

Quantum Quasi-Monte Carlo: a window for pre-asymptotic quantum advantage

Paolo Recchia, Zhan Yu, Kelvin Koor +1 more

Numerical integration with Monte Carlo methods is a central computational task in many scientific and industrial applications, including financial derivative pricing and risk management. Classical Monte Carlo algorithms are computationally demanding: achieving an accuracy $ε$ typically requires a number of function evaluations scaling as $O(1/ε^2)$. Quantum-accelerated Monte Carlo methods based on quantum amplitude estimation can in principle quadratically improve this dependence. However, \textit{quasi}-Monte Carlo methods have not been explored in the quantum context. In this work, we introduce a quantum quasi-Monte Carlo algorithm that combines low-discrepancy nets with quantum amplitude estimation. The proposed method prepares the quasi-random point set coherently in superposition. The method does not yield an asymptotic improvement over classical quasi-Monte Carlo, since the total error separates into a discretization error, determined by the finite net, and a quantum estimation error. Instead, we explore a pre-asymptotic advantage window: for a target accuracy that would classically require $2^q$ low discrepancy points, one can prepare a higher-resolution net of size $2^Q$, with $Q>q$, in superposition and reach the same accuracy using significantly fewer function queries. This window can be controlled by tuning the circuit resolution and amplitude-estimation parameters, making the approach relevant for practical regimes where the number of queries is finite rather than asymptotically large.

quant-pharXiv:2609.03625•Sep 4, 2026•0 citations

The Quantum Amplitude Estimation Algorithms on Near-Term Devices: A Practical Guide

Marco Maronese, Massimiliano Incudini, Luca Asproni +1 more

The Quantum Amplitude Estimation (QAE) algorithm is a major quantum algorithm designed to achieve a quadratic speed-up. Until fault-tolerant quantum computing is achieved, being competitive over classical Monte Carlo (MC) remains elusive. Alternative methods have been developed so as to require fewer resources while maintaining an advantageous theoretical scaling. We compared the standard QAE algorithm with two Noisy Intermediate-Scale Quantum (NISQ)-friendly versions of QAE on a numerical integration task, with the Monte Carlo technique of Metropolis–Hastings as a classical benchmark. The algorithms were evaluated in terms of the estimation error as a function of the number of samples, computational time, and length of the quantum circuits required by the solutions, respectively. The effectiveness of the two QAE alternatives was tested on an 11-qubit trapped-ion quantum computer in order to verify which solution can first provide a speed-up in the integral estimation problems. We concluded that an alternative approach is preferable with respect to employing the phase estimation routine. Indeed, the Maximum Likelihood estimation guaranteed the best trade-off between the length of the quantum circuits and the precision in the integral estimation, as well as greater resistance to noise.

Quantum Reports•Dec 24, 2023•12 citations

Utilization of Quantum Monte Carlo Algorithm for Uncertainty Quantification

Rochisha Agarwal, Ferdin Sagai Don Bosco, Ramesh Kolluru +4 more

Efficient and robust uncertainty quantification (UQ) is essential in aerospace systems, as emphasized by both NASA’s CFD Vision 2030 and Certification by Analysis (CbA) 2040 initiatives. However, the extensive computational resources required by traditional UQ methods, especially when coupled with high-fidelity computational fluid dynamics (CFD) simulations, pose significant barriers. Quantum computing (QC) has been identified by the CFD Vision 2030 study as a promising technology to address these challenges, but has not yet been extensively explored in the context of UQ. In this study, a Quantum Computing-based Monte Carlo (QCMC) algorithm is implemented using a Qiskit simulator. This method utilizes Quantum Amplitude Estimation (QAE), specifically tailored for near-term Noisy Intermediate-Scale Quantum (NISQ) computers. The QCMC method demonstrates comparable accuracy to classical Monte Carlo (MC) methods on a two-dimensional heat diffusion problem while reducing the required number of samples (oracle calls) by ∼8X. By substantially lowering the computational overhead of UQ, this quantum computing-based algorithm could be a promising tool required to enable robust uncertainty-informed aerospace design.

AIAA AVIATION Forum•Jul 16, 2025•1 citation

The maximum-likelihood quantum amplitude estimation algorithm provides the best tradeoff between accuracy and circuit depth among quantum solutions for integral estimation

Marco Maronese, Massimiliano Incudini, Luca Asproni +1 more

The approximation of an integral with numerical integration methods is a relevant problem in many fields, from finance to chemistry. Monte Carlo methods are a family of methods widely used for numerical integration but which are not always applicable to industrial tasks. Instead, there are quantum computing methods such as Quantum Amplitude Estimation able to offer a speed-up compared to the Monte Carlo methods for numerical integration which promise a significant impact, especially in finance. The Quantum Amplitude Estimation algorithm is a fundamental quantum algorithm with the potential to achieve a quadratic speed-up. Unfortunately, being competitive over classical Monte Carlo methods would require hardware performances currently not available. Therefore, alternative methods have been developed in order to exploit fewer resources while maintaining an advantageous theoretical scaling. We present a comparison between the standard QAE algorithm and two NISQ-friendly versions of the QAE on a numerical integration task. The Monte Carlo technique of Metropolis-Hastings instead is used as a classical benchmark. The scaling of the different algorithms are evaluated in terms of estimation error as a function of the number of samples, computational time, and length of the quantum circuits required by the quantum solutions. The conclusion highlights that an alternative approach is preferable with respect to employng the phase estimation routine. Indeed, the maximum likelihood estimation guarantees the best trade-off between the length of the quantum circuits and the precision in the integral estimation.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•3 citations

Maximum-Likelihood Amplitude Estimation for Quantum Monte Carlo Integration on Trapped-Ion Hardware: Convergence, Noise-Floor Saturation, Depth-Dependent Bias

Aditi Lal, Alex Khan, Rut Lineswala +1 more

Quantum Amplitude Estimation promises to accelerate Monte Carlo integration by replacing the classical $\varepsilon \propto N^{-1/2}$ sampling law with the Heisenberg-limited $\varepsilon \propto N^{-1}$ scaling, but whether any part of that advantage survives on present-day hardware is an empirical question. We report a systematic experimental benchmark of a Maximum-Likelihood Amplitude Estimation QMC pipeline on IonQ trapped-ion processors, comprising 60 hardware trials on IonQ Forte-1 across five settings(5 & 9 qubits, 100-200 shots per depth, linear & exponential amplification schedules, ~113 device-hours), together with 100 trials on IonQ Aria-1 & Forte-1 noise models at 5, 9 & 19 qubits. The pipeline combines controlled-$R_y$ rotational state preparation, Grover-based amplitude amplification and maximum-likelihood inference and is benchmarked against $b_{\max}^{-1}\!\int_0^{b_{\max}}\!\sin^2\!x\,\mathrm{d}x$ with $b_{\max}=π/5$ ,given results emerge. First, the noiseless limit it attains $\varepsilon \propto N^{-0.88}$, close to the Heisenberg-scaling reference, reducing the error 54-74x over a 133x increase in oracle calls. Second, scaling does not survive on hardware. Every noisy backend saturates at an error floor of (2-5)x 10^{-2}, with fitted exponents of 0.04-0.15 on Forte-1 linear schedules and $α\le\!0$ on the vendor noise models: beyond the optimal shallow depth, however, deeper amplification provides no sustained accuracy gain and instead returns to the noise floor. Forte-1 hardware also outperformed IonQ's own Aria-1 noise model at every depth $m \ge 2$, indicating that vendor noise models are bad predictors of MLAE accuracy. The practical implication for UQ is that on current devices the useful operating point is a shallow, schedule-tuned amplification depth chosen so that the deepest circuit lands near p~1/2 not the deepest schedule the coherence budget allows.

quant-pharXiv:2609.25992•Sep 23, 2026•1 citation

Quantum Rare-Event Estimation for Ising Graphical Models with Belief-Propagation State Preparation

Mario Hernández Vera, Narges Jamialahmadi, Burak Mete +2 more

Quantum amplitude estimation can reduce the sampling cost of rare-event probability estimation, but applying it to correlated Ising graphical models is limited by the difficulty of preparing the target distribution and building a practical event oracle. This work explores two approximate strategies for mitigating these challenges. We introduce a sample-free state-preparation method combining loopy belief propagation with the Chow--Liu algorithm. The resulting tree approximation is compiled into a quantum circuit with linear gate count and depth, and its accuracy is evaluated across graph families spanning different topologies, coupling strengths, and coupling signs. We also construct a structural oracle that evaluates threshold rules with reversible Boolean gates. Using a twenty-node supply-chain disruption model as a case study, we compare maximum likelihood amplitude estimation against four classical Monte Carlo baselines. Under the fixed-depth schedule used throughout this work, the quantum estimator has the same asymptotic error scaling as the classical methods but achieves lower estimation error by a constant factor. This reduction narrows when amplitude-encoding queries replace raw shots as the resource metric. We separate statistical error from the deterministic errors caused by approximate state preparation and oracle construction, and identify the requirements for achieving an improvement beyond a constant factor.

quant-pharXiv:2608.26840•Aug 28, 2026•0 citations
Rare-event probability estimation is essential for reliability analysis in safety-critical engineering. When the target probabilitypppis small, classical Monte Carlo (MC) methods require a large number of samples to achieve an additive estimation errorε\varepsilonε. Achieving accuracyε\varepsilonεrequiresN=O(1/ε2)N=\mathrm{O}\left(1/\varepsilon^{2}\right)N=O(1/ε2)samples, since the root-mean-square error (RMSE) of MC scales asO(1/N)\mathrm{O}(1/\sqrt{N})O(1/N​). Quantum Computing Monte Carlo (QCMC), based on amplitude estimation, reduces the required oracle complexity toO(1/ε)\mathrm{O}(1/\varepsilon)O(1/ε), providing a quadratic improvement in sample complexity. This study proposes a QCMC approach for estimating the Gaussian exceedance probabilityp=P(X>τ)p=\mathbb{P}(X>\tau)p=P(X>τ), whereX∼N(0,1)X \sim \mathcal{N}(0,1)X∼N(0,1)andτ\tauτdenotes a failure threshold set to 2.0, 2.5 or 3.0. The continuous distribution is truncated to a finite interval [−4, 4] and discretized into 1024-point grid usingn=10n=10n=10qubits. We adopt Likelihood-based Iterative Amplitude Estimation (IAE), which avoids the deep circuits required by phase estimation and is thus suitable for near-term quantum devices. Experimental results show that the proposed QCMC-IAE achieves target accuracy with significantly fewer oracle calls than classical MC before reaching a discretization bias of0.48×10−40.48 \times 10^{-4}0.48×10−4(0.77% relative error forτ=2.5)\tau=2.5)τ=2.5). The results confirm that QCMC-IAE follows the predictedO(1/N)O(1/N)O(1/N)convergence behavior until it reaches the precision limit imposed by the grid resolution.
Numerical integration with Monte Carlo methods is a central computational task in many scientific and industrial applications, including financial derivative pricing and risk management. Classical Monte Carlo algorithms are computationally demanding: achieving an accuracy εεε typically requires a number of function evaluations scaling as O(1/ε2)O(1/ε^2)O(1/ε2). Quantum-accelerated Monte Carlo methods based on quantum amplitude estimation can in principle quadratically improve this dependence. However, \textit{quasi}-Monte Carlo methods have not been explored in the quantum context. In this work, we introduce a quantum quasi-Monte Carlo algorithm that combines low-discrepancy nets with quantum amplitude estimation. The proposed method prepares the quasi-random point set coherently in superposition. The method does not yield an asymptotic improvement over classical quasi-Monte Carlo, since the total error separates into a discretization error, determined by the finite net, and a quantum estimation error. Instead, we explore a pre-asymptotic advantage window: for a target accuracy that would classically require 2q2^q2q low discrepancy points, one can prepare a higher-resolution net of size 2Q2^Q2Q, with Q>qQ>qQ>q, in superposition and reach the same accuracy using significantly fewer function queries. This window can be controlled by tuning the circuit resolution and amplitude-estimation parameters, making the approach relevant for practical regimes where the number of queries is finite rather than asymptotically large.
The Quantum Amplitude Estimation (QAE) algorithm is a major quantum algorithm designed to achieve a quadratic speed-up. Until fault-tolerant quantum computing is achieved, being competitive over classical Monte Carlo (MC) remains elusive. Alternative methods have been developed so as to require fewer resources while maintaining an advantageous theoretical scaling. We compared the standard QAE algorithm with two Noisy Intermediate-Scale Quantum (NISQ)-friendly versions of QAE on a numerical integration task, with the Monte Carlo technique of Metropolis–Hastings as a classical benchmark. The algorithms were evaluated in terms of the estimation error as a function of the number of samples, computational time, and length of the quantum circuits required by the solutions, respectively. The effectiveness of the two QAE alternatives was tested on an 11-qubit trapped-ion quantum computer in order to verify which solution can first provide a speed-up in the integral estimation problems. We concluded that an alternative approach is preferable with respect to employing the phase estimation routine. Indeed, the Maximum Likelihood estimation guaranteed the best trade-off between the length of the quantum circuits and the precision in the integral estimation, as well as greater resistance to noise.
Efficient and robust uncertainty quantification (UQ) is essential in aerospace systems, as emphasized by both NASA’s CFD Vision 2030 and Certification by Analysis (CbA) 2040 initiatives. However, the extensive computational resources required by traditional UQ methods, especially when coupled with high-fidelity computational fluid dynamics (CFD) simulations, pose significant barriers. Quantum computing (QC) has been identified by the CFD Vision 2030 study as a promising technology to address these challenges, but has not yet been extensively explored in the context of UQ. In this study, a Quantum Computing-based Monte Carlo (QCMC) algorithm is implemented using a Qiskit simulator. This method utilizes Quantum Amplitude Estimation (QAE), specifically tailored for near-term Noisy Intermediate-Scale Quantum (NISQ) computers. The QCMC method demonstrates comparable accuracy to classical Monte Carlo (MC) methods on a two-dimensional heat diffusion problem while reducing the required number of samples (oracle calls) by ∼8X. By substantially lowering the computational overhead of UQ, this quantum computing-based algorithm could be a promising tool required to enable robust uncertainty-informed aerospace design.
The approximation of an integral with numerical integration methods is a relevant problem in many fields, from finance to chemistry. Monte Carlo methods are a family of methods widely used for numerical integration but which are not always applicable to industrial tasks. Instead, there are quantum computing methods such as Quantum Amplitude Estimation able to offer a speed-up compared to the Monte Carlo methods for numerical integration which promise a significant impact, especially in finance. The Quantum Amplitude Estimation algorithm is a fundamental quantum algorithm with the potential to achieve a quadratic speed-up. Unfortunately, being competitive over classical Monte Carlo methods would require hardware performances currently not available. Therefore, alternative methods have been developed in order to exploit fewer resources while maintaining an advantageous theoretical scaling. We present a comparison between the standard QAE algorithm and two NISQ-friendly versions of the QAE on a numerical integration task. The Monte Carlo technique of Metropolis-Hastings instead is used as a classical benchmark. The scaling of the different algorithms are evaluated in terms of estimation error as a function of the number of samples, computational time, and length of the quantum circuits required by the quantum solutions. The conclusion highlights that an alternative approach is preferable with respect to employng the phase estimation routine. Indeed, the maximum likelihood estimation guarantees the best trade-off between the length of the quantum circuits and the precision in the integral estimation.
Quantum Amplitude Estimation promises to accelerate Monte Carlo integration by replacing the classical ε∝N−1/2\varepsilon \propto N^{-1/2}ε∝N−1/2 sampling law with the Heisenberg-limited ε∝N−1\varepsilon \propto N^{-1}ε∝N−1 scaling, but whether any part of that advantage survives on present-day hardware is an empirical question. We report a systematic experimental benchmark of a Maximum-Likelihood Amplitude Estimation QMC pipeline on IonQ trapped-ion processors, comprising 60 hardware trials on IonQ Forte-1 across five settings(5 & 9 qubits, 100-200 shots per depth, linear & exponential amplification schedules, ~113 device-hours), together with 100 trials on IonQ Aria-1 & Forte-1 noise models at 5, 9 & 19 qubits. The pipeline combines controlled-RyR_yRy​ rotational state preparation, Grover-based amplitude amplification and maximum-likelihood inference and is benchmarked against bmax⁡−1 ⁣∫0bmax⁡ ⁣sin⁡2 ⁣x dxb_{\max}^{-1}\!\int_0^{b_{\max}}\!\sin^2\!x\,\mathrm{d}xbmax−1​∫0bmax​​sin2xdx with bmax⁡=π/5b_{\max}=π/5bmax​=π/5 ,given results emerge. First, the noiseless limit it attains ε∝N−0.88\varepsilon \propto N^{-0.88}ε∝N−0.88, close to the Heisenberg-scaling reference, reducing the error 54-74x over a 133x increase in oracle calls. Second, scaling does not survive on hardware. Every noisy backend saturates at an error floor of (2-5)x 10^{-2}, with fitted exponents of 0.04-0.15 on Forte-1 linear schedules and α≤ ⁣0α\le\!0α≤0 on the vendor noise models: beyond the optimal shallow depth, however, deeper amplification provides no sustained accuracy gain and instead returns to the noise floor. Forte-1 hardware also outperformed IonQ's own Aria-1 noise model at every depth m≥2m \ge 2m≥2, indicating that vendor noise models are bad predictors of MLAE accuracy. The practical implication for UQ is that on current devices the useful operating point is a shallow, schedule-tuned amplification depth chosen so that the deepest circuit lands near p~1/2 not the deepest schedule the coherence budget allows.
Quantum amplitude estimation can reduce the sampling cost of rare-event probability estimation, but applying it to correlated Ising graphical models is limited by the difficulty of preparing the target distribution and building a practical event oracle. This work explores two approximate strategies for mitigating these challenges. We introduce a sample-free state-preparation method combining loopy belief propagation with the Chow--Liu algorithm. The resulting tree approximation is compiled into a quantum circuit with linear gate count and depth, and its accuracy is evaluated across graph families spanning different topologies, coupling strengths, and coupling signs. We also construct a structural oracle that evaluates threshold rules with reversible Boolean gates. Using a twenty-node supply-chain disruption model as a case study, we compare maximum likelihood amplitude estimation against four classical Monte Carlo baselines. Under the fixed-depth schedule used throughout this work, the quantum estimator has the same asymptotic error scaling as the classical methods but achieves lower estimation error by a constant factor. This reduction narrows when amplitude-encoding queries replace raw shots as the resource metric. We separate statistical error from the deterministic errors caused by approximate state preparation and oracle construction, and identify the requirements for achieving an improvement beyond a constant factor.