Pith. sign in

REVIEW 3 cited by

Quantum option pricing via the Karhunen-Lo\`{e}ve expansion

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.10132 v1 pith:HWKF73NF submitted 2024-02-15 quant-ph

Quantum option pricing via the Karhunen-Lo\`{e}ve expansion

classification quant-ph
keywords epsilonquantumalgorithmsassetpricingunderlyingbrowniancomplexity
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We consider the problem of pricing discretely monitored Asian options over $T$ monitoring points where the underlying asset is modeled by a geometric Brownian motion. We provide two quantum algorithms with complexity poly-logarithmic in $T$ and polynomial in $1/\epsilon$, where $\epsilon$ is the additive approximation error. Our algorithms are obtained respectively by using an $O(\log T)$-qubit semi-digital quantum encoding of the Brownian motion that allows for exponentiation of the stochastic process and by analyzing classical Monte Carlo algorithms inspired by the semi-digital encodings. The best quantum algorithm obtained using this approach has complexity $\widetilde{O}(1/\epsilon^{3})$ where the $\widetilde{O}$ suppresses factors poly-logarithmic in $T$ and $1/\epsilon$. The methods proposed in this work generalize to pricing options where the underlying asset price is modeled by a smooth function of a sub-Gaussian process and the payoff is dependent on the weighted time-average of the underlying asset price.

discussion (0)

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

Forward citations

Cited by 3 Pith papers

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

  1. Quantum analog-encoding for correlated Gaussian vectors and their exponentiation with application to rough volatility

    quant-ph 2026-04 unverdicted novelty 7.0

    Quantum algorithms prepare states for normalized correlated Gaussians and their exponentials with gate complexities scaling as Õ(‖Σ‖_F/λ_max ⋅ κ^1.5), achieving subcubic scaling in N for fractional processes and enab...

  2. Quantum analog-encoding for correlated Gaussian vectors and their exponentiation with application to rough volatility

    quant-ph 2026-04 conditional novelty 7.0

    Quantum algorithms are constructed for exact analog encoding of correlated Gaussian vectors and their exponentiation, achieving subcubic gate-depth complexity under polylogarithmic data-loading assumptions, with end-t...

  3. Exponentially Fast Solution State Preparation for the Heat Equation and its use for Option Pricing

    quant-ph 2026-05 unverdicted novelty 5.0

    Quantum algorithms for fast heat equation state preparation with claimed qubit savings for option pricing.