Pith. sign in

REVIEW 4 cited by

Option Pricing using Quantum Computers

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 1905.02666 v5 pith:WS7WEVFO submitted 2019-05-07 quant-ph

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

We present a methodology to price options and portfolios of options on a gate-based quantum computer using amplitude estimation, an algorithm which provides a quadratic speedup compared to classical Monte Carlo methods. The options that we cover include vanilla options, multi-asset options and path-dependent options such as barrier options. We put an emphasis on the implementation of the quantum circuits required to build the input states and operators needed by amplitude estimation to price the different option types. Additionally, we show simulation results to highlight how the circuits that we implement price the different option contracts. Finally, we examine the performance of option pricing circuits on quantum hardware using the IBM Q Tokyo quantum device. We employ a simple, yet effective, error mitigation scheme that allows us to significantly reduce the errors arising from noisy two-qubit gates.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

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

  1. On the encoding complexity of quantum numerical integration: an angle-structure characterization

    quant-ph 2026-04 unverdicted novelty 7.0 of 10

    Low-degree multilinear angle maps enable O(ε^{-1} log(1/ε)) quantum gate complexity for numerical integration on [0,1], with unconditional separations from classical quadrature for certain low-regularity functions.

  2. On the encoding complexity of quantum numerical integration: an angle-structure characterization

    quant-ph 2026-04 reject novelty 6.0 of 10

    The encoding cost of quantum numerical integration is controlled by the multilinear degree of the amplitude angle map, yielding an O(ε⁻¹ log(1/ε)) gate count for affine encodings.

  3. Quantum Derivative Pricing for SPDEs via BDSDE Representation

    quant-ph 2026-06 unverdicted novelty 5.0 of 10

    Quantum-accelerated MLMC methods for BDSDE-based SPDE derivative pricing and Greeks achieve sampling complexity improvement from O(ε^{-2}) to O(ε^{-1}).

  4. Credit Risk Analysis using Quantum Computers

    quant-ph 2019-07 unverdicted novelty 5.0 of 10

    Quantum amplitude estimation algorithm for credit risk economic capital with qubit and runtime estimates on assumed future hardware.

Pith tools