Paper: arXiv 2601.00009
Authors: Lucas Arenstein, Michael Kastoryano
Abstract
Pricing multi-asset options via the Black-Scholes PDE is limited by the curse of dimensionality: classical full-grid solvers scale exponentially in the number of underlyings and are effectively restricted to three assets. Practitioners typically rely on Monte Carlo methods for computing complex instrument involving multiple correlated underlyings. We show that quantized tensor trains (QTT) turn the d-asset Black-Scholes PDE into a tractable high-dimensional problem on a personal computer. We construct QTT representations of the operator, payoffs, and boundary conditions with ranks that scale polynomially in d and polylogarithmically in the grid size, and build two solvers: a time-stepping algorithm for European and American options and a space-time algorithm for European options. We compute full-grid prices and Greeks for correlated basket and max-min options in three to five dimensions with high accuracy. The methods introduced can comfortably be pushed to full-grid solutions on 10-15 underlyings, with further algorithmic optimization and more compute power.
Complexity vs Empirical Score
- Math Complexity: 8.5/10
- Empirical Rigor: 7.0/10
- Quadrant: Holy Grail — high math complexity, high empirical rigor
Why this score: The paper introduces advanced tensor network mathematics (QTT) to solve high-dimensional PDEs, demonstrating rigorous implementation on a laptop with specific numerical results for 3-5 assets. It focuses on algorithmic innovation and accuracy validation rather than live market deployment, fitting the high-math, high-rigor profile.
Research Flowchart
flowchart TD
A["Research Goal<br>Scalable Multi-Asset Option Pricing<br>overcoming Curse of Dimensionality"] --> B["Methodology: Quantized Tensor Train QTT"]
B --> C["Data Inputs<br>Black-Scholes PDE<br>Correlated Basket & Max-Min Options"]
C --> D{"Computational Solvers"}
D --> E["Time-Stepping Solver<br>American & European Options"]
D --> F["Space-Time Solver<br>European Options"]
E & F --> G["Key Outcomes<br>Full-Grid Pricing for 3-5 Assets<br>High Accuracy on PC"]
G --> H["Future Potential<br>Scalable to 10-15 Assets"]
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 the first QTT tensor‑network solvers that compute full‑grid solutions of the multi‑asset Black‑Scholes PDE for pricing options and Greeks on a laptop.
Source sentence
In contrast to these lines, our work takes a fundamentally different route: we present the first tensor-network (QTT) solvers to compute full-grid solutions of the multi-asset Black–Scholes PDE for pricing (and Greeks) – running on a laptop.
Assumes 3
- Underlying assets follow geometric Brownian motion under Black‑Scholes dynamics. model
Source sentence
under Black–Scholes dynamics each underlying follows a geometric Brownian motion, and therefore, are log-normally distributed.
- Synthetic market parameters (asset values, interest rates, volatilities, correlations) are used. market
Source sentence
Synthetic numerical values are chosen for market parameters (asset values, interest rates, volatilities and correlations), and for instrument features (strike price, maturity).
- Spatial domain bounds are set adaptively based on a coarse‑grid pilot run. other
Source sentence
In the present study we adopt an adaptive two–stage procedure. First, we run the QTT solver on a coarse grid
Data
- Deterministic Gauss–Hermite quadrature reference benchmark unknown
Source sentence
we compute the price using a deterministic Gauss–Hermite quadrature over the d-dimensional standard normal
Costs
Not applicable
Finds 3
- Accurate full‑grid solutions for d=3,4,5 assets are obtained on a laptop with run times validated against high‑accuracy references. performance
Source sentence
(i) In d = 3, 4, 5 we obtain accurate full grids on a laptop, with run times reported against high–accuracy references.
- For European options, space‑time solver is faster for d≤3 and provides the full temporal surface; for d>3, time‑stepping is typically preferable. performance
Source sentence
(ii) For European options, space–time is often faster for d ≤3 and uniquely gives the full temporal surface; for d > 3, time–stepping is typically preferable.
- Early‑exercise projection for American options adds only modest overhead; controlling QTT ranks dominates computational cost. performance
Source sentence
(iii) For Americans, the early–exercise projection adds only a modest overhead; keeping QTT ranks controlled is the dominant factor, not the raw grid size.
Checked by others
No other paper in the archive has been found to support or contradict these findings (compared with 22 related papers). Coverage is partial, so this is neither replication nor refutation.
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 (41)
- Low-rank explicit QTT representation of the Laplace operator and its inverse (2012) — link
- The Complete Guide to Option Pricing Formulas (2007)
- Tensor-Train Decomposition (2011) — link
- TT-cross approximation for multidimensional arrays (2010) — link
- The Alternating Linear Scheme for Tensor Optimization in the Tensor Train Format (2012) — link
- Valuing Asian and portfolio options by conditioning on the geometric mean price (1994)
- Valuing American Options by Simulation: A Simple Least-Squares Approach (2015)
- Fast and Flexible Quantum-Inspired Differential Equation Solvers with Data Integration (2025) — link
and 33 more
- Fast and simple method for pricing exotic options using Gauss–Hermite quadrature on a cubic spline interpolation (2014)
- Density matrix formulation for quantum renormalization groups (1992) — link
- O$(d \log N)$-Quantics Approximation of $N - d$ Tensors in High-Dimensional Numerical Modeling (2009) — link
- Solving high-dimensional parabolic PDEs using the tensor train format (2021) — link
- Exploiting the structure of turbulence with tensor networks (2022)
- A quantum-inspired approach to exploit turbulence structures (2022)
- Quantum-inspired framework for computational fluid dynamics (2024)
- Compression, simulation, and synthesis of turbulent flows with tensor trains (2025) — link
- Quantum-Inspired Tensor-Network Fractional-Step Method for Incompressible Flow in Curvilinear Coordinates (2025) — link
- Fast Solution of Parabolic Problems in the Tensor Train/Quantized Tensor Train Format with Initial Application to the Fokker–Planck Equation (2012) — link
- Solving differential Riccati equations: A nonlinear space-time method using tensor trains (2019) — link
- Tensor Network Space-Time Spectral Collocation Method for Time Dependent Convection-Diffusion-Reaction Equations (2024) — link
- Space-Time Spectral Element Tensor Network Approach for Time Dependent Convection Diffusion Reaction Equation with Variable Coefficients (2024) — link
- Space-Time Finite Element Tensor Network Approach for the Time-Dependent Convection–Diffusion–Reaction Equation with Variable Coefficients (2025)
- Quantum-inspired space-time PDE solver and dynamic mode decomposition (2025) — link
- Tensor-Programmable Quantum Circuits for Solving Differential Equations (2025) — link
- A highly efficient tensor network algorithm for multi-asset Fourier options pricing (2022) — link
- Low-rank tensor approximation for Chebyshev interpolation in parametric option pricing (2019) — link
- Learning parameter dependence for Fourier-based option pricing with tensor trains — → 2405.00701
- Tensor train representations of Greeks for Fourier-based pricing of multi-asset options — → 2507.08482
- Boosting Binomial Exotic Option Pricing with Tensor Networks — → 2505.17033
- Quantum-Inspired Tensor Neural Networks for Option Pricing (2022) — link
- Time series generation for option pricing on quantum computers using tensor network — → 2402.17148
- Learning tensor networks with tensor cross interpolation: new algorithms and libraries (2025)
- Multiscale interpolative construction of quantized tensor trains (2023) — link
- Quantum machine learning and quantum-inspired methods applied to computational fluid dynamics: a short review (2025) — link
- Arbitrage-free SABR (2014)
- Sparse grids (2004)
- Option pricing with a direct adaptive sparse grid approach (2012) — link
- A highly parallel Black–Scholes solver based on adaptive sparse grids (2012)
- Pricing with a Smile (1994) — link
- Option pricing when underlying stock returns are discontinuous (1976) — link
- Finite Difference Methods in Financial Engineering: A Partial Differential Equation Approach (2006)
4 of 41 cited works are in the corpus; resolved via arXiv source bundles, Semantic Scholar and OpenAlex. Corpus-wide: 2596 linked papers.