Paper: arXiv 2505.09459
Authors: Robert Scriba, Yuying Li, Jingbo B Wang
Abstract
Financial derivative pricing is a significant challenge in finance, involving the valuation of instruments like options based on underlying assets. While some cases have simple solutions, many require complex classical computational methods like Monte Carlo simulations and numerical techniques. However, as derivative complexities increase, these methods face limitations in computational power. Cases involving Non-Vanilla Basket pricing, American Options, and derivative portfolio risk analysis need extensive computations in higher-dimensional spaces, posing challenges for classical computers. Quantum computing presents a promising avenue by harnessing quantum superposition and entanglement, allowing the handling of high-dimensional spaces effectively. In this paper, we introduce a self-contained and all-encompassing quantum algorithm that operates without reliance on oracles or presumptions. More specifically, we develop an effective stochastic method for simulating exponentially many potential asset paths in quantum parallel, leading to a highly accurate final distribution of stock prices. Furthermore, we demonstrate how this algorithm can be extended to price more complex options and analyze risk within derivative portfolios.
Complexity vs Empirical Score
- Math Complexity: 8.5/10
- Empirical Rigor: 2.0/10
- Quadrant: Lab Rats — high math complexity, limited empirical testing
Why this score: The paper presents advanced quantum algorithms involving amplitude estimation, state preparation, and higher-dimensional simulations, indicating high mathematical complexity. However, it lacks any implementation details, backtesting, or empirical data, focusing purely on theoretical algorithmic development.
Research Flowchart
flowchart TD A["Research Goal<br>Quantum Monte Carlo Pricing<br>without Oracles/Assumptions"] --> B["Methodology<br>Self-Contained Quantum Algorithm"] B --> C["Input<br>Exponentially Many Asset Paths"] C --> D["Computational Process<br>Quantum Parallel Simulation"] D --> E["Output<br>High-Accuracy Stock Price Distribution"] E --> F["Key Finding 1<br>Pricing Non-Vanilla Basket Options"] E --> G["Key Finding 2<br>American Options & Risk Analysis"] F --> H["Outcome<br>Scalable High-Dimensional<br>Computational Advantage"] G --> H
Evidence Card
What the authors claim, on what data, and who has checked it. Read from the paper's own text by a language model: every quote is verbatim, nothing was re-run. How to read this card
Proposes
The paper proposes a stochastic method for simulating exponentially many asset price paths in quantum parallel to price options and assess portfolio risk.
Source sentence
we develop an effective stochastic method for simulating exponentially many potential asset paths in quantum parallel, leading to a highly accurate final distribution of stock prices.
Assumes 5
- The underlying asset follows a Black‑Scholes stochastic evolution with constant drift µ and volatility σ. model
Source sentence
drift term = µ × ∆t × St−1, µ is the drift rate, and the diffusion term = σ × ∆Wt−1 × St−1, σ is the volatility of the stock
- The Brownian increment ∆W is normally distributed with mean 0 and standard deviation √Δt. statistical
Source sentence
∆W is a stochastic variable, which is normally distributed about mean = 0 and std.= √∆t.
- Time to expiry is discretised into m = T/Δt equal steps. model
Source sentence
time to expiry of the option is discretised into m = T/∆t time steps.
- A logistic map with r=4 can generate a chaotic seed for sampling independent normal variables. execution
Source sentence
The seed generation function involves utilising a logistic map of r=4 to create approximate chaos
Show 1 more
- The number of quantum simulations N equals 2^{n_qubits}, where n_qubits is the number of index qubits. other
Source sentence
the equivalent number of simulations of the MCQP algorithm is given by N = 2nqubits where nqubits is the number of index qubits
Data
- Synthetic Black‑Scholes Monte‑Carlo simulations synthetic unknown
Source sentence
... calculating an option price under the BSM, given a set of initial parameters, using a slightly modified classical Monte‑Carlo simulation
Costs
Not applicable
Finds 3
- Pricing error decreases rapidly with the number of simulated paths, scaling down significantly quicker than classical Monte‑Carlo error. theoretical
Source sentence
pricing error scales down significantly quicker, as would be theoretically expected.
- Mean pricing error shows little dependence on the number of time steps beyond about 100 steps, where error plateaus. performance
Source sentence
error begins to plateau at approximately 100 time steps.
- Initial indications suggest lesser dependency of pricing accuracy on numerical precision bits and time steps compared with the number of simulations. performance
Source sentence
model inputs and required computational resources and found initial indications of lesser dependency on numerical precision and time steps compared with the number of simulations.
Checked by others
Contradicted by
- Error Analysis of Option Pricing via Deep PDE Solvers: Empirical Study
Compare the findings
This paper: Mean pricing error shows little dependence on the number of time steps beyond about 100 steps, where error plateaus.
That paper: A strong linear relationship exists between 1/√time steps and error, confirming that finer time discretization reduces pricing error, especially for MDBDP.
Code
No repository by the authors found in the paper.
Extracted 2026-11-14 · same card as JSON · A language model chose these items: check the source sentence before relying on one.
Cited References (50)
- Option pricing using quantum computers (2020)
- Quantum option pricing and data analysis (2019)
- Quantum option pricing and quantum finance (2020)
- Quantum advantage of Monte Carlo option pricing (2023)
- Quantum systems for Monte Carlo methods and applications to fractional stochastic processes (2019)
- Quantum computational finance: Monte Carlo pricing of financial derivatives (2018)
- Creating superpositions that correspond to efficiently integrable probability distributions (2002)
- Quantum-state preparation with universal gate decompositions (2011)
and 42 more
- Quantum Monte Carlo algorithm for solving Black-Scholes PDEs for high-dimensional option pricing in finance and its proof of overcoming the curse of dimensionality (2023)
- Efficient State Preparation for Quantum Amplitude Estimation (2021)
- Quantum Monte Carlo Integration: The Full Advantage in Minimal Circuit Depth (2022)
- Portfolio Value-at-Risk with Heavy-Tailed Risk Factors (2002)
- Quantum Monte Carlo simulations for estimating FOREX markets: a speculative attacks experience (2023)
- Quantum algorithm for credit valuation adjustments (2022)
- Quantum algorithm for stochastic optimal stopping problems with applications in finance (2023)
- Pricing American options for interest rate caps and coupon bonds in quantum finance (2007)
- Structural reliability : analysis and prediction (1999)
- Stochastic Calculus for Finance (2003 - 2004)
- The Concepts and Practice of Mathematical Finance (2006)
- Options, Futures, and Other Derivatives, Global Edition. (2017)
- Stochastic calculus and differential equations for physics and finance (2013)
- The Pricing of Options and Corporate Liabilities (1973)
- Theory of Rational Option Pricing (1973)
- Stochastic Differential Equations (2011)
- A Closed-Form Solution for Options with Stochastic Volatility with Applications to Bond and Currency Options (1993)
- Elements of Statistical Learning: Data Mining, Inference, and Prediction (2009)
- Option pricing using Machine Learning (2021)
- Fractional calculus and continuous-time finance II: the waiting-time distribution (2000)
- PDE and Martingale Methods in Option Pricing (2011)
- Monte Carlo methods for security pricing (1997)
- Dynamic programming and mathematical economics (1963)
- Machine learning for pricing American options in high-dimensional Markovian and non-Markovian models (2020)
- Quantum computing for finance: Overview and prospects (2019)
- Quantum risk analysis (2019)
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer (1999)
- A fast quantum mechanical algorithm for database search (1996)
- Quantum computation and quantum information (2000)
- Quantum Computation and Quantum Information (2012)
- Basic concepts in quantum computation (2000)
- A variational eigenvalue solver on a photonic quantum processor (2014)
- Quantum walk-based portfolio optimisation (2021)
- Recent progress and perspectives on quantum computing for finance (2022)
- Benchmarking Quantum Annealing Controls with Portfolio Optimization (2021)
- A Survey on Quantum Computational Finance for Derivatives Pricing and VaR (2022)
- Methods of numerical integration (1984)
- A new quantum ripple-carry addition circuit (2004)
- Quantum Encoding of Structured Data with Matrix Product States (2025) — link
- Quantum Computing for Option Portfolio Analysis (2024) — link
- Valuation of large variable annuity portfolios under nested simulation: A functional data approach (2015)
- Efficient Risk Estimation via Nested Sequential Simulation (2011)
0 of 50 cited works are in the corpus; resolved via arXiv source bundles, Semantic Scholar and OpenAlex. Corpus-wide: 2596 linked papers.