Paper: arXiv 2404.10088

Authors: Nikitas Stamatopoulos, B. David Clader, Stefan Woerner, William J. Zeng

Abstract

We introduce two quantum algorithms to compute the Value at Risk (VaR) and Conditional Value at Risk (CVaR) of financial derivatives using quantum computers: the first by applying existing ideas from quantum risk analysis to derivative pricing, and the second based on a novel approach using Quantum Signal Processing (QSP). Previous work in the literature has shown that quantum advantage is possible in the context of individual derivative pricing and that advantage can be leveraged in a straightforward manner in the estimation of the VaR and CVaR. The algorithms we introduce in this work aim to provide an additional advantage by encoding the derivative price over multiple market scenarios in superposition and computing the desired values by applying appropriate transformations to the quantum system. We perform complexity and error analysis of both algorithms, and show that while the two algorithms have the same asymptotic scaling the QSP-based approach requires significantly fewer quantum resources for the same target accuracy. Additionally, by numerically simulating both quantum and classical VaR algorithms, we demonstrate that the quantum algorithm can extract additional advantage from a quantum computer compared to individual derivative pricing. Specifically, we show that under certain conditions VaR estimation can lower the latest published estimates of the logical clock rate required for quantum advantage in derivative pricing by up to \(\sim 30\)x. In light of these results, we are encouraged that our formulation of derivative pricing in the QSP framework may be further leveraged for quantum advantage in other relevant financial applications, and that quantum computers could be harnessed more efficiently by considering problems in the financial sector at a higher level.

Complexity vs Empirical Score

  • Math Complexity: 7.5/10
  • Empirical Rigor: 4.0/10
  • Quadrant: Lab Rats — high math complexity, limited empirical testing

Why this score: The paper introduces advanced quantum algorithms (QAE, QSP) with significant mathematical derivations, including complexity analysis and error bounds. However, the empirical evidence is based on numerical simulations rather than real backtests or datasets, with a focus on theoretical resource estimates rather than implementation-heavy validation.

Research Flowchart

  flowchart TD
  A["Research Goal: <br>Estimate VaR/CVaR for Derivatives<br>using Quantum Advantage"] --> B["Method 1: Existing Quantum Risk Analysis<br>Applied to Derivatives"]
  A --> C["Method 2: Novel Approach<br>using Quantum Signal Processing QSP"]
  
  B & C --> D["Computational Process:<br>Encoding Prices & Market Scenarios<br>in Quantum Superposition"]
  
  D --> E["Data Inputs:<br>Derivative Pricing Models &<br>Market Scenario Simulations"]
  
  E --> F["Complexity &<br>Error Analysis"]
  
  F --> G["Key Outcomes: <br>1. QSP requires significantly fewer resources<br>2. 30x lower logical clock rate for advantage<br>3. Formulation extends to other financial apps"]

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 two quantum algorithms to compute Value at Risk (VaR) and Conditional Value at Risk (CVaR) of financial derivatives, one based on existing quantum risk analysis ideas and a second using Quantum Signal Processing (QSP).

Source sentence
We introduce two quantum algorithms to compute the Value at Risk (VaR) and Conditional Value at Risk (CVaR) of financial derivatives using quantum computers: the first by applying existing ideas from quantum risk analysis to derivative pricing, and the second based on a novel approach using Quantum Signal Processing (QSP).

Assumes 6

  • Scenarios are encoded as computational basis states representing tweaks to market data parameters. data
    Source sentence
    In order to compute the VaR of financial derivatives in the way described in Sec. II, we construct scenarios consisting of tweaks to (classical) market data parameters which can be encoded in some appropriate way as a computational 4 basis state |s⟩. For example, a scenario which simultaneously tweaks d underlying parameters (also called risk factors), can be encoded as |s⟩= |t1t2, . . . td⟩, (7) where ti is a
  • Each portfolio value V(s_i) can be exactly represented using m qubits. model
    Source sentence
    (10) Let us for now assume that each value V (si) can be exactly represented using m qubits.
  • Scenario prices are drawn from a normal distribution for the autocallable derivative product. market
    Source sentence
    We calculate the resources required by the QSP-based VaR algorithm to estimate the VaR of the product to the same accuracy as a classical Monte Carlo method, assuming that the product is evaluated under scenarios such that the resulting prices are distributed normally. We use the latest available resource estimates from Ref. [19], whereby an autocallable derivative product can be priced to within ϵp = 2 × 10−3 in
  • The QSP-based algorithm approximates the threshold function with a polynomial of degree d, introducing an approximation error ϵ_A. model
    Source sentence
    On the other hand, because in this case we use QSP to approximate the threshold function of Eq. (22), we do not implement exactly the threshold function θµ(x) but rather an approximation, which we denote as θ′ µ(x). In this case, we pick a value for the polynomial degree d and for each value of µ during bisection search we generate a d-degree polynomial approximation to the threshold function θµ(x) using the method
Show 2 more
  • Classical VaR estimation scales as O(N/ε_p^2) when pricing each scenario separately. statistical
    Source sentence
    When the value of the derivative portfolio is computed classically using Monte Carlo to accuracy ϵp, the VaR computation requires separate Monte Carlo pricings for each scenario, and therefore the complexity of the algorithm scales as O �N/ϵ2 p  .
  • Scenario preparation superposition can be loaded efficiently, though the method is left as an open question. execution
    Source sentence
    In this work, we have left the scenario preparation as an open question and instead, through numerical simulations, we estimate upper bounds on the resources required to prepare the necessary superposition in order for quantum advantage to exist.

Data

  • Autocallable derivative product · Ref. [6] synthetic unknown
    Source sentence
    As a benchmark to examine the conditions for practical quantum advantage, we consider the autocallable derivative product studied in Ref. [6]. We calculate the resources required by the QSP-based VaR algorithm to estimate the VaR of the product to the same accuracy as a classical Monte Carlo method, assuming that the product is evaluated under scenarios such that the resulting prices are distributed normally.

Costs

Not applicable The paper reports no trading or execution result.

Finds 5

  • Both quantum algorithms have the same asymptotic scaling, but the QSP-based approach requires significantly fewer quantum resources for the same target accuracy. theoretical
    Source sentence
    We perform complexity and error analysis of both algorithms, and show that while the two algorithms have the same asymptotic scaling the QSP-based approach requires significantly fewer quantum resources for the same target accuracy.
  • The quantum algorithm can reduce the logical clock rate required for quantum advantage in derivative pricing by approximately 30× in certain settings. performance
    Source sentence
    Specifically, we show that under certain conditions VaR estimation can lower the latest published estimates of the logical clock rate required for quantum advantage in derivative pricing by up to $\sim 30$x. We find that in certain settings, the quantum algorithm can provide a reduction in the logical clock rate required for quantum advantage estimated in Ref. [19] by ∼30x.
  • Simulation results show that the QSP method achieves comparable VaR estimation accuracy with fewer oracle call invocations than the QAE method. performance
    Source sentence
    The results from the simulation for both QAE and QSP methods for different values of oracle call invocations and the final amplitude estimation accuracy ϵA are shown in Fig. 6.
  • Numerical simulations demonstrate that quantum VaR estimation can extract additional advantage compared to individual derivative pricing. theoretical
    Source sentence
    Additionally, by numerically simulating both quantum and classical VaR algorithms, we demonstrate that the quantum algorithm can extract additional advantage from a quantum computer compared to individual derivative pricing.
  • The QSP algorithm can approximate the threshold function using a polynomial of degree d, enabling efficient bisection search for VaR estimation. theoretical
    Source sentence
    In this case, we pick a value for the polynomial degree d and for each value of µ during bisection search we generate a d-degree polynomial approximation to the threshold function θµ(x) using the method described in Sec. IV D and apply the resulting function to the sampled scenario prices.

Checked by others

No other paper in the archive has been found to support or contradict these findings (compared with 34 related papers). Coverage is partial, so this is neither replication nor refutation.

Cited by 1 paper in the archive (1 by independent authors): Implementing Credit Risk Analysis with Quantum Singular … (uses its method or data)

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.