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

D5.4 Evaluation of quantum algorithms for pricing and computation of VaR

Gonzalo A. Casanova Ferro, Alberto Manzano, Andrés Gómez, Álvaro Leitao, María R. Nogueiras, Carlos Vázquez

Published Sep 30, 2022• 0 citations
Publisher

Abstract

NEASQC Use Case 5 (UC5) works on the development and evaluation of quantum algorithms for financial applications. More specifically, the main line of research in UC5 focuses on Pricing and Value at Risk (VaR) problems. These two problems are computationally demanding tasks that are classically solved using Monte Carlo (MC) techniques. As Quantum Accelerated Monte Carlo (QAMC) techniques promise a quadratic speedup over Classical Monte Carlo (CMC) this roughly motivates why and how this field could benefit from the recent advances in Quantum Computing. This report summarises the development of a new pricing algorithm as well as its experimental assessment. In the first part of the report there is a brief summary of the classical and quantum techniques used to tackle both financial challenges. In the second part of the report the new method is explained in detail and evaluated. This new method includes two well defined parts: a new encoding for the quantum oracle and a new Amplitude Estimation (AE) technique. The new proposals are not yet applicable to current NISQ architectures although they represent a clear advance because: The new encoding algorithm allows pricing derivative products with negative payoffs. In particular, as illustrated in Section 3.1, it works in cases where other proposals fail as it is the case for a payoff of the form V (x) = x−K. The new AE algorithm, the so-called Real Quantum Amplitude Estimation (RQAE), allows pricing financial products with negative values (see Figure 9), which is an absolute novelty in the area. Current AE algorithms in the literature are concerned with the efficient estimation of the probability of finding a particular state, but they are not designed to be sensitive to the phases present in the underlying amplitudes. In contrast, RQAE is specifically tailored to be sensible to the sign of the amplitude. RQAE achieves a similar performance when compared with other previous well-known AE algorithms. In fact, in reference (Manzano et al., 2022), tighter bounds on the convergence of RQAE than any of the existing methods in the literature are proved. In this work, the experimental results show that although the performance is not the best one, it is on par with the cutting edge methods. However, there are some less positive results as: The new encoding algorithm gives a worse performance compared to the standard encoding algorithm. It depends on a factor (Npaths) that can overshadow or even kill the speedup depending on its specific setup. Nevertheless, NEASQC researchers who participate in the Use Case are actively working in new encoding methods to solve this issue. Two identified challenges have to be addressed in the near future. On the one hand, how to improve these algorithms to execute on current Quantum Processing Units (QPU), where deep circuits such as those required by the AE routines are not feasible without error correction techniques. On the other hand, previous works such as (Montanaro, 2015; Rebentrost et al., 2018) implicitly assume that the simulation of the Stochastic Differential Equation (SDE) to solve for these financial calculations can be directly done by translating the classical circuits into quantum circuits. However, this direct translation would require in practice a number of qubits too far from the current possibilities of the NISQ era.

DOI
10.5281/zenodo.7149255

Related papers

Quantum Computing in Option Pricing

Ewen, Tom

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.

•Jan 1, 2025•0 citations

Quantum pricing with a smile: implementation of local volatility model on quantum computer

Kazuya Kaneko, Koichi Miyamoto, Naoyuki Takeda +1 more

Abstract Quantum algorithms for the pricing of financial derivatives have been discussed in recent papers. However, the pricing model discussed in those papers is too simple for practical purposes. It motivates us to consider how to implement more complex models used in financial institutions. In this paper, we consider the local volatility (LV) model, in which the volatility of the underlying asset price depends on the price and time. As in previous studies, we use the quantum amplitude estimation (QAE) as the main source of quantum speedup and discuss the state preparation step of the QAE, or equivalently, the implementation of the asset price evolution. We compare two types of state preparation: One is the amplitude encoding (AE) type, where the probability distribution of the derivative’s payoff is encoded to the probabilistic amplitude. The other is the pseudo-random number (PRN) type, where sequences of PRNs are used to simulate the asset price evolution as in classical Monte Carlo simulation. We present detailed circuit diagrams for implementing these preparation methods in fault-tolerant quantum computation and roughly estimate required resources such as the number of qubits and T-count.

arXiv:2007.01467•EPJ Quantum Technology•Feb 12, 2022•36 citations

Call Option Pricing Using Quantum Amplitude Estimation: A Comparative Study with Monte Carlo Simulation

Kasidit Asavakittikawin, Somporn Punpocha

Option pricing is a fundamental problem in quantitative finance, where the accuracy and efficiency of valuation methods directly affect investment and risk management decisions. While the Black-Scholes model provides a closed-form solution for European options, numerical approaches such as Monte Carlo simulation are widely used when analytical methods are intractable. However, Monte Carlo suffers from slow convergence with complexity O(1/ε2).Quantum Amplitude Estimation (QAE), an algorithm in quantum computing, promises a quadratic speedup with complexity O(1/ε). This paper implements QAE, specifically Iterative Amplitude Estimation (IAE), for European call option pricing and compares its performance against Monte Carlo simulation and the Black-Scholes model. Experiments are conducted on both Qiskit simulators and IBM Quantum hardware (ibm_brisbane).Results show that QAE achieves estimates close to Monte Carlo and analytical benchmarks, with mean payoff deviations of less than 0.01. While QAE produces wider confidence intervals due to noise and discretization, the findings demonstrate its potential scalability advantage for future quantum finance applications.

International Computer Science and Engineering Conference•Nov 2, 2025•0 citations

Real Option Pricing using Quantum Computers

Manzano, Alberto, Gonzalo A. Casanova Ferro, Álvaro Leitao +2 more

In this work we present an alternative methodology to the standard Quantum Accelerated Monte Carlo (QAMC) applied to derivatives pricing. Our pipeline benefits from the combination of a new encoding protocol, referred to as the direct encoding, and a amplitude estimation algorithm, the modified Real Quantum Amplitude Estimation (mRQAE) algorithm. On the one hand, the direct encoding prepares a quantum state which contains the information about the sign of the expected payoff. On the other hand, the mRQAE is able to read all the information contained in the quantum state. Although the procedure we describe is different from the standard one, the main building blocks are almost the same. Thus, all the extensive research that has been performed is still applicable. Moreover, we experimentally compare the performance of the proposed methodology against the standard QAMC employing a quantum emulator and show that we retain the speedups.

arXiv:2303.06089•Mar 10, 2023•0 citations

Quantum Monte Carlo simulations for financial risk analytics: scenario generation for equity, rate, and credit risk factors

Titos Matsakos, Stuart Nield

Monte Carlo (MC) simulations are widely used in financial risk management, from estimating value-at-risk (VaR) to pricing over-the-counter derivatives. However, they come at a significant computational cost due to the number of scenarios required for convergence. If a probability distribution is available, Quantum Amplitude Estimation (QAE) algorithms can provide a quadratic speed-up in measuring its properties as compared to their classical counterparts. Recent studies have explored the calculation of common risk measures and the optimisation of QAE algorithms by initialising the input quantum states with pre-computed probability distributions. If such distributions are not available in closed form, however, they need to be generated numerically, and the associated computational cost may limit the quantum advantage. In this paper, we bypass this challenge by incorporating scenario generation – i.e. simulation of the risk factor evolution over time to generate probability distributions – into the quantum computation; we refer to this process as Quantum MC (QMC) simulations. Specifically, we assemble quantum circuits that implement stochastic models for equity (geometric Brownian motion), interest rate (mean-reversion models), and credit (structural, reduced-form, and rating migration credit models) risk factors. We then integrate these models with QAE to provide end-to-end examples for both market and credit risk use cases.

arXiv:2303.09682•Quantum•Apr 4, 2024•22 citations

Alternative pipeline for option pricing using quantum computers

Alberto Manzano, Gonzalo A. Casanova Ferro, Álvaro Leitao +2 more

Abstract In this work we present an alternative methodology to the standard Quantum Accelerated Monte Carlo (QAMC) applied to derivatives pricing. Our pipeline benefits from the combination of a new encoding protocol, referred to as the direct encoding, and an amplitude estimation algorithm, the modified Real Quantum Amplitude Estimation (mRQAE) algorithm. On the one hand, the direct encoding prepares a quantum state which contains the information about the sign of the expected payoff. On the other hand, the mRQAE is able to read all the information contained in the quantum state. Although the procedure we describe is different from the standard one, the main building blocks are almost the same. Thus, all the extensive research that has been performed is still applicable. Moreover, we experimentally compare the performance of the proposed methodology against the standard QAMC employing a quantum emulator and show that we retain the speedups.

EPJ Quantum Technology•Feb 25, 2025•0 citations
NEASQC Use Case 5 (UC5) works on the development and evaluation of quantum algorithms for financial applications. More specifically, the main line of research in UC5 focuses on Pricing and Value at Risk (VaR) problems. These two problems are computationally demanding tasks that are classically solved using Monte Carlo (MC) techniques. As Quantum Accelerated Monte Carlo (QAMC) techniques promise a quadratic speedup over Classical Monte Carlo (CMC) this roughly motivates why and how this field could benefit from the recent advances in Quantum Computing. This report summarises the development of a new pricing algorithm as well as its experimental assessment. In the first part of the report there is a brief summary of the classical and quantum techniques used to tackle both financial challenges. In the second part of the report the new method is explained in detail and evaluated. This new method includes two well defined parts: a new encoding for the quantum oracle and a new Amplitude Estimation (AE) technique. The new proposals are not yet applicable to current NISQ architectures although they represent a clear advance because: The new encoding algorithm allows pricing derivative products with negative payoffs. In particular, as illustrated in Section 3.1, it works in cases where other proposals fail as it is the case for a payoff of the form V (x) = x−K. The new AE algorithm, the so-called Real Quantum Amplitude Estimation (RQAE), allows pricing financial products with negative values (see Figure 9), which is an absolute novelty in the area. Current AE algorithms in the literature are concerned with the efficient estimation of the probability of finding a particular state, but they are not designed to be sensitive to the phases present in the underlying amplitudes. In contrast, RQAE is specifically tailored to be sensible to the sign of the amplitude. RQAE achieves a similar performance when compared with other previous well-known AE algorithms. In fact, in reference (Manzano et al., 2022), tighter bounds on the convergence of RQAE than any of the existing methods in the literature are proved. In this work, the experimental results show that although the performance is not the best one, it is on par with the cutting edge methods. However, there are some less positive results as: The new encoding algorithm gives a worse performance compared to the standard encoding algorithm. It depends on a factor (Npaths) that can overshadow or even kill the speedup depending on its specific setup. Nevertheless, NEASQC researchers who participate in the Use Case are actively working in new encoding methods to solve this issue. Two identified challenges have to be addressed in the near future. On the one hand, how to improve these algorithms to execute on current Quantum Processing Units (QPU), where deep circuits such as those required by the AE routines are not feasible without error correction techniques. On the other hand, previous works such as (Montanaro, 2015; Rebentrost et al., 2018) implicitly assume that the simulation of the Stochastic Differential Equation (SDE) to solve for these financial calculations can be directly done by translating the classical circuits into quantum circuits. However, this direct translation would require in practice a number of qubits too far from the current possibilities of the NISQ era.
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.
Abstract Quantum algorithms for the pricing of financial derivatives have been discussed in recent papers. However, the pricing model discussed in those papers is too simple for practical purposes. It motivates us to consider how to implement more complex models used in financial institutions. In this paper, we consider the local volatility (LV) model, in which the volatility of the underlying asset price depends on the price and time. As in previous studies, we use the quantum amplitude estimation (QAE) as the main source of quantum speedup and discuss the state preparation step of the QAE, or equivalently, the implementation of the asset price evolution. We compare two types of state preparation: One is the amplitude encoding (AE) type, where the probability distribution of the derivative’s payoff is encoded to the probabilistic amplitude. The other is the pseudo-random number (PRN) type, where sequences of PRNs are used to simulate the asset price evolution as in classical Monte Carlo simulation. We present detailed circuit diagrams for implementing these preparation methods in fault-tolerant quantum computation and roughly estimate required resources such as the number of qubits and T-count.
Option pricing is a fundamental problem in quantitative finance, where the accuracy and efficiency of valuation methods directly affect investment and risk management decisions. While the Black-Scholes model provides a closed-form solution for European options, numerical approaches such as Monte Carlo simulation are widely used when analytical methods are intractable. However, Monte Carlo suffers from slow convergence with complexity O(1/ε2).Quantum Amplitude Estimation (QAE), an algorithm in quantum computing, promises a quadratic speedup with complexity O(1/ε). This paper implements QAE, specifically Iterative Amplitude Estimation (IAE), for European call option pricing and compares its performance against Monte Carlo simulation and the Black-Scholes model. Experiments are conducted on both Qiskit simulators and IBM Quantum hardware (ibm_brisbane).Results show that QAE achieves estimates close to Monte Carlo and analytical benchmarks, with mean payoff deviations of less than 0.01. While QAE produces wider confidence intervals due to noise and discretization, the findings demonstrate its potential scalability advantage for future quantum finance applications.
In this work we present an alternative methodology to the standard Quantum Accelerated Monte Carlo (QAMC) applied to derivatives pricing. Our pipeline benefits from the combination of a new encoding protocol, referred to as the direct encoding, and a amplitude estimation algorithm, the modified Real Quantum Amplitude Estimation (mRQAE) algorithm. On the one hand, the direct encoding prepares a quantum state which contains the information about the sign of the expected payoff. On the other hand, the mRQAE is able to read all the information contained in the quantum state. Although the procedure we describe is different from the standard one, the main building blocks are almost the same. Thus, all the extensive research that has been performed is still applicable. Moreover, we experimentally compare the performance of the proposed methodology against the standard QAMC employing a quantum emulator and show that we retain the speedups.
Monte Carlo (MC) simulations are widely used in financial risk management, from estimating value-at-risk (VaR) to pricing over-the-counter derivatives. However, they come at a significant computational cost due to the number of scenarios required for convergence. If a probability distribution is available, Quantum Amplitude Estimation (QAE) algorithms can provide a quadratic speed-up in measuring its properties as compared to their classical counterparts. Recent studies have explored the calculation of common risk measures and the optimisation of QAE algorithms by initialising the input quantum states with pre-computed probability distributions. If such distributions are not available in closed form, however, they need to be generated numerically, and the associated computational cost may limit the quantum advantage. In this paper, we bypass this challenge by incorporating scenario generation – i.e. simulation of the risk factor evolution over time to generate probability distributions – into the quantum computation; we refer to this process as Quantum MC (QMC) simulations. Specifically, we assemble quantum circuits that implement stochastic models for equity (geometric Brownian motion), interest rate (mean-reversion models), and credit (structural, reduced-form, and rating migration credit models) risk factors. We then integrate these models with QAE to provide end-to-end examples for both market and credit risk use cases.
Abstract In this work we present an alternative methodology to the standard Quantum Accelerated Monte Carlo (QAMC) applied to derivatives pricing. Our pipeline benefits from the combination of a new encoding protocol, referred to as the direct encoding, and an amplitude estimation algorithm, the modified Real Quantum Amplitude Estimation (mRQAE) algorithm. On the one hand, the direct encoding prepares a quantum state which contains the information about the sign of the expected payoff. On the other hand, the mRQAE is able to read all the information contained in the quantum state. Although the procedure we describe is different from the standard one, the main building blocks are almost the same. Thus, all the extensive research that has been performed is still applicable. Moreover, we experimentally compare the performance of the proposed methodology against the standard QAMC employing a quantum emulator and show that we retain the speedups.