American options are important financial products traded in enormous volumes across the world. Therefore, accurate and efficient valuation is of paramount importance for global financial markets. Due to the early exercise feature, the pricing of American options is significantly more complicated than European options, and an analytical closed-form solution is unavailable even for simple dynamic models. Practitioners employ various valuation methods to strike the balance: accurate valuation usually suffers inefficiency, while fast valuation likely leads to inaccuracy. In this paper, we provide an innovative solution to address both the accuracy and efficiency issues of pricing American options by applying quantum reinforcement learning. Meanwhile, the quantum part of the new approach would potentially speed up the calculation dramatically.
American options are important financial products traded in enormous volumes across the world. Therefore, accurate and efficient valuation is of paramount importance for global financial markets. Due to the early exercise feature, the pricing of American options is significantly more complicated than European options, and an analytical closed-form solution is unavailable even for simple dynamic models. Practitioners employ various valuation methods to strike the balance: accurate valuation usually suffers inefficiency, while fast valuation likely leads to inaccuracy. In this paper, we provide an innovative solution to address both the accuracy and efficiency issues of pricing American options by applying quantum reinforcement learning. Meanwhile, the quantum part of the new approach would potentially speed up the calculation dramatically.
The valuation of American options and the determination of optimal stopping times remain central challenges in option pricing theory and derivatives valuation. Classical approaches to multidimensional problems rely on the dynamic programming principle, which is notoriously difficult to parallelize. Moreover, the need to store continuation values for all simulated paths in each dynamic programming step imposes severe memory constraints on classical computers, limiting the scale of feasible simulations. Quantum computing offers a promising way to address these limitations. In this paper, the authors introduce a novel algorithm for pricing American options on quantum hardware. To date, only one method has been proposed for this purpose. The authors' approach combines the Quantum Binomial Tree with Quantum Machine Learning to enable direct valuation of American options on a quantum computer. By incorporating quantum amplitude estimation, it could achieve a quadratic speed-up over classical Monte Carlo methods. Furthermore, it exploits the exponential growth of the quantum state vector, overcoming the memory bottlenecks that restrict classical approaches.
The accurate valuation of financial derivatives plays a pivotal role in the finance industry. Although closed formulas for pricing are available for certain models and option types, exemplified by the European Call and Put options in the Black-Scholes Model, the use of either more complex models or more sophisticated options precludes the existence of such formulas, thereby requiring alternative approaches. The Monte Carlo simulation, an alternative approach effective in nearly all scenarios, has already been challenged by quantum computing techniques that leverage Amplitude Estimation. Despite its theoretical promise, this approach currently faces limitations due to the constraints of hardware in the Noisy Intermediate-Scale Quantum (NISQ) era. In this study, we introduce and analyze a quantum algorithm for pricing European call options across a broad spectrum of asset models. This method transforms a classical approach, which utilizes the Fast Fourier Transform (FFT), into a quantum algorithm, leveraging the efficiency of the Quantum Fourier Transform (QFT). Furthermore, we compare this novel algorithm with existing quantum algorithms for option pricing.
Options are financial instruments whose payoffs are determined by the value of an underlying asset. These underlying assets are typically stocks, interest rates, or exchange rates, but can also include commodities such as energy or agricultural products. Options serve diverse purposes, including hedging against price volatility and speculating on market movements. Additionally, they play a critical role in assessing certain positions on the balance sheets of insurance companies, particularly in the context of solvency capital requirement calculations. As an option’s payoff lies in the future and is stochastic in nature, finding a fair price today is a non-trivial task. The focus of this work is finding quantum algorithms for calculating these prices and compare them to algorithms designed for classical computers. This work follows two different directions on how to improve on classical methods for option pricing. The first direction is improving on Monte-Carlo (MC) methods and the second one is adapting Fourier based pricing algorithms. The Amplitude Estimation (AE) algorithm promises a quadratic speedup compared to classical MC. This fact makes this algorithm an interesting candidate for improvements by quantum algorithms. It was shown in the literature, that simple options with very crude discretization of the underlying stochastic models, can be implemented on a quantum device and evaluated with AE. One big challenge is the efficient implementation of the option’s payoff profile. To solve this problem colleagues and I have introduced a multi-objective genetic algorithm to automatically find well performing and efficient circuits to implement the payoff of non-path-dependent European options on one or more underlyings. Another strategy for pricing options is based on the fact, that in many models the characteristic function of the underlying is numerically more tractable than its distribution function. There are methods that make use of this fact and the performance of the Fast Fourier Transform (FFT) to efficiently calculate prices for European call options for many strikes in one go. The quantum version of the FFT, the Quantum Fourier Transform (QFT), is in some sense, even faster than its classical counterpart. We have adapted the existing classical method to make use of QFT, to benefit from its performance. Finally, the different strategies are benchmarked and compared regarding their accuracy, their potential for scaling and their adaptability to different styles of derivatives and models. The result of this comparison are requirements on the quantum hardware for the methods to be viable as well as use cases where each method has its benefits over the others.
The ongoing progress in quantum technologies has fueled a sustained exploration of their potential applications across various domains. One particularly promising field is quantitative finance, where a central challenge is the pricing of financial derivatives-traditionally addressed through Monte Carlo integration techniques. In this work, we introduce two hybrid classical-quantum methods to address the option pricing problem. These approaches rely on reconstructing Fourier series representations of statistical distributions from the outputs of Quantum Machine Learning (QML) models based on Parametrized Quantum Circuits (PQCs). We analyze the impact of data size and PQC dimensionality on performance. Quantum Accelerated Monte Carlo (QAMC) is employed as a benchmark to quantitatively assess the proposed models in terms of computational cost and accuracy in the extraction of Fourier coefficients. Through the numerical experiments, we show that the proposed methods achieve remarkable accuracy, becoming a competitive quantum alternative for derivatives valuation.
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.
In a global derivatives market with notional values in the hundreds of trillions of dollars, the accuracy and efficiency of pricing models are of fundamental importance, with direct implications for risk management, capital allocation, and regulatory compliance. In this work, we employ the Black-Scholes-Merton (BSM) framework not as an end in itself, but as a controlled benchmark environment in which to rigorously assess the capabilities of quantum machine learning methods.
We propose a fully quantum approach to option pricing based on Quantum Neural Networks (QNNs), and, to the best of our knowledge, present one of the first implementations of such a methodology on currently available quantum hardware. Specifically, we investigate whether QNNs, by exploiting the geometric structure of Hilbert space, can effectively approximate option pricing functions.
Our implementation utilizes a compact 2-qubit QNN architecture evaluated across multiple state-of-the-art quantum processors, including IBM Fez, IQM Garnet, IonQ Forte, and Rigetti Ankaa-3. This cross-platform study reveals distinct hardware-dependent performance characteristics while demonstrating that accurate pricing approximations can be achieved consistently across different devices despite the constraints of Noisy Intermediate-Scale Quantum (NISQ) hardware.
The results provide empirical evidence that QNN-based approaches constitute a viable framework for derivative pricing. While the analysis is conducted within the BSM setting, the broader significance lies in the potential extension of these methods to more realistic and computationally demanding models, including local volatility, stochastic volatility, and interest rate frameworks commonly used in practice.