An introduction to financial option pricing on a qudit-based quantum computer

• URL: http://arxiv.org/abs/2311.05537v1
• Date: Thu, 9 Nov 2023 17:31:11 GMT
• Title: An introduction to financial option pricing on a qudit-based quantum computer
• Authors: Nicholas Bornman
• Abstract summary: The financial sector is anticipated to be one of the first industries to benefit from the increased computational power of quantum computers. Financial mathematics, and derivative pricing, are not areas quantum physicists are traditionally trained in.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The financial sector is anticipated to be one of the first industries to benefit from the increased computational power of quantum computers, in areas such as portfolio optimisation and risk management to financial derivative pricing. Financial mathematics, and derivative pricing in particular, are not areas quantum physicists are traditionally trained in despite the fact that they often have the raw technical skills needed to understand such topics. On the other hand, most quantum algorithms have largely focused on qubits, which are comprised of two discrete states, as the information carriers. However, discrete higher-dimensional qudits, in addition to possibly possessing increased noise robustness and allowing for novel error correction protocols in certain hardware implementations, also have logarithmically greater information storage and processing capacity. In the current NISQ era of quantum computing, a wide array of hardware paradigms are still being studied and any potential advantage a platform offers is worth exploring. Here we introduce the basic concepts behind financial derivatives for the unfamiliar enthusiast as well as outline in great detail the quantum algorithm routines needed to price a European option, the simplest derivative. This is done within the context of a quantum computer comprised of qudits and employing the natural higher-dimensional analogue of a qubit-based pricing algorithm with its various subroutines. From these pieces, one should relatively easily be able to tailor the scheme to more complex, realistic financial derivatives. Finally, the entire stack is numerically simulated with the results demonstrating how the qudit-based scheme's payoff quickly approaches that of both a similarly-resourced classical computer as well as the true payoff, within error, for a modest increase in qudit dimension.

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)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• 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)
• 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)
• A Survey of Quantum Computing for Finance [15.341098545888944]
  Finance is estimated to be the first industry sector to benefit from quantum computing. Quantum computers are expected to surpass the computational capabilities of classical computers during this decade.
  arXiv  Detail & Related papers  (2022-01-08T06:16:21Z)
• Quantum Machine Learning for Finance [52.97198108304122]
  Finance is estimated to be the first industry sector to benefit from Quantum Computing. This review paper presents the state of the art of quantum algorithms for financial applications.
  arXiv  Detail & Related papers  (2021-09-09T14:20:10Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Prospects and challenges of quantum finance [5.545791216381869]
  We consider quantum speedups for Monte Carlo methods, portfolio optimization, and machine learning. The near-term relevance of these quantum finance algorithms varies widely across applications. We describe powerful ways to bring these speedups closer to experimental feasibility.
  arXiv  Detail & Related papers  (2020-11-12T17:02:11Z)
• Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
  We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
  arXiv  Detail & Related papers  (2020-09-28T17:21:25Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)

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.