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

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

Mario Hernández Vera, Narges Jamialahmadi, Burak Mete, Susanne Schneider, Marco De Pascale

quant-phSubmitted Aug 27, 2026• Announced Aug 28, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

Related papers

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

Jehn‐Ruey Jiang, Hanas Subakti

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.

IEEE International Conference on Consumer Electronics - Taiwan (ICCE-Taiwan)•Jul 1, 2026•0 citations

Bayesian Sequential Quantum Amplitude Estimation for Rare-Event Structural Failure Probability

Alireza Tabarraei

Structural reliability analysis often requires estimating small failure probabilities under uncertainty, a task for which direct Monte Carlo simulation becomes inefficient because failure observations are scarce. Quantum amplitude estimation offers a potential quadratic improvement in query complexity for bounded expectation estimation, but practical iterative formulations require reliable inference from finite, amplified measurement data. This paper develops a Bayesian sequential formulation of iterative quantum amplitude estimation for rare-event structural failure probability estimation. Structural failure is represented as a binary indicator over a finite stochastic ensemble and encoded through a lookup-table oracle, allowing the failure probability to be treated as a quantum amplitude. Measurement outcomes collected at different Grover depths are assimilated through Bayesian updating over the amplitude angle, yielding posterior estimates, credible intervals, and uncertainty-aware convergence diagnostics. The framework is evaluated on stochastic finite-element benchmark problems, including a one-dimensional bar and an L-bracket with stress concentration. The results show that amplitude amplification converts rare failure events into measurable success probabilities, enabling substantially lower estimation errors than direct Monte Carlo simulation under the same idealized oracle-query budget. The Bayesian formulation achieves point-estimation accuracy comparable to maximum-likelihood IQAE while additionally providing posterior uncertainty quantification, credible intervals, and transparent convergence assessment. The study demonstrates Bayesian IQAE as a statistically interpretable proof-of-concept for quantum-assisted rare-event reliability analysis, while relying on idealized oracle access.

arXiv:2607.18996•Jul 21, 2026•0 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

Logical Resource Estimation for Quantum State Preparation with Compilation

Diyi Liu, Hanyu Wang, Shuchen Zhu +6 more

Quantum state preparation is a fundamental primitive in quantum algorithms for encoding classical data into quantum amplitudes. We compare the cost of preparing general $n$-qubit states with real amplitudes using two common paradigms: rotation-based methods, based on controlled rotations, and sampling-based methods, based on a structured representation of the target state. Although these approaches are often theoretically compared using CNOT count and $T$-count, their relative performance in total gate count remains less well understood practically. We compare representative rotation-based and sampling-based methods using $T$-count and total gate count, and analyze how compilation overhead affects their relative performance. We also develop a software package for compiling state preparation circuits, designed as a practical subroutine for more general quantum computations. Numerical experiments on resource states and quantum states related to quantum chemistry, condensed matter physics, and simulation via Magnus expansion over a range of target accuracies $ε$ support the analysis. Our results show that sampling-based methods achieve asymptotically lower $T$-count and retain an overall advantage after accounting for total gate count and compilation overhead.

quant-pharXiv:2605.18877•May 19, 2026•3 citations

Quantum Causal Discovery via Amplitude Estimation of Kullback-Leibler Divergence

Shabnam Sodagari

Causal discovery from observational data underpins applications in finance, climate modeling, and machine learning. Constraint-based causal discovery reduces structure learning to a sequence of conditional independence (CI) tests, where each test decides independence by estimating conditional mutual information $I(X;Y \mid Z)$ to additive precision $τ$ and thresholding against it. Classically this requires $Θ(1/τ^{2})$ samples per test, a cost that dominates in the high-precision regime typical of weak dependencies. We present QKLA (Quantum Kullback--Leibler Amplitude estimation), a quantum algorithm that encodes a clipped log-density ratio as a bounded amplitude and applies amplitude estimation to recover a clipped KL expectation. Given coherent oracle access to the relevant distributions and a reversible log-ratio arithmetic oracle, QKLA achieves a quadratic precision improvement, needing only $\mathcal{O}((L/τ)\log(1/δ))$ queries, where $L$ is the log-ratio clip bound. Under per-stratum conditional-oracle access and a margin assumption for CI decisions, embedding this estimator in the PC algorithm compounds to an $\widetildeΩ(1/(Lτ))$ reduction in total oracle queries. We validate the theory in three experiments. A gate-level state-vector simulation of the full QKLA circuit confirms the predicted $\mathcal{O}(1/M)$ error decay. Across $K=20$ random binary distributions, classical and quantum error scalings match theory to within $0.01$ in slope. In an oracle-model benchmark inside PC on two networks (\textsc{Asia}, 8 nodes; \textsc{Synthetic-12}, 12 nodes), the quantum CI subroutine reaches comparable skeleton-recovery $F_1$ while using $2.7$--$3.2\times$ fewer oracle queries at $τ= 5\cdot 10^{-3}$ bits and $4.0$--$7.4\times$ fewer at $τ= 10^{-3}$ bits.

quant-pharXiv:2604.23451•Apr 28, 2026•0 citations

Quantum amplitude estimation beyond power-of-two schedules

Farrokh Labib

Non-adaptive quantum amplitude estimation (QAE) fixes its Grover depths in advance, so every circuit can run in parallel, but it has so far needed more queries than the best adaptive methods. We show that most of this gap comes from two conventional choices: subspace-based post-processing and power-of-two depth ladders. We replace the first by the exact maximum-likelihood estimate, one matrix multiplication per batch of estimates, and the second by a geometric ladder with ratio $r \approx 1.45$. The result is a fully parallel, deterministic-schedule estimator with total query complexity $2.8$-$3.1/\varepsilon$ at 95% confidence for target errors from $3.5\times 10^{-3}$ to $10^{-6}$. This matches the average-case complexity of chebAE, the best benchmarked adaptive method, within statistical uncertainty (with the lower point estimate at every scale tested), beats its maximum-observed complexity by $1.6\times$, and needs a maximum sequential depth of only $0.21/\varepsilon$ against chebAE's $2.9/\varepsilon$. Relative to csAE, the best non-adaptive benchmark, the constants improve by 30-35% at 95% and $1.5$-$1.7\times$ at 99% confidence. The optimal ratio has a simple origin. Doubling is the fastest depth growth at which the data can still tell neighboring candidate values apart, so power-of-two ladders sit at the edge of confusion and must buy reliability with extra shots; a slightly denser ladder checks every scale redundantly. An error-probability analysis reproduces the measured failure rates and locates the optimum. The likelihood formulation extends directly to noise-aware estimation, and uniformly scaling the capped ladder covers the depth-limited regime, realizing the optimal trade-off $M N_{\mathrm{tot}} \approx (0.4$-$0.6)/\varepsilon^2$ within $\sim 1.1\times$ of the schedule's Cramér-Rao limit.

quant-pharXiv:2609.02715•Sep 3, 2026•0 citations
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.
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.
Structural reliability analysis often requires estimating small failure probabilities under uncertainty, a task for which direct Monte Carlo simulation becomes inefficient because failure observations are scarce. Quantum amplitude estimation offers a potential quadratic improvement in query complexity for bounded expectation estimation, but practical iterative formulations require reliable inference from finite, amplified measurement data. This paper develops a Bayesian sequential formulation of iterative quantum amplitude estimation for rare-event structural failure probability estimation. Structural failure is represented as a binary indicator over a finite stochastic ensemble and encoded through a lookup-table oracle, allowing the failure probability to be treated as a quantum amplitude. Measurement outcomes collected at different Grover depths are assimilated through Bayesian updating over the amplitude angle, yielding posterior estimates, credible intervals, and uncertainty-aware convergence diagnostics. The framework is evaluated on stochastic finite-element benchmark problems, including a one-dimensional bar and an L-bracket with stress concentration. The results show that amplitude amplification converts rare failure events into measurable success probabilities, enabling substantially lower estimation errors than direct Monte Carlo simulation under the same idealized oracle-query budget. The Bayesian formulation achieves point-estimation accuracy comparable to maximum-likelihood IQAE while additionally providing posterior uncertainty quantification, credible intervals, and transparent convergence assessment. The study demonstrates Bayesian IQAE as a statistically interpretable proof-of-concept for quantum-assisted rare-event reliability analysis, while relying on idealized oracle access.
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 state preparation is a fundamental primitive in quantum algorithms for encoding classical data into quantum amplitudes. We compare the cost of preparing general nnn-qubit states with real amplitudes using two common paradigms: rotation-based methods, based on controlled rotations, and sampling-based methods, based on a structured representation of the target state. Although these approaches are often theoretically compared using CNOT count and TTT-count, their relative performance in total gate count remains less well understood practically. We compare representative rotation-based and sampling-based methods using TTT-count and total gate count, and analyze how compilation overhead affects their relative performance. We also develop a software package for compiling state preparation circuits, designed as a practical subroutine for more general quantum computations. Numerical experiments on resource states and quantum states related to quantum chemistry, condensed matter physics, and simulation via Magnus expansion over a range of target accuracies εεε support the analysis. Our results show that sampling-based methods achieve asymptotically lower TTT-count and retain an overall advantage after accounting for total gate count and compilation overhead.
Causal discovery from observational data underpins applications in finance, climate modeling, and machine learning. Constraint-based causal discovery reduces structure learning to a sequence of conditional independence (CI) tests, where each test decides independence by estimating conditional mutual information I(X;Y∣Z)I(X;Y \mid Z)I(X;Y∣Z) to additive precision τττ and thresholding against it. Classically this requires Θ(1/τ2)Θ(1/τ^{2})Θ(1/τ2) samples per test, a cost that dominates in the high-precision regime typical of weak dependencies. We present QKLA (Quantum Kullback--Leibler Amplitude estimation), a quantum algorithm that encodes a clipped log-density ratio as a bounded amplitude and applies amplitude estimation to recover a clipped KL expectation. Given coherent oracle access to the relevant distributions and a reversible log-ratio arithmetic oracle, QKLA achieves a quadratic precision improvement, needing only O((L/τ)log⁡(1/δ))\mathcal{O}((L/τ)\log(1/δ))O((L/τ)log(1/δ)) queries, where LLL is the log-ratio clip bound. Under per-stratum conditional-oracle access and a margin assumption for CI decisions, embedding this estimator in the PC algorithm compounds to an Ω~(1/(Lτ))\widetildeΩ(1/(Lτ))Ω(1/(Lτ)) reduction in total oracle queries. We validate the theory in three experiments. A gate-level state-vector simulation of the full QKLA circuit confirms the predicted O(1/M)\mathcal{O}(1/M)O(1/M) error decay. Across K=20K=20K=20 random binary distributions, classical and quantum error scalings match theory to within 0.010.010.01 in slope. In an oracle-model benchmark inside PC on two networks (\textsc{Asia}, 8 nodes; \textsc{Synthetic-12}, 12 nodes), the quantum CI subroutine reaches comparable skeleton-recovery F1F_1F1​ while using 2.72.72.7--3.2×3.2\times3.2× fewer oracle queries at τ=5⋅10−3τ= 5\cdot 10^{-3}τ=5⋅10−3 bits and 4.04.04.0--7.4×7.4\times7.4× fewer at τ=10−3τ= 10^{-3}τ=10−3 bits.
Non-adaptive quantum amplitude estimation (QAE) fixes its Grover depths in advance, so every circuit can run in parallel, but it has so far needed more queries than the best adaptive methods. We show that most of this gap comes from two conventional choices: subspace-based post-processing and power-of-two depth ladders. We replace the first by the exact maximum-likelihood estimate, one matrix multiplication per batch of estimates, and the second by a geometric ladder with ratio r≈1.45r \approx 1.45r≈1.45. The result is a fully parallel, deterministic-schedule estimator with total query complexity 2.82.82.8-3.1/ε3.1/\varepsilon3.1/ε at 95% confidence for target errors from 3.5×10−33.5\times 10^{-3}3.5×10−3 to 10−610^{-6}10−6. This matches the average-case complexity of chebAE, the best benchmarked adaptive method, within statistical uncertainty (with the lower point estimate at every scale tested), beats its maximum-observed complexity by 1.6×1.6\times1.6×, and needs a maximum sequential depth of only 0.21/ε0.21/\varepsilon0.21/ε against chebAE's 2.9/ε2.9/\varepsilon2.9/ε. Relative to csAE, the best non-adaptive benchmark, the constants improve by 30-35% at 95% and 1.51.51.5-1.7×1.7\times1.7× at 99% confidence. The optimal ratio has a simple origin. Doubling is the fastest depth growth at which the data can still tell neighboring candidate values apart, so power-of-two ladders sit at the edge of confusion and must buy reliability with extra shots; a slightly denser ladder checks every scale redundantly. An error-probability analysis reproduces the measured failure rates and locates the optimum. The likelihood formulation extends directly to noise-aware estimation, and uniformly scaling the capped ladder covers the depth-limited regime, realizing the optimal trade-off MNtot≈(0.4M N_{\mathrm{tot}} \approx (0.4MNtot​≈(0.4-0.6)/ε20.6)/\varepsilon^20.6)/ε2 within ∼1.1×\sim 1.1\times∼1.1× of the schedule's Cramér-Rao limit.