Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2207.01277 · IEEE Transactions on Quantum Engineering

Pricing Multiasset Derivatives by Variational Quantum Algorithms

Kenji Kubo, Koichi Miyamoto, Kosuke Mitarai, Keisuke Fujii

Published Jan 1, 2023• 18 citations
arXivHTMLPDF

Abstract

Pricing a multiasset derivative is an important problem in financial engineering, both theoretically and practically. Although it is suitable to numerically solve partial differential equations to calculate the prices of certain types of derivatives, the computational complexity increases exponentially as the number of underlying assets increases in some classical methods, such as the finite difference method. Therefore, there are efforts to reduce the computational complexity by using quantum computation. However, when solving with naive quantum algorithms, the target derivative price is embedded in the amplitude of one basis of the quantum state, and so an exponential complexity is required to obtain the solution. To avoid the bottleneck, our previous study utilizes the fact that the present price of a derivative can be obtained by its discounted expected value at any future point in time and shows that the quantum algorithm can reduce the complexity. In this article, to make the algorithm feasible to run on a small quantum computer, we use variational quantum simulation to solve the Black–Scholes equation and compute the derivative price from the inner product between the solution and a probability distribution. This avoids the measurement bottleneck of the naive approach and would provide quantum speedup even in noisy quantum computers. We also conduct numerical experiments to validate our method. Our method will be an important breakthrough in derivative pricing using small-scale quantum computers.

DOI
10.1109/tqe.2023.3269525

Related papers

Pricing Multi-Asset Derivatives by Finite-Difference Method on a Quantum Computer

Koichi Miyamoto, Kenji Kubo

Following the recent great advance of quantum computing technology, there are growing interests in its applications to industries, including finance. In this article, we focus on derivative pricing based on solving the Black–Scholes partial differential equation by the finite-difference method (FDM), which is a suitable approach for some types of derivatives but suffers from thecurse of dimensionality, that is, exponential growth of complexity in the case of multiple underlying assets. We propose a quantum algorithm for FDM-based pricing of multi-asset derivative with exponential speedup with respect to dimensionality compared with classical algorithms. The proposed algorithm utilizes the quantum algorithm for solving differential equations, which is based on quantum linear system algorithms. Addressing the specific issue in derivative pricing, that is, extracting the derivative price for the present underlying asset prices from the output state of the quantum algorithm, we present the whole of the calculation process and estimate its complexity. We believe that the proposed method opens the new possibility of accurate and high-speed derivative pricing by quantum computers.

arXiv:2109.12896•IEEE Transactions on Quantum Engineering•Nov 17, 2021•32 citations

Quantum computational finance for martingale asset pricing in incomplete markets

Patrick Rebentrost, Alessandro Luongo, Bin Cheng +2 more

A derivative is a financial asset whose future payoff is a function of underlying assets. Pricing a financial derivative involves setting up a market model, finding a martingale ("fair game") probability measure for the model from the existing asset prices, and using that probability measure to price the derivative. When the number of underlying assets and/or the number of market outcomes in the model is large, pricing can be computationally demanding. In this work, we first formulate the pricing problem in a linear algebra setting, including the realistic setting of incomplete markets where derivatives do not have a unique price. We show that the problem can be solved with a variety of quantum techniques such as quantum linear programming and the quantum linear systems algorithm. While in previous works the martingale measure is assumed to be given, here it is extracted from market variables akin to bootstrapping, a common practice among financial institutions. We discuss the quantum zero-sum game algorithm and the quantum simplex algorithm as viable subroutines. For quantum linear systems solvers, we formalize a new market assumption milder than market completeness, which allows the potential for large speedups. Towards prototype use cases, we conduct numerical experiments motivated by the Black-Scholes-Merton model.

arXiv:2209.08867•Scientific Reports•Aug 15, 2024•23 citations

Efficient Hamiltonian simulation for solving option price dynamics

Javier Gonzalez-Conde, Ángel Rodríguez‐Rozas, E. Solano +1 more

Pricing financial derivatives, in particular European-style options at different time-maturities and strikes, means a relevant problem in finance. The dynamics describing the price of vanilla options when constant volatilities and interest rates are assumed is governed by the Black-Scholes model, a linear parabolic partial differential equation with terminal value given by the payoff of the option contract and no additional boundary conditions. Here, we present a digital quantum algorithm to solve the Black-Scholes equation on a quantum computer by mapping it to the Schr\"odinger equation. The non-Hermitian nature of the resulting Hamiltonian is solved by embedding its propagator into an enlarged Hilbert space by using only one additional ancillary qubit. Moreover, due to the choice of periodic boundary conditions, given by the definition of the discretized momentum operator, we duplicate the initial condition, which substantially improves the stability and performance of the protocol. The algorithm shows a feasible approach for using efficient Hamiltonian simulation techniques as quantum signal processing to solve the price dynamics of financial derivatives on a digital quantum computer. Our approach differs from those based on Monte Carlo integration, exclusively focused on sampling the solution assuming the dynamics is known. We report expected accuracy levels comparable to classical numerical algorithms by using nine qubits to simulate its dynamics on a fault-tolerant quantum computer, and an expected success probability of the post-selection procedure due to the embedding protocol above 60%.

arXiv:2101.04023•Physical Review Research•Dec 8, 2023•57 citations

Quantum Speedups for Derivative Pricing Beyond Black-Scholes

Dylan Herman, Yue Sun, Jin-Peng Liu +5 more

This paper explores advancements in quantum algorithms for derivative pricing of exotics, a computational pipeline of fundamental importance in quantitative finance. For such cases, the classical Monte Carlo integration procedure provides the state-of-the-art provable, asymptotic performance: polynomial in problem dimension and quadratic in inverse-precision. While quantum algorithms are known to offer quadratic speedups over classical Monte Carlo methods, end-to-end speedups have been proven only in the simplified setting over the Black-Scholes geometric Brownian motion (GBM) model. This paper extends existing frameworks to demonstrate novel quadratic speedups for more practical models, such as the Cox-Ingersoll-Ross (CIR) model and a variant of Heston's stochastic volatility model, utilizing a characteristic of the underlying SDEs which we term fast-forwardability. Additionally, for general models that do not possess the fast-forwardable property, we introduce a quantum Milstein sampler, based on a novel quantum algorithm for sampling Lévy areas, which enables quantum multi-level Monte Carlo to achieve quadratic speedups for multi-dimensional stochastic processes exhibiting certain correlation types. We also present an improved analysis of numerical integration for derivative pricing, leading to substantial reductions in the resource requirements for pricing GBM and CIR models. Furthermore, we investigate the potential for additional reductions using arithmetic-free quantum procedures. Finally, we critique quantum partial differential equation (PDE) solvers as a method for derivative pricing based on amplitude estimation, identifying theoretical barriers that obstruct achieving a quantum speedup through this approach. Our findings significantly advance the understanding of quantum algorithms in derivative pricing, addressing key challenges and open questions in the field.

quant-pharXiv:2602.03725•Feb 4, 2026•5 citations

Quantum variational solving of nonlinear and multidimensional partial differential equations

Abhijat Sarma, Thomas W. Watts, Mudassir Moosa +2 more

A variational quantum algorithm for numerically solving partial differential equations (PDEs) on a quantum computer was proposed by Lubasch et al. [Phys. Rev. A 101, 010301(R) (2020)]. In this paper we generalize the method introduced by Lubasch et al. to cover a broader class of nonlinear PDEs as well as multidimensional PDEs and study the performance of the variational quantum algorithm on several example equations. Specifically, we show via numerical simulations that the algorithm can solve instances of the single-asset Black-Scholes equation with a nontrivial nonlinear volatility model, the double-asset Black-Scholes equation, the Buckmaster equation, and the deterministic Kardar-Parisi-Zhang equation. Our simulations use up to $n=12$ Ansatz qubits, computing PDE solutions with ${2}^{n}$ grid points. We also perform proof-of-concept demonstrations with a trapped-ion quantum processor from IonQ [Nat. Commun. 10, 5464 (2019)], showing accurate computation of two representative expectation values needed for the calculation of a single time step of the nonlinear Black-Scholes equation. Through our classical simulations and demonstrations on quantum hardware, we identify and discuss several open challenges for using quantum variational methods to solve PDEs in a regime with a large number (much greater than ${2}^{20}$) of grid points, but also a practical number of gates per circuit and circuit shots.

arXiv:2311.01531•Physical Review A•Jun 21, 2024•52 citations

Quantum-inspired variational algorithms for partial differential equations: application to financial derivative pricing

Tianchen Zhao, Chuhao Sun, Asaf Cohen +2 more

Variational quantum Monte Carlo (VMC) combined with neural-network quantum states offers a novel angle of attack on the curse-of-dimensionality encountered in a particular class of partial differential equations (PDEs); namely, the real- and imaginary time-dependent Schrödinger equation. In this paper, we present a simple generalization of VMC applicable to arbitrary time-dependent PDEs, showcasing the technique in the multi-asset Black-Scholes PDE for pricing European options contingent on many correlated underlying assets.

arXiv:2207.10838•Quantitative Finance•Sep 29, 2023•9 citations
Pricing a multiasset derivative is an important problem in financial engineering, both theoretically and practically. Although it is suitable to numerically solve partial differential equations to calculate the prices of certain types of derivatives, the computational complexity increases exponentially as the number of underlying assets increases in some classical methods, such as the finite difference method. Therefore, there are efforts to reduce the computational complexity by using quantum computation. However, when solving with naive quantum algorithms, the target derivative price is embedded in the amplitude of one basis of the quantum state, and so an exponential complexity is required to obtain the solution. To avoid the bottleneck, our previous study utilizes the fact that the present price of a derivative can be obtained by its discounted expected value at any future point in time and shows that the quantum algorithm can reduce the complexity. In this article, to make the algorithm feasible to run on a small quantum computer, we use variational quantum simulation to solve the Black–Scholes equation and compute the derivative price from the inner product between the solution and a probability distribution. This avoids the measurement bottleneck of the naive approach and would provide quantum speedup even in noisy quantum computers. We also conduct numerical experiments to validate our method. Our method will be an important breakthrough in derivative pricing using small-scale quantum computers.
Following the recent great advance of quantum computing technology, there are growing interests in its applications to industries, including finance. In this article, we focus on derivative pricing based on solving the Black–Scholes partial differential equation by the finite-difference method (FDM), which is a suitable approach for some types of derivatives but suffers from thecurse of dimensionality, that is, exponential growth of complexity in the case of multiple underlying assets. We propose a quantum algorithm for FDM-based pricing of multi-asset derivative with exponential speedup with respect to dimensionality compared with classical algorithms. The proposed algorithm utilizes the quantum algorithm for solving differential equations, which is based on quantum linear system algorithms. Addressing the specific issue in derivative pricing, that is, extracting the derivative price for the present underlying asset prices from the output state of the quantum algorithm, we present the whole of the calculation process and estimate its complexity. We believe that the proposed method opens the new possibility of accurate and high-speed derivative pricing by quantum computers.
A derivative is a financial asset whose future payoff is a function of underlying assets. Pricing a financial derivative involves setting up a market model, finding a martingale ("fair game") probability measure for the model from the existing asset prices, and using that probability measure to price the derivative. When the number of underlying assets and/or the number of market outcomes in the model is large, pricing can be computationally demanding. In this work, we first formulate the pricing problem in a linear algebra setting, including the realistic setting of incomplete markets where derivatives do not have a unique price. We show that the problem can be solved with a variety of quantum techniques such as quantum linear programming and the quantum linear systems algorithm. While in previous works the martingale measure is assumed to be given, here it is extracted from market variables akin to bootstrapping, a common practice among financial institutions. We discuss the quantum zero-sum game algorithm and the quantum simplex algorithm as viable subroutines. For quantum linear systems solvers, we formalize a new market assumption milder than market completeness, which allows the potential for large speedups. Towards prototype use cases, we conduct numerical experiments motivated by the Black-Scholes-Merton model.
Pricing financial derivatives, in particular European-style options at different time-maturities and strikes, means a relevant problem in finance. The dynamics describing the price of vanilla options when constant volatilities and interest rates are assumed is governed by the Black-Scholes model, a linear parabolic partial differential equation with terminal value given by the payoff of the option contract and no additional boundary conditions. Here, we present a digital quantum algorithm to solve the Black-Scholes equation on a quantum computer by mapping it to the Schr\"odinger equation. The non-Hermitian nature of the resulting Hamiltonian is solved by embedding its propagator into an enlarged Hilbert space by using only one additional ancillary qubit. Moreover, due to the choice of periodic boundary conditions, given by the definition of the discretized momentum operator, we duplicate the initial condition, which substantially improves the stability and performance of the protocol. The algorithm shows a feasible approach for using efficient Hamiltonian simulation techniques as quantum signal processing to solve the price dynamics of financial derivatives on a digital quantum computer. Our approach differs from those based on Monte Carlo integration, exclusively focused on sampling the solution assuming the dynamics is known. We report expected accuracy levels comparable to classical numerical algorithms by using nine qubits to simulate its dynamics on a fault-tolerant quantum computer, and an expected success probability of the post-selection procedure due to the embedding protocol above 60%.
This paper explores advancements in quantum algorithms for derivative pricing of exotics, a computational pipeline of fundamental importance in quantitative finance. For such cases, the classical Monte Carlo integration procedure provides the state-of-the-art provable, asymptotic performance: polynomial in problem dimension and quadratic in inverse-precision. While quantum algorithms are known to offer quadratic speedups over classical Monte Carlo methods, end-to-end speedups have been proven only in the simplified setting over the Black-Scholes geometric Brownian motion (GBM) model. This paper extends existing frameworks to demonstrate novel quadratic speedups for more practical models, such as the Cox-Ingersoll-Ross (CIR) model and a variant of Heston's stochastic volatility model, utilizing a characteristic of the underlying SDEs which we term fast-forwardability. Additionally, for general models that do not possess the fast-forwardable property, we introduce a quantum Milstein sampler, based on a novel quantum algorithm for sampling Lévy areas, which enables quantum multi-level Monte Carlo to achieve quadratic speedups for multi-dimensional stochastic processes exhibiting certain correlation types. We also present an improved analysis of numerical integration for derivative pricing, leading to substantial reductions in the resource requirements for pricing GBM and CIR models. Furthermore, we investigate the potential for additional reductions using arithmetic-free quantum procedures. Finally, we critique quantum partial differential equation (PDE) solvers as a method for derivative pricing based on amplitude estimation, identifying theoretical barriers that obstruct achieving a quantum speedup through this approach. Our findings significantly advance the understanding of quantum algorithms in derivative pricing, addressing key challenges and open questions in the field.
A variational quantum algorithm for numerically solving partial differential equations (PDEs) on a quantum computer was proposed by Lubasch et al. [Phys. Rev. A 101, 010301(R) (2020)]. In this paper we generalize the method introduced by Lubasch et al. to cover a broader class of nonlinear PDEs as well as multidimensional PDEs and study the performance of the variational quantum algorithm on several example equations. Specifically, we show via numerical simulations that the algorithm can solve instances of the single-asset Black-Scholes equation with a nontrivial nonlinear volatility model, the double-asset Black-Scholes equation, the Buckmaster equation, and the deterministic Kardar-Parisi-Zhang equation. Our simulations use up to n=12n=12n=12 Ansatz qubits, computing PDE solutions with 2n{2}^{n}2n grid points. We also perform proof-of-concept demonstrations with a trapped-ion quantum processor from IonQ [Nat. Commun. 10, 5464 (2019)], showing accurate computation of two representative expectation values needed for the calculation of a single time step of the nonlinear Black-Scholes equation. Through our classical simulations and demonstrations on quantum hardware, we identify and discuss several open challenges for using quantum variational methods to solve PDEs in a regime with a large number (much greater than 220{2}^{20}220) of grid points, but also a practical number of gates per circuit and circuit shots.
Variational quantum Monte Carlo (VMC) combined with neural-network quantum states offers a novel angle of attack on the curse-of-dimensionality encountered in a particular class of partial differential equations (PDEs); namely, the real- and imaginary time-dependent Schrödinger equation. In this paper, we present a simple generalization of VMC applicable to arbitrary time-dependent PDEs, showcasing the technique in the multi-asset Black-Scholes PDE for pricing European options contingent on many correlated underlying assets.