Quantum Amplitude Estimation for Catastrophe Insurance Tail-Risk Pricing: Empirical Convergence and NISQ Noise Analysis

• URL: http://arxiv.org/abs/2603.15664v1
• Date: Tue, 10 Mar 2026 15:20:57 GMT
• Title: Quantum Amplitude Estimation for Catastrophe Insurance Tail-Risk Pricing: Empirical Convergence and NISQ Noise Analysis
• Abstract summary: Quantum Amplitude Estimation (QAE), following Montanaro, convergence approaches order reciprocal N in oracle queries.<n>We validate this advantage empirically using a Qiskit Aer simulator with genuine Grover amplification.<n>Seven experiments on synthetic and real (NOAA Storm Events, 58,028 records) data yield three main findings.
• Score: 0.13537117504260618
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Classical Monte Carlo methods for pricing catastrophe insurance tail risk converge at order reciprocal root N, requiring large simulation budgets to resolve upper-tail percentiles of the loss distribution. This sample-sparsity problem can lead to AI models trained on impoverished tail data, producing poorly calibrated risk estimates where insolvency risk is greatest. Quantum Amplitude Estimation (QAE), following Montanaro, achieves convergence approaching order reciprocal N in oracle queries - a quadratic speedup that, at scale, would enable high-resolution tail estimation within practical budgets. We validate this advantage empirically using a Qiskit Aer simulator with genuine Grover amplification. A complete pipeline encodes fitted lognormal catastrophe distributions into quantum oracles via amplitude encoding, producing small readout probabilities that enable safe Grover amplification with up to k=16 iterations. Seven experiments on synthetic and real (NOAA Storm Events, 58,028 records) data yield three main findings: an oracle-model advantage, that strong classical baselines win when analytical access is available, and that discretisation, not estimation, is the current bottleneck.

Related papers

• Retrieval-Guided Fine-Tuning as Noisy Estimation: Risk bounds and Architectural Analysis [1.381684956393831]
  Retrieval-Guided Fine-Tuning (RAG-FT) incorporates retrieved data directly into the training objective, but the statistical consequences of noisy retrieval during training remain theoretically undercharacterized.<n>We show that retrieval failure decays exponentially with task separation relative to noise, and derive explicit finite-sample conditions under which RAG-FT achieves lower risk than both target-only and full-corpus training.<n>We prove that the attention estimator's bias diverges as $(n2q)$ even under exact retrieval, while OLS risk remains $(d/n)$ for every noise
  arXiv  Detail & Related papers  (2026-09-13T12:51:02Z)
• Quantum Rare-Event Estimation for Ising Graphical Models with Belief-Propagation State Preparation [0.0]
  Quantum estimation can reduce the sampling cost of rare-event probability estimation.<n>Applying it to correlated Ising graphical models is limited by the difficulty of preparing the target distribution and building a practical event oracle.<n>This work explores two approximate strategies for mitigating these challenges.
  arXiv  Detail & Related papers  (2026-08-27T09:12:47Z)
• Quantum Counterparty Credit Risk: A Study of Path-Dependent Derivatives [1.813553694972824]
  We present a hybrid quantum-classical framework to estimate future exposure for path-dependent derivatives.<n>We employ discretisation of the FX process and a linearised approximation to enable implementation on current platforms.<n>Our framework offers a tractable testbed for quantum acceleration.
  arXiv  Detail & Related papers  (2026-06-27T03:03:44Z)
• Neuro-Symbolic Financial Reasoning via Deterministic Fact Ledgers and Adversarial Low-Latency Hallucination Detector [2.950245545999729]
  We introduce the Verifiable Numerical Reasoning Agent (VeNRA)<n>VeNRA shifts the RAG paradigm from retrieving probabilistic text to retrieving deterministic variables via a strictly typed Universal Fact Ledger (UFL)<n>We train the Sentinel: a 3-billion SLM trained to forensically audit candidate using a single-token inference budget.
  arXiv  Detail & Related papers  (2026-03-04T22:55:16Z)
• Generalized Bayes for Causal Inference [47.66564705927885]
  Uncertainty quantification is central to many applications of causal machine learning.<n>Standard Bayesian approaches typically require specifying a probabilistic model for the data-generating process.<n>We propose a generalized Bayesian framework for causal inference.
  arXiv  Detail & Related papers  (2026-03-03T14:27:23Z)
• Stabilized Maximum-Likelihood Iterative Quantum Amplitude Estimation for Structural CVaR under Correlated Random Fields [0.0]
  Conditional Value-at-Risk (CVaR) is a central tail-risk measure in structural mechanics.<n>We develop a quantum-enhanced inference framework that casts CVaR evaluation as a confidence-constrained maximum-likelihood amplitude estimation problem.
  arXiv  Detail & Related papers  (2026-02-10T14:53:26Z)
• Scalable and Reliable State-Aware Inference of High-Impact N-k Contingencies [4.588028371034407]
  Exhaustive evaluation of all outage combinations using AC power-flow or ACOPF is infeasible in routine operation.<n>This paper proposes a scalable, state-aware contingency inference framework designed to directly generate high-impact $N!-!k$ outage scenarios.
  arXiv  Detail & Related papers  (2026-02-10T06:55:59Z)
• Statistical Estimation of Adversarial Risk in Large Language Models under Best-of-N Sampling [50.872910438715486]
  Large Language Models (LLMs) are typically evaluated for safety under single-shot or low-budget adversarial prompting.<n>We propose a scaling-aware Best-of-N estimation of risk, SABER, for modeling jailbreak vulnerability under Best-of-N sampling.
  arXiv  Detail & Related papers  (2026-01-30T06:54:35Z)
• Quantum Subgradient Estimation for Conditional Value-at-Risk Optimization [0.0]
  Conditional Value-at-Risk (CVaR) is a leading tail-risk measure in finance.<n>We analyze a quantum subgradient oracle for CVaR minimization based on amplitude estimation.
  arXiv  Detail & Related papers  (2025-10-06T12:09:43Z)
• Probabilistically Tightened Linear Relaxation-based Perturbation Analysis for Neural Network Verification [83.25968588249776]
  We present a novel framework that combines over-approximation techniques from LiRPA-based approaches with a sampling-based method to compute tight intermediate reachable sets.<n>With negligible computational overhead, $textttPT-LiRPA$ exploiting the estimated reachable sets, significantly tightens the lower and upper linear bounds of a neural network's output.
  arXiv  Detail & Related papers  (2025-07-07T18:45:53Z)
• COIN: Uncertainty-Guarding Selective Question Answering for Foundation Models with Provable Risk Guarantees [51.5976496056012]
  COIN is an uncertainty-guarding selection framework that calibrates statistically valid thresholds to filter a single generated answer per question.<n>COIN estimates the empirical error rate on a calibration set and applies confidence interval methods to establish a high-probability upper bound on the true error rate.<n>We demonstrate COIN's robustness in risk control, strong test-time power in retaining admissible answers, and predictive efficiency under limited calibration data.
  arXiv  Detail & Related papers  (2025-06-25T07:04:49Z)
• Asymptotically Optimal Linear Best Feasible Arm Identification with Fixed Budget [55.938644481736446]
  We introduce a novel algorithm for best feasible arm identification that guarantees an exponential decay in the error probability.<n>We validate our algorithm through comprehensive empirical evaluations across various problem instances with different levels of complexity.
  arXiv  Detail & Related papers  (2025-06-03T02:56:26Z)
• Decision from Suboptimal Classifiers: Excess Risk Pre- and Post-Calibration [52.70324949884702]
  We quantify the excess risk incurred using approximate posterior probabilities in batch binary decision-making.<n>We identify regimes where recalibration alone addresses most of the regret, and regimes where the regret is dominated by the grouping loss.<n>On NLP experiments, we show that these quantities identify when the expected gain of more advanced post-training is worth the operational cost.
  arXiv  Detail & Related papers  (2025-03-23T10:52:36Z)
• Amortized Conditional Normalized Maximum Likelihood: Reliable Out of Distribution Uncertainty Estimation [99.92568326314667]
  We propose the amortized conditional normalized maximum likelihood (ACNML) method as a scalable general-purpose approach for uncertainty estimation. Our algorithm builds on the conditional normalized maximum likelihood (CNML) coding scheme, which has minimax optimal properties according to the minimum description length principle. We demonstrate that ACNML compares favorably to a number of prior techniques for uncertainty estimation in terms of calibration on out-of-distribution inputs.
  arXiv  Detail & Related papers  (2020-11-05T08:04:34Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.