Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2611.04431

Reducing the arithmetic cost of quantum derivative pricing with language-model circuit design

Monit Sharma, Hoong Chun Lau

quant-phSubmitted Nov 3, 2026• Announced Nov 4, 2026• 0 citations
arXivHTMLPDF

Abstract

Quantum amplitude estimation can estimate expected discounted payoffs with quadratically fewer oracle calls than Monte Carlo, but each call requires coherent computation. We use language-model-assisted circuit design to reduce reversible payoff arithmetic for a three-asset worst-of autocallable and a target accrual redemption forward (TARF). The constructions retain compact integer representations of market paths alongside contract history, reconstructing quantities temporarily for contract decisions and payoff-angle evaluation. Relative to matched internal references, the factor-sum autocallable and windowed TARF circuits reduce the product of Toffoli count and peak logical qubits $(N_{Tof} Q_{max})$ by factors of 2.39 and 4.84, respectively. At a second autocallable setting, fresh search recovers a 1.35-fold saving after the tested fixed adaptation loses its advantage. For the factor-sum circuit, we prove exact coherent execution of its integer specification for every input, incoming accumulator and measurement record, with clean workspace and phase cancellation. A separate lattice calculation gives a numerical angle-tolerance-violation probability of 6.248e-8 and evaluates pricing bias under the declared loading law, with bounded omission but no certified numerical enclosure. The results connect compact representations to lower-cost payoff arithmetic and separately assessed logical and financial correctness. Their resource scope excludes loading, payoff rotation and estimation.

AI Summary

The paper asks how to reduce reversible payoff-arithmetic costs in amplitude-estimation-based derivative pricing while separately checking coherent implementation and financial approximation error. It studies fixed, discretized benchmarks: a three-asset worst-of autocallable and a target accrual redemption forward (TARF), using language-model-assisted circuit search with deterministic resource evaluation and simulation. The circuits retain compact integer market-state representations and contract history, reconstructing weighted quantities temporarily. Against matched internal references, the autocallable circuit reduces Toffoli count from 16,810 to 7,551 and peak logical qubits from 556 to 518, a $2.39$-fold reduction in $N_{\mathrm{Tof}}Q_{\max}$. Windowed TARF reduces these counts from 28,428 to 8,381 and from 384 to 269, respectively, giving a $4.84$-fold product reduction. At a second autocallable parameter setting, a tested fixed adaptation loses its advantage; fresh search finds $1.35$- and $1.31$-fold savings. Computational certificates establish the factor-sum autocallable’s exact coherent integer action for every encoded input, incoming accumulator and measurement record, including workspace cleanup and phase cancellation. A separate recombining lattice calculation estimates the probability of exceeding $10^{-5}$ radians angle error as $6.248\times10^{-8}$ under the declared loading law; omitted mass is bounded, but numerical errors lack a certified enclosure. Other circuits rely principally on sampled validation, including million-path holdouts. The resource scope excludes loading, payoff rotations, reflections and estimation. General parameter transfer, search reliability and complete-pricing advantage are not established; rare financial failures remain, and TARF lacks an all-input correctness proof.

Little sign of AI-generated textAI use disclosedIncrementalMissing comparison
authors supplied the tasks and controls, Claude proposed and implemented candidate designs, and deterministic tools fitted constants and evaluated programs.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

A Threshold for Quantum Advantage in Derivative Pricing

Shouvanik Chakrabarti, Rajiv Krishnakumar, Guglielmo Mazzola +3 more

We give an upper bound on the resources required for valuable quantum advantage in pricing derivatives. To do so, we give the first complete resource estimates for useful quantum derivative pricing, using autocallable and Target Accrual Redemption Forward (TARF) derivatives as benchmark use cases. We uncover blocking challenges in known approaches and introduce a new method for quantum derivative pricing – the re-parameterization method – that avoids them. This method combines pre-trained variational circuits with fault-tolerant quantum computing to dramatically reduce resource requirements. We find that the benchmark use cases we examine require 8k logical qubits and a T-depth of 54 million. We estimate that quantum advantage would require executing this program at the order of a second. While the resource requirements given here are out of reach of current systems, we hope they will provide a roadmap for further improvements in algorithms, implementations, and planned hardware architectures.

arXiv:2012.03819•Quantum•Jun 1, 2021•135 citations

Quantum Counterparty Credit Risk: A Study of Path-Dependent Derivatives

Sandeep Jha, Richard Oentaryo, Sanjay Sekaran +7 more

Estimating potential future exposure (PFE) for path-dependent derivatives, such as FX Target Redemption Forwards (TARFs), represents a formidable computational challenge due to the demand of nested Monte Carlo simulations. We present a hybrid quantum-classical framework that leverages Iterative Quantum Amplitude Estimation (IQAE) to address this via a reduced-order counterparty credit risk model. Our methodology maps the non-linear TARF payoff -- including cumulative gains and knock-out features -- into a quantum circuit via a two-step formulation, whereby a first-step percentile is computed classically and then used to condition quantum evaluation of subsequent exposure. We employ discretisation of the FX process and a linearised additive approximation of dynamics to enable implementation on current quantum platforms. Developed via the Classiq platform and validated on NVIDIA CUDA-Q and Amazon Braket SV1, our approach achieves relative errors of 1%-8% against classical benchmarks at the 97.5% and 99% confidence levels. While discretisation constraints and approximate monotonicity assumption may introduce bias and limit recovery of the full exposure distribution, our framework offers a tractable testbed for quantum acceleration. Scaling analysis suggests that $\sim$300 logical qubits could enable full 52-week exposure estimation, reducing sample complexity for tail-risk estimation via amplitude estimation at the cost of increased circuit depth.

quant-pharXiv:2606.28701•Jun 30, 2026•1 citation

Derivative Pricing using Quantum Signal Processing

Nikitas Stamatopoulos, William J. Zeng

Pricing financial derivatives on quantum computers typically includes quantum arithmetic components which contribute heavily to the quantum resources required by the corresponding circuits. In this manuscript, we introduce a method based on Quantum Signal Processing (QSP) to encode financial derivative payoffs directly into quantum amplitudes, alleviating the quantum circuits from the burden of costly quantum arithmetic. Compared to current state-of-the-art approaches in the literature, we find that for derivative contracts of practical interest, the application of QSP significantly reduces the required resources across all metrics considered, most notably the total number of T-gates by ∼ 16 x and the number of logical qubits by ∼ 4 x. Additionally, we estimate that the logical clock rate needed for quantum advantage is also reduced by a factor of ∼ 5 x. Overall, we find that quantum advantage will require 4.7 k logical qubits, and quantum devices that can execute 10 9 T-gates at a rate of 45 MHz. While in this work we focus specifically on the payoff component of the derivative pricing process where the method we present is most readily applicable, similar techniques can be employed to further reduce the resources in other applications, such as state preparation.

arXiv:2307.14310•Quantum•Apr 30, 2024•29 citations

Intermediate Qutrit-based improved quantum arithmetic operations with application on financial derivative pricing

Amit Saha, Turbasu Chatterjee, Anupam Chattopadhyay +1 more

Efficient quantum realizations of arithmetic operations, such as multiplication/division, addition/subtraction, square root, and arcsine — are of utmost importance for several quantum algorithms of practical importance. In the literature, such implementations are reported with the objective of minimizing qubit count, Toffoli/T/CNOT gate count, logical depth, quantum volume, and other commonly used metrics. By extending the realm of quantum states to higher dimensions, it has been demonstrated recently that intermediate qutrits can be leveraged to reduce ancilla qubits, thereby reducing qubit count. In this paper, we have incorporated this approach to prepare efficient implementation for several quantum arithmetic operations, obtaining significantly lowered qubit count. As an exemplary application, we study derivative pricing, in which, quantum arithmetic circuits are necessary for path loading using the re-parameterization method, as well as the payoff calculation. The intermediate qutrit approach requires to access higher energy levels, making the design prone to errors. Nevertheless, we show that the overall decrease in the error probability of error is significant owing to the fact that we achieve circuit robustness compared to the qubit-only approach in this NISQ era. We also study how we may achieve possible effectiveness with fewer gate counts of the proposed approach in the fault-tolerant setting.

arXiv:2205.15822•International Journal of Quantum Information•Nov 4, 2025•5 citations

On Representation Error in Quantum Option Pricing: A Diagnostic Study of the Standard Qiskit Implementation

K Soveet Kumar Prusty, Kartikeyan Premkumar, Shweta S. Aladakatti +1 more

Quantum Amplitude Estimation (QAE) is an attractive financial derivative pricing algorithm with the potential for a quadratic speedup over classical Monte Carlo approaches. Yet, quantum advantage will only be found if not just fault-tolerant hardware but also an accurate representation of the financial problem on a quantum circuit is achieved. This paper offers a reproducible, diagnostic examination of the default Qiskit Finance application to European option pricing. We present a critical diagnostic marker: the classical discretized price, which is the classically computed expected payoff on the quantum model's actual grid. Our convergence analysis of low-qubit models (4, 5, and 6 uncertainty qubits) shows that for this particular configuration, representation error, which arises due to imprecise trigonometric encoding of the option payoff function, is the prevalent source of error, much larger compared to the discretization error. In a 6-qubit model, the representation error was 0.17699 USD, which is an order of magnitude larger than the discretization error of -0.01200 USD. We illustrate how a different Piecewise Linear (PWL) encoding can successfully remove this representation error, but at the expense of more circuit resources. Our results, for the vanilla, low-qubit Qiskit Finance circuits we used, indicate that the creation of high-fidelity, resource-conscious problem encodings is a pressing and essential problem on the road to applicable quantum advantage in finance.

International Conference on Next-Gen Quantum and Advanced Computing: Algorithms, Security, and Beyond (NQComp)•Mar 5, 2026•0 citations

A Noise-Aware Quantum Algorithm for Credit Valuation Adjustments on Real Quantum Hardware

Guillem Borràs Espert, Francisco Gómez Casanova, Luis de Pedro Sánchez +2 more

Credit Valuation Adjustment (CVA) requires repeated risk-neutral expectation estimation, making it a natural test bed for quantum amplitude estimation, whose coherent amplification can in principle reduce Monte Carlo sampling cost. Whether this advantage survives realistic financial encoding and noisy hardware remains open. We develop an end-to-end, noise-aware quantum workflow for CVA, covering market calibration, discretisation, oracle construction, hardware execution and error-budget analysis. The model combines a correlated two-asset exposure with discount and default factors, encoded through a QCBM-based joint time-market distribution and controlled payoff rotations. We introduce contrast-aware Bayesian iterative quantum amplitude estimation (CABIQAE), which incorporates experimentally calibrated Grover-contrast loss into Bayesian inference and circuit-depth selection. Hardware-calibrated experiments show that CABIQAE exploits the limited amplification available on current devices more effectively than noise-agnostic alternatives and achieves a much lower classical post-processing runtime than the noise-aware BAE baseline. The analysis further decomposes the total CVA error into statistical, encoding, discretisation and hardware contributions. The full CVA oracle remains limited by circuit depth and discretisation resolution.

quant-pharXiv:2607.12990•Jul 15, 2026•1 citation
Quantum amplitude estimation can estimate expected discounted payoffs with quadratically fewer oracle calls than Monte Carlo, but each call requires coherent computation. We use language-model-assisted circuit design to reduce reversible payoff arithmetic for a three-asset worst-of autocallable and a target accrual redemption forward (TARF). The constructions retain compact integer representations of market paths alongside contract history, reconstructing quantities temporarily for contract decisions and payoff-angle evaluation.
Relative to matched internal references, the factor-sum autocallable and windowed TARF circuits reduce the product of Toffoli count and peak logical qubits (NTofQmax)(N_{Tof} Q_{max})(NTof​Qmax​) by factors of 2.39 and 4.84, respectively. At a second autocallable setting, fresh search recovers a 1.35-fold saving after the tested fixed adaptation loses its advantage. For the factor-sum circuit, we prove exact coherent execution of its integer specification for every input, incoming accumulator and measurement record, with clean workspace and phase cancellation. A separate lattice calculation gives a numerical angle-tolerance-violation probability of 6.248e-8 and evaluates pricing bias under the declared loading law, with bounded omission but no certified numerical enclosure. The results connect compact representations to lower-cost payoff arithmetic and separately assessed logical and financial correctness. Their resource scope excludes loading, payoff rotation and estimation.
The paper asks how to reduce reversible payoff-arithmetic costs in amplitude-estimation-based derivative pricing while separately checking coherent implementation and financial approximation error. It studies fixed, discretized benchmarks: a three-asset worst-of autocallable and a target accrual redemption forward (TARF), using language-model-assisted circuit search with deterministic resource evaluation and simulation.
The circuits retain compact integer market-state representations and contract history, reconstructing weighted quantities temporarily. Against matched internal references, the autocallable circuit reduces Toffoli count from 16,810 to 7,551 and peak logical qubits from 556 to 518, a 2.392.392.39-fold reduction in NTofQmax⁡N_{\mathrm{Tof}}Q_{\max}NTof​Qmax​. Windowed TARF reduces these counts from 28,428 to 8,381 and from 384 to 269, respectively, giving a 4.844.844.84-fold product reduction. At a second autocallable parameter setting, a tested fixed adaptation loses its advantage; fresh search finds 1.351.351.35- and 1.311.311.31-fold savings.
Computational certificates establish the factor-sum autocallable’s exact coherent integer action for every encoded input, incoming accumulator and measurement record, including workspace cleanup and phase cancellation. A separate recombining lattice calculation estimates the probability of exceeding 10−510^{-5}10−5 radians angle error as 6.248×10−86.248\times10^{-8}6.248×10−8 under the declared loading law; omitted mass is bounded, but numerical errors lack a certified enclosure. Other circuits rely principally on sampled validation, including million-path holdouts.
The resource scope excludes loading, payoff rotations, reflections and estimation. General parameter transfer, search reliability and complete-pricing advantage are not established; rare financial failures remain, and TARF lacks an all-input correctness proof.
We give an upper bound on the resources required for valuable quantum advantage in pricing derivatives. To do so, we give the first complete resource estimates for useful quantum derivative pricing, using autocallable and Target Accrual Redemption Forward (TARF) derivatives as benchmark use cases. We uncover blocking challenges in known approaches and introduce a new method for quantum derivative pricing – the re-parameterization method – that avoids them. This method combines pre-trained variational circuits with fault-tolerant quantum computing to dramatically reduce resource requirements. We find that the benchmark use cases we examine require 8k logical qubits and a T-depth of 54 million. We estimate that quantum advantage would require executing this program at the order of a second. While the resource requirements given here are out of reach of current systems, we hope they will provide a roadmap for further improvements in algorithms, implementations, and planned hardware architectures.
Estimating potential future exposure (PFE) for path-dependent derivatives, such as FX Target Redemption Forwards (TARFs), represents a formidable computational challenge due to the demand of nested Monte Carlo simulations. We present a hybrid quantum-classical framework that leverages Iterative Quantum Amplitude Estimation (IQAE) to address this via a reduced-order counterparty credit risk model. Our methodology maps the non-linear TARF payoff -- including cumulative gains and knock-out features -- into a quantum circuit via a two-step formulation, whereby a first-step percentile is computed classically and then used to condition quantum evaluation of subsequent exposure. We employ discretisation of the FX process and a linearised additive approximation of dynamics to enable implementation on current quantum platforms. Developed via the Classiq platform and validated on NVIDIA CUDA-Q and Amazon Braket SV1, our approach achieves relative errors of 1%-8% against classical benchmarks at the 97.5% and 99% confidence levels. While discretisation constraints and approximate monotonicity assumption may introduce bias and limit recovery of the full exposure distribution, our framework offers a tractable testbed for quantum acceleration. Scaling analysis suggests that $\sim$300 logical qubits could enable full 52-week exposure estimation, reducing sample complexity for tail-risk estimation via amplitude estimation at the cost of increased circuit depth.
Pricing financial derivatives on quantum computers typically includes quantum arithmetic components which contribute heavily to the quantum resources required by the corresponding circuits. In this manuscript, we introduce a method based on Quantum Signal Processing (QSP) to encode financial derivative payoffs directly into quantum amplitudes, alleviating the quantum circuits from the burden of costly quantum arithmetic. Compared to current state-of-the-art approaches in the literature, we find that for derivative contracts of practical interest, the application of QSP significantly reduces the required resources across all metrics considered, most notably the total number of T-gates by ∼ 16 x and the number of logical qubits by ∼ 4 x. Additionally, we estimate that the logical clock rate needed for quantum advantage is also reduced by a factor of ∼ 5 x. Overall, we find that quantum advantage will require 4.7 k logical qubits, and quantum devices that can execute 10 9 T-gates at a rate of 45 MHz. While in this work we focus specifically on the payoff component of the derivative pricing process where the method we present is most readily applicable, similar techniques can be employed to further reduce the resources in other applications, such as state preparation.
Efficient quantum realizations of arithmetic operations, such as multiplication/division, addition/subtraction, square root, and arcsine — are of utmost importance for several quantum algorithms of practical importance. In the literature, such implementations are reported with the objective of minimizing qubit count, Toffoli/T/CNOT gate count, logical depth, quantum volume, and other commonly used metrics. By extending the realm of quantum states to higher dimensions, it has been demonstrated recently that intermediate qutrits can be leveraged to reduce ancilla qubits, thereby reducing qubit count. In this paper, we have incorporated this approach to prepare efficient implementation for several quantum arithmetic operations, obtaining significantly lowered qubit count. As an exemplary application, we study derivative pricing, in which, quantum arithmetic circuits are necessary for path loading using the re-parameterization method, as well as the payoff calculation. The intermediate qutrit approach requires to access higher energy levels, making the design prone to errors. Nevertheless, we show that the overall decrease in the error probability of error is significant owing to the fact that we achieve circuit robustness compared to the qubit-only approach in this NISQ era. We also study how we may achieve possible effectiveness with fewer gate counts of the proposed approach in the fault-tolerant setting.
Quantum Amplitude Estimation (QAE) is an attractive financial derivative pricing algorithm with the potential for a quadratic speedup over classical Monte Carlo approaches. Yet, quantum advantage will only be found if not just fault-tolerant hardware but also an accurate representation of the financial problem on a quantum circuit is achieved. This paper offers a reproducible, diagnostic examination of the default Qiskit Finance application to European option pricing. We present a critical diagnostic marker: the classical discretized price, which is the classically computed expected payoff on the quantum model's actual grid. Our convergence analysis of low-qubit models (4, 5, and 6 uncertainty qubits) shows that for this particular configuration, representation error, which arises due to imprecise trigonometric encoding of the option payoff function, is the prevalent source of error, much larger compared to the discretization error. In a 6-qubit model, the representation error was 0.17699 USD, which is an order of magnitude larger than the discretization error of -0.01200 USD. We illustrate how a different Piecewise Linear (PWL) encoding can successfully remove this representation error, but at the expense of more circuit resources. Our results, for the vanilla, low-qubit Qiskit Finance circuits we used, indicate that the creation of high-fidelity, resource-conscious problem encodings is a pressing and essential problem on the road to applicable quantum advantage in finance.
Credit Valuation Adjustment (CVA) requires repeated risk-neutral expectation estimation, making it a natural test bed for quantum amplitude estimation, whose coherent amplification can in principle reduce Monte Carlo sampling cost. Whether this advantage survives realistic financial encoding and noisy hardware remains open. We develop an end-to-end, noise-aware quantum workflow for CVA, covering market calibration, discretisation, oracle construction, hardware execution and error-budget analysis. The model combines a correlated two-asset exposure with discount and default factors, encoded through a QCBM-based joint time-market distribution and controlled payoff rotations. We introduce contrast-aware Bayesian iterative quantum amplitude estimation (CABIQAE), which incorporates experimentally calibrated Grover-contrast loss into Bayesian inference and circuit-depth selection. Hardware-calibrated experiments show that CABIQAE exploits the limited amplification available on current devices more effectively than noise-agnostic alternatives and achieves a much lower classical post-processing runtime than the noise-aware BAE baseline. The analysis further decomposes the total CVA error into statistical, encoding, discretisation and hardware contributions. The full CVA oracle remains limited by circuit depth and discretisation resolution.