pith. sign in

arxiv: 2209.08867 · v1 · pith:5WZOHRPNnew · submitted 2022-09-19 · 🪐 quant-ph

Quantum computational finance: martingale asset pricing for incomplete markets

classification 🪐 quant-ph
keywords marketquantumpricingmodelalgorithmderivativefinancialmartingale
0
0 comments X
read the original abstract

A derivative is a financial security whose value is a function of underlying traded assets and market outcomes. Pricing a financial derivative involves setting up a market model, finding a martingale (``fair game") probability measure for the model from the given asset prices, and using that probability measure to price the derivative. When the number of underlying assets and/or the number of market outcomes in the model is large, pricing can be computationally demanding. We show that a variety of quantum techniques can be applied to the pricing problem in finance, with a particular focus on incomplete markets. We discuss three different methods that are distinct from previous works: they do not use the quantum algorithms for Monte Carlo estimation and they extract the martingale measure from market variables akin to bootstrapping, a common practice among financial institutions. The first two methods are based on a formulation of the pricing problem into a linear program and are using respectively the quantum zero-sum game algorithm and the quantum simplex algorithm as subroutines. For the last algorithm, we formalize a new market assumption milder than market completeness for which quantum linear systems solvers can be applied with the associated potential for large speedups. As a prototype use case, we conduct numerical experiments in the framework of the Black-Scholes-Merton model.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Efficient Quantum State Preparation with Bucket Brigade QRAM

    quant-ph 2025-10 unverdicted novelty 6.0

    Encodes M by N matrix into quantum state using Θ(log(MN)) qubits in O(log²(MN)) time via segment tree embedded in bucket brigade QRAM with constant ancillas and O(MN) memory cells.

  2. Efficient Complex-Valued State Preparation on Bucket Brigade QRAM

    quant-ph 2026-04 unverdicted novelty 4.0

    Precomputes rotation angles classically and adds a magnitude-then-phase procedure to enable complex-valued state preparation on BBQRAM at unchanged O(log²(MN)) query cost with no reversible arithmetic on the QPU.