Quantum Algorithm for Local-Volatility Option Pricing via the Kolmogorov Equation

• URL: http://arxiv.org/abs/2511.04942v1
• Date: Fri, 07 Nov 2025 03:02:43 GMT
• Title: Quantum Algorithm for Local-Volatility Option Pricing via the Kolmogorov Equation
• Authors: Nikita Guseynov, Mikel Sanz, Ángel Rodríguez-Rozas, Nana Liu, Javier Gonzalez-Conde,
• Abstract summary: Solution of option-pricing problems may turn out to be computationally demanding due to non-linear and path-dependent payoffs.<n> quantum computing has been proposed as a means to address these challenges efficiently.<n>We present an end-to-end quantum algorithmic framework that solves the Kolmogorov forward (Fokker-Planck) partial differential equation for local-volatility models.
• Score: 0.500208619516796
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The solution of option-pricing problems may turn out to be computationally demanding due to non-linear and path-dependent payoffs, the high dimensionality arising from multiple underlying assets, and sophisticated models of price dynamics. In this context, quantum computing has been proposed as a means to address these challenges efficiently. Prevailing approaches either simulate the stochastic differential equations governing the forward dynamics of underlying asset prices or directly solve the backward pricing partial differential equation. Here, we present an end-to-end quantum algorithmic framework that solves the Kolmogorov forward (Fokker-Planck) partial differential equation for local-volatility models by mapping it to a Hamiltonian-simulation problem via the Schr\"odingerisation technique. The algorithm specifies how to prepare the initial quantum state, perform Hamiltonian simulation, and how to efficiently recover the option price via a swap test. In particular, the efficiency of the final solution recovery is an important advantage of solving the forward versus the backward partial differential equation. Thus, our end-to-end framework offers a potential route toward quantum advantage for challenging option-pricing tasks. In particular, we obtain a polynomial advantage in grid size for the discretization of a single dimension. Nevertheless, the true power of our methodology lies in pricing high-dimensional systems, such as baskets of options, because the quantum framework admits an exponential speedup with respect to dimension, overcoming the classical curse of dimensionality.

Related papers

• Self-Supervised Coarsening of Unstructured Grid with Automatic Differentiation [55.88862563823878]
  In this work, we present an original algorithm to coarsen an unstructured grid based on the concepts of differentiable physics.<n>We demonstrate performance of the algorithm on two PDEs: a linear equation which governs slightly compressible fluid flow in porous media and the wave equation.<n>Our results show that in the considered scenarios, we reduced the number of grid points up to 10 times while preserving the modeled variable dynamics in the points of interest.
  arXiv  Detail & Related papers  (2025-07-24T11:02:13Z)
• Solving wave equation problems on D-Wave quantum annealers [44.99833362998488]
  We solve the one-dimensional Helmholtz equation in several scenarios using the quantum annealer provided by the D-Wave systems within a pseudospectral scheme.<n>We assess the performance of different strategies of encoding based on algebraic arguments and the adiabatic condition.
  arXiv  Detail & Related papers  (2025-07-18T08:06:43Z)
• Quantum Framework for Simulating Linear PDEs with Robin Boundary Conditions [0.6144680854063939]
  We propose an explicit, oracle-free quantum framework for numerically simulating general linear partial differential equations (PDEs)<n>Our approach begins with a general finite-difference discretization and applies the Schrodingerisation technique to transform the resulting system into one that admits unitary quantum evolution.
  arXiv  Detail & Related papers  (2025-06-25T14:23:38Z)
• Preconditioned FEM-based Neural Networks for Solving Incompressible Fluid Flows and Related Inverse Problems [41.94295877935867]
  numerical simulation and optimization of technical systems described by partial differential equations is expensive.<n>A comparatively new approach in this context is to combine the good approximation properties of neural networks with the classical finite element method.<n>In this paper, we extend this approach to saddle-point and non-linear fluid dynamics problems, respectively.
  arXiv  Detail & Related papers  (2024-09-06T07:17:01Z)
• Hybrid quantum-classical and quantum-inspired classical algorithms for solving banded circulant linear systems [0.8192907805418583]
  We present an efficient algorithm based on convex optimization of combinations of quantum states to solve for banded circulant linear systems. By decomposing banded circulant matrices into cyclic permutations, our approach produces approximate solutions to such systems with a combination of quantum states linear to $K$. We validate our methods with classical simulations and actual IBM quantum computer implementation, showcasing their applicability for solving physical problems such as heat transfer.
  arXiv  Detail & Related papers  (2023-09-20T16:27:16Z)
• Efficient Quantum Algorithms for Nonlinear Stochastic Dynamical Systems [2.707154152696381]
  We propose efficient quantum algorithms for solving nonlinear differential equations (SDE) via the associated Fokker-Planck equation (FPE) We discretize the FPE in space and time using two well-known numerical schemes, namely Chang-Cooper and implicit finite difference. We then compute the solution of the resulting system of linear equations using the quantum linear systems.
  arXiv  Detail & Related papers  (2023-03-04T17:40:23Z)
• Correspondence between open bosonic systems and stochastic differential equations [77.34726150561087]
  We show that there can also be an exact correspondence at finite $n$ when the bosonic system is generalized to include interactions with the environment. A particular system with the form of a discrete nonlinear Schr"odinger equation is analyzed in more detail.
  arXiv  Detail & Related papers  (2023-02-03T19:17:37Z)
• Quantum Kernel Methods for Solving Differential Equations [21.24186888129542]
  We propose several approaches for solving differential equations (DEs) with quantum kernel methods. We compose quantum models as weighted sums of kernel functions, where variables are encoded using feature maps and model derivatives are represented.
  arXiv  Detail & Related papers  (2022-03-16T18:56:35Z)
• A Variational Inference Approach to Inverse Problems with Gamma Hyperpriors [60.489902135153415]
  This paper introduces a variational iterative alternating scheme for hierarchical inverse problems with gamma hyperpriors. The proposed variational inference approach yields accurate reconstruction, provides meaningful uncertainty quantification, and is easy to implement.
  arXiv  Detail & Related papers  (2021-11-26T06:33:29Z)
• Quadratic Unconstrained Binary Optimisation via Quantum-Inspired Annealing [58.720142291102135]
  We present a classical algorithm to find approximate solutions to instances of quadratic unconstrained binary optimisation. We benchmark our approach for large scale problem instances with tuneable hardness and planted solutions.
  arXiv  Detail & Related papers  (2021-08-18T09:26:17Z)
• Efficient Hamiltonian Simulation for Solving Option Price Dynamics [0.0]
  We present a digital quantum algorithm to solve Black-Scholes equation on a quantum computer by mapping it to the Schr"odinger equation. The algorithm shows a feasible approach for using efficient Hamiltonian simulation techniques as Quantum Signal Processing.
  arXiv  Detail & Related papers  (2021-01-11T16:54:53Z)

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.