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.
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.
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.
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) 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.
We introduce a quantum algorithm to compute the market risk of financial derivatives. Previous work has shown that quantum amplitude estimation can accelerate derivative pricing quadratically in the target error and we extend this to a quadratic error scaling advantage in market risk computation. We show that employing quantum gradient estimation algorithms can deliver a further quadratic advantage in the number of the associated market sensitivities, usually called greeks . By numerically simulating the quantum gradient estimation algorithms on financial derivatives of practical interest, we demonstrate that not only can we successfully estimate the greeks in the examples studied, but that the resource requirements can be significantly lower in practice than what is expected by theoretical complexity bounds. This additional advantage in the computation of financial market risk lowers the estimated logical clock rate required for financial quantum advantage from Chakrabarti et al. [Quantum 5, 463 (2021)] by a factor of ~7, from 50MHz to 7MHz, even for a modest number of greeks by industry standards (four). Moreover, we show that if we have access to enough resources, the quantum algorithm can be parallelized across 60 QPUs, in which case the logical clock rate of each device required to achieve the same overall runtime as the serial execution would be ~100kHz. Throughout this work, we summarize and compare several different combinations of quantum and classical approaches that could be used for computing the market risk of financial derivatives.
We present a comprehensive quantum algorithm tailored for pricing autocallable options, offering a full implementation and experimental validation. Our experiments include simulations conducted on high performance computing (HPC) hardware, along with an empirical analysis of convergence to the classically estimated value. Our key innovation is an improved integration-based exponential amplitude loading technique that reduces circuit depth compared to state-of-the-art approaches. A detailed complexity analysis in a relevant setting shows a∼50xreduction in T-depth for the payoff component relative to previous methods. These contributions represent a step toward more efficient quantum approaches to pricing complex financial derivatives.
We introduce two quantum algorithms to compute the Value at Risk (VaR) and Conditional Value at Risk (CVaR) of financial derivatives using quantum computers: the first by applying existing ideas from quantum risk analysis to derivative pricing, and the second based on a novel approach using Quantum Signal Processing (QSP). Previous work in the literature has shown that quantum advantage is possible in the context of individual derivative pricing and that advantage can be leveraged in a straightforward manner in the estimation of the VaR and CVaR. The algorithms we introduce in this work aim to provide an additional advantage by encoding the derivative price over multiple market scenarios in superposition and computing the desired values by applying appropriate transformations to the quantum system. We perform complexity and error analysis of both algorithms, and show that while the two algorithms have the same asymptotic scaling the QSP-based approach requires significantly fewer quantum resources for the same target accuracy. Additionally, by numerically simulating both quantum and classical VaR algorithms, we demonstrate that the quantum algorithm can extract additional advantage from a quantum computer compared to individual derivative pricing. Specifically, we show that under certain conditions VaR estimation can lower the latest published estimates of the logical clock rate required for quantum advantage in derivative pricing by up to ∼30x. In light of these results, we are encouraged that our formulation of derivative pricing in the QSP framework may be further leveraged for quantum advantage in other relevant financial applications, and that quantum computers could be harnessed more efficiently by considering problems in the financial sector at a higher level.
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.