Quantum computing for multidimensional option pricing: End-to-end pipeline

• URL: http://arxiv.org/abs/2601.04049v1
• Date: Wed, 07 Jan 2026 16:07:19 GMT
• Title: Quantum computing for multidimensional option pricing: End-to-end pipeline
• Authors: Julien Hok, Álvaro Leitao,
• Abstract summary: This work introduces an end-to-end framework for multi-asset option pricing.<n>It combines market-consistent risk-neutral density recovery with quantum-accelerated numerical integration.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: This work introduces an end-to-end framework for multi-asset option pricing that combines market-consistent risk-neutral density recovery with quantum-accelerated numerical integration. We first calibrate arbitrage-free marginal distributions from European option quotes using the Normal Inverse Gaussian (NIG) model, leveraging its analytical tractability and ability to capture skewness and fat tails. Marginals are coupled via a Gaussian copula to construct joint distributions. To address the computational bottleneck of the high-dimensional integration required to solve the option pricing formula, we employ Quantum Accelerated Monte Carlo (QAMC) techniques based on Quantum Amplitude Estimation (QAE), achieving quadratic convergence improvements over classical Monte Carlo (CMC) methods. Theoretical results establish accuracy bounds and query complexity for both marginal density estimation (via cosine-series expansions) and multidimensional pricing. Empirical tests on liquid equity entities (Credit Agricole, AXA, Michelin) confirm high calibration accuracy and demonstrate that QAMC requires 10-100 times fewer queries than classical methods for comparable precision. This study provides a practical route to integrate arbitrage-aware modelling with quantum computing, highlighting implications for scalability and future extensions to complex derivatives.

Related papers

• Stability and Generalization of Push-Sum Based Decentralized Optimization over Directed Graphs [55.77845440440496]
  Push-based decentralized communication enables optimization over communication networks, where information exchange may be asymmetric.<n>We develop a unified uniform-stability framework for the Gradient Push (SGP) algorithm.<n>A key technical ingredient is an imbalance-aware generalization bound through two quantities.
  arXiv  Detail & Related papers  (2026-02-24T05:32:03Z)
• Quantum Speedups for Derivative Pricing Beyond Black-Scholes [13.340091066357049]
  This paper explores advancements in quantum algorithms for derivative pricing of exotics.<n>We extend existing frameworks to demonstrate novel quadratic speedups for more practical models.<n>We also present an improved analysis of derivative pricing, leading to substantial reductions in the resource requirements for pricing GBM and CIR models.
  arXiv  Detail & Related papers  (2026-02-03T16:45:24Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Optimal Multiparameter Quantum Estimation of Magnonic Couplings in a Magnomechanical Cavity [0.0]
  We introduce an experimentally viable scheme to enhance the simultaneous estimation precision of the couplings $G_mc$ and $G_mb$.<n>We show that under certain conditions, heterodyne detection can closely approach the ultimate precision set by the QFIM.<n>This suggests that a measurement strategy based on heterodyne detection can offer an efficient and practical route for estimating the couplings.
  arXiv  Detail & Related papers  (2025-11-15T20:45:26Z)
• Quantum Machine Learning methods for Fourier-based distribution estimation with application in option pricing [42.79174867716636]
  We introduce two hybrid classical-quantum methods to address the option pricing problem.<n>We show that the proposed methods achieve remarkable accuracy, becoming a competitive quantum alternative for derivatives valuation.
  arXiv  Detail & Related papers  (2025-10-22T11:43:08Z)
• Quantum Kernel Methods: Convergence Theory, Separation Bounds and Applications to Marketing Analytics [0.22940141855172033]
  This work studies the feasibility of applying quantum kernel methods to a real consumer classification task in the NISQ regime.<n>We present a hybrid pipeline that combines a quantum- Kernel Support Vector Machine (Q-SVM) with a quantum feature extraction module (QFE)
  arXiv  Detail & Related papers  (2025-10-11T14:11:41Z)
• 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)
• MPQ-DMv2: Flexible Residual Mixed Precision Quantization for Low-Bit Diffusion Models with Temporal Distillation [74.34220141721231]
  We present MPQ-DMv2, an improved textbfMixed textbfPrecision textbfQuantization framework for extremely low-bit textbfDiffusion textbfModels.
  arXiv  Detail & Related papers  (2025-07-06T08:16:50Z)
• Practical Application of the Quantum Carleman Lattice Boltzmann Method in Industrial CFD Simulations [44.99833362998488]
  This work presents a practical numerical assessment of a hybrid quantum-classical approach to CFD based on the Lattice Boltzmann Method (LBM)<n>We evaluate this method on three benchmark cases featuring different boundary conditions, periodic, bounceback, and moving wall.<n>Our results confirm the validity of the approach, achieving median error fidelities on the order of $10-3$ and success probabilities sufficient for practical quantum state sampling.
  arXiv  Detail & Related papers  (2025-04-17T15:41:48Z)
• Gradient-free variational learning with conditional mixture networks [39.827869318925494]
  We introduce CAVI-CMN, a fast, gradient-free variational method for training conditional mixture networks (CMNs)<n>CAVI-CMN achieves competitive and often superior predictive accuracy compared to maximum likelihood estimation (MLE) with backpropagation.<n>As input size or the number of experts increases, computation time scales competitively with MLE.
  arXiv  Detail & Related papers  (2024-08-29T10:43:55Z)
• Ensemble Multi-Quantiles: Adaptively Flexible Distribution Prediction for Uncertainty Quantification [4.728311759896569]
  We propose a novel, succinct, and effective approach for distribution prediction to quantify uncertainty in machine learning. It incorporates adaptively flexible distribution prediction of $mathbbP(mathbfy|mathbfX=x)$ in regression tasks. On extensive regression tasks from UCI datasets, we show that EMQ achieves state-of-the-art performance.
  arXiv  Detail & Related papers  (2022-11-26T11:45:32Z)
• Generalizable Mixed-Precision Quantization via Attribution Rank Preservation [90.26603048354575]
  We propose a generalizable mixed-precision quantization (GMPQ) method for efficient inference. Our method obtains competitive accuracy-complexity trade-off compared with the state-of-the-art mixed-precision networks.
  arXiv  Detail & Related papers  (2021-08-05T16:41:57Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• APQ: Joint Search for Network Architecture, Pruning and Quantization Policy [49.3037538647714]
  We present APQ for efficient deep learning inference on resource-constrained hardware. Unlike previous methods that separately search the neural architecture, pruning policy, and quantization policy, we optimize them in a joint manner. With the same accuracy, APQ reduces the latency/energy by 2x/1.3x over MobileNetV2+HAQ.
  arXiv  Detail & Related papers  (2020-06-15T16:09:17Z)

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.