Towards Quantum Advantage in Financial Market Risk using Quantum Gradient Algorithms

• URL: http://arxiv.org/abs/2111.12509v2
• Date: Mon, 18 Jul 2022 16:33:43 GMT
• Title: Towards Quantum Advantage in Financial Market Risk using Quantum Gradient Algorithms
• Authors: Nikitas Stamatopoulos, Guglielmo Mazzola, Stefan Woerner and William J. Zeng
• Abstract summary: We introduce a quantum algorithm to compute the market risk of financial derivatives. We show that employing quantum gradient estimation algorithms can deliver a further quadratic advantage in the number of the associated market sensitivities.
• Score: 0.716879432974126
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce a quantum algorithm to compute the market risk of financial derivatives. Previous work has shown that quantum amplitude estimation can accelerate derivative pricing quadratically in the target error and we extend this to a quadratic error scaling advantage in market risk computation. We show that employing quantum gradient estimation algorithms can deliver a further quadratic advantage in the number of the associated market sensitivities, usually called greeks. By numerically simulating the quantum gradient estimation algorithms on financial derivatives of practical interest, we demonstrate that not only can we successfully estimate the greeks in the examples studied, but that the resource requirements can be significantly lower in practice than what is expected by theoretical complexity bounds. This additional advantage in the computation of financial market risk lowers the estimated logical clock rate required for financial quantum advantage from Chakrabarti et al. [Quantum 5, 463 (2021)] by a factor of ~7, from 50MHz to 7MHz, even for a modest number of greeks by industry standards (four). Moreover, we show that if we have access to enough resources, the quantum algorithm can be parallelized across 60 QPUs, in which case the logical clock rate of each device required to achieve the same overall runtime as the serial execution would be ~100kHz. Throughout this work, we summarize and compare several different combinations of quantum and classical approaches that could be used for computing the market risk of financial derivatives.

Related papers

• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Quantum Risk Analysis of Financial Derivatives [0.3749861135832073]
  We introduce two quantum algorithms to compute the Value at Risk (VaR) and Conditional Value at Risk (CVaR) of financial derivatives using quantum computers.
  arXiv  Detail & Related papers  (2024-04-15T18:52:30Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• Quantum Computational Algorithms for Derivative Pricing and Credit Risk in a Regime Switching Economy [0.0]
  We introduce a class of processes that are both realistic in terms of mimicking financial market risks as well as more amenable to potential quantum computational advantages. We study algorithms to estimate credit risk and option pricing on a gate-based quantum computer.
  arXiv  Detail & Related papers  (2023-11-01T20:15:59Z)
• Derivative Pricing using Quantum Signal Processing [0.0]
  We introduce a method based on Quantum Signal Processing to encode financial derivative payoffs directly into quantum amplitudes. We find that for derivative contracts of practical interest, the application of QSP significantly reduces the required resources.
  arXiv  Detail & Related papers  (2023-07-26T17:21:38Z)
• Towards practical Quantum Credit Risk Analysis [0.5735035463793008]
  CRA (Credit Risk Analysis) quantum algorithm with a quadratic speedup has been introduced. We propose a new variant of this quantum algorithm with the intent of overcoming some of the most significant limitations.
  arXiv  Detail & Related papers  (2022-12-14T09:25:30Z)
• Quantum computational finance: martingale asset pricing for incomplete markets [69.73491758935712]
  We show that a variety of quantum techniques can be applied to the pricing problem in finance. We discuss three different methods that are distinct from previous works.
  arXiv  Detail & Related papers  (2022-09-19T09:22:01Z)
• Pricing multi-asset derivatives by variational quantum algorithms [0.6181093777643575]
  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.
  arXiv  Detail & Related papers  (2022-07-04T09:11:15Z)
• Reducing the cost of energy estimation in the variational quantum eigensolver algorithm with robust amplitude estimation [50.591267188664666]
  Quantum chemistry and materials is one of the most promising applications of quantum computing. Much work is still to be done in matching industry-relevant problems in these areas with quantum algorithms that can solve them.
  arXiv  Detail & Related papers  (2022-03-14T16:51:36Z)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)
• Statistical Limits of Supervised Quantum Learning [90.0289160657379]
  We show that if the bound on the accuracy is taken into account, quantum machine learning algorithms for supervised learning cannot achieve polylogarithmic runtimes in the input dimension. We conclude that, when no further assumptions on the problem are made, quantum machine learning algorithms for supervised learning can have at most speedups over efficient classical algorithms.
  arXiv  Detail & Related papers  (2020-01-28T17:35:32Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.