{"paper_id":"2404.10088","title":"Quantum Risk Analysis of Financial Derivatives","authors":["Nikitas Stamatopoulos","B. David Clader","Stefan Woerner","William J. Zeng"],"paper_date":"2024-04-15","paper_type":"methodological","paper_url":"https://arxiv.org/pdf/2404.10088v1","page_url":"https://thequant.space/flowcharts/quantum-risk-analysis-of-financial-derivatives/","scores":{"empirical_rigor":4,"math_complexity":7.5,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes two quantum algorithms to compute Value at Risk (VaR) and Conditional Value at Risk (CVaR) of financial derivatives, one based on existing quantum risk analysis ideas and a second using Quantum Signal Processing (QSP).","quote":"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).","summary":"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…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"Scenarios are encoded as computational basis states representing tweaks to market data parameters.","type":"data","stated":"explicit","quote":"In order to compute the VaR of financial derivatives in the way described in Sec. II, we construct scenarios consisting of tweaks to (classical) market data parameters which can be encoded in some appropriate way as a computational 4 basis state |s⟩. For example, a scenario which simultaneously tweaks d underlying parameters (also called risk factors), can be encoded as |s⟩= |t1t2, . . . td⟩, (7) where ti is a","support":"full"},{"assumption":"Each portfolio value V(s_i) can be exactly represented using m qubits.","type":"model","stated":"explicit","quote":"(10) Let us for now assume that each value V (si) can be exactly represented using m qubits.","support":"full"},{"assumption":"Scenario prices are drawn from a normal distribution for the autocallable derivative product.","type":"market","stated":"explicit","quote":"We calculate the resources required by the QSP-based VaR algorithm to estimate the VaR of the product to the same accuracy as a classical Monte Carlo method, assuming that the product is evaluated under scenarios such that the resulting prices are distributed normally. We use the latest available resource estimates from Ref. [19], whereby an autocallable derivative product can be priced to within ϵp = 2 × 10−3 in","support":"full"},{"assumption":"The QSP-based algorithm approximates the threshold function with a polynomial of degree d, introducing an approximation error ϵ_A.","type":"model","stated":"explicit","quote":"On the other hand, because in this case we use QSP to approximate the threshold function of Eq. (22), we do not implement exactly the threshold function θµ(x) but rather an approximation, which we denote as θ′ µ(x). In this case, we pick a value for the polynomial degree d and for each value of µ during bisection search we generate a d-degree polynomial approximation to the threshold function θµ(x) using the method","support":"full"},{"assumption":"Classical VaR estimation scales as O(N/ε_p^2) when pricing each scenario separately.","type":"statistical","stated":"explicit","quote":"When the value of the derivative portfolio is computed classically using Monte Carlo to accuracy ϵp, the VaR computation requires separate Monte Carlo pricings for each scenario, and therefore the complexity of the algorithm scales as O \u0000N/ϵ2 p \u0001 .","support":"full"},{"assumption":"Scenario preparation superposition can be loaded efficiently, though the method is left as an open question.","type":"execution","stated":"explicit","quote":"In this work, we have left the scenario preparation as an open question and instead, through numerical simulations, we estimate upper bounds on the resources required to prepare the necessary superposition in order for quantum advantage to exist.","support":"full"}]},"datasets":{"status":"available","items":[{"name":"Autocallable derivative product","provider":"Ref. [6]","kind":"synthetic","access":"unknown","period":null,"universe":null,"quote":"As a benchmark to examine the conditions for practical quantum advantage, we consider the autocallable derivative product studied in Ref. [6]. We calculate the resources required by the QSP-based VaR algorithm to estimate the VaR of the product to the same accuracy as a classical Monte Carlo method, assuming that the product is evaluated under scenarios such that the resulting prices are distributed normally.","support":"full"}],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"synthetic"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R3","candidates":{"front_matter":"n/a","evidence_card":"n/a","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"none","findings":[{"finding":"Both quantum algorithms have the same asymptotic scaling, but the QSP-based approach requires significantly fewer quantum resources for the same target accuracy.","kind":"theoretical","quote":"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.","support":"full"},{"finding":"The quantum algorithm can reduce the logical clock rate required for quantum advantage in derivative pricing by approximately 30× in certain settings.","kind":"performance","quote":"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 $\\sim 30$x. We find that in certain settings, the quantum algorithm can provide a reduction in the logical clock rate required for quantum advantage estimated in Ref. [19] by ∼30x.","support":"full"},{"finding":"Simulation results show that the QSP method achieves comparable VaR estimation accuracy with fewer oracle call invocations than the QAE method.","kind":"performance","quote":"The results from the simulation for both QAE and QSP methods for different values of oracle call invocations and the final amplitude estimation accuracy ϵA are shown in Fig. 6.","support":"full"},{"finding":"Numerical simulations demonstrate that quantum VaR estimation can extract additional advantage compared to individual derivative pricing.","kind":"theoretical","quote":"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.","support":"full"},{"finding":"The QSP algorithm can approximate the threshold function using a polynomial of degree d, enabling efficient bisection search for VaR estimation.","kind":"theoretical","quote":"In this case, we pick a value for the polynomial degree d and for each value of µ during bisection search we generate a d-degree polynomial approximation to the threshold function θµ(x) using the method described in Sec. IV D and apply the resulting function to the sampled scenario prices.","support":"full"}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"available","supports":[],"contradicts":[],"qualifies":[],"compared_with":34,"citations":{"cited_by_in_corpus":1,"by_independent_authors":1,"how_cited":{"used_as_baseline":0,"uses_method_or_data":1,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":0},"independent_papers":[{"paper":{"paper_id":"2507.19206","title":"Implementing Credit Risk Analysis with Quantum Singular Value Transformation","paper_date":"2025-07-25","authors":["Davide Veronelli","Francesca Cibrario","Emanuele Dri","Valeria Zaffaroni","Giacomo Ranieri","Davide Corbelletto"],"empirical_rigor":4.5,"page_url":"https://thequant.space/flowcharts/implementing-credit-risk-analysis-with-quantum-singular-value-transformation/"},"how":"uses_method_or_data","quote":null}],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":false,"code_url":null,"note":"No repository presented by the authors as their own was found in the paper. Absence here is not proof that no code exists."},"replication":{"status":"none_found","card":null,"note":"No replication of this paper has been run by thequant.space yet."},"extraction":{"text_source":"fulltext","model":"openai/gpt-oss-120b","version":2,"extracted_at":"2026-11-14T19:58:01Z"},"provenance":{"claims":"Everything here is what the authors state in the paper. Nothing was re-run or reproduced by the platform.","quotes":"Assumptions, datasets, cost detail and findings were extracted by a language model. Every quote is verbatim paper text. Where an item has `support`, \"full\" means every figure in it appears in the quoted sentences and \"partial\" means a figure is stated elsewhere in the paper; items with a figure found nowhere in the paper were discarded.","datasets_known":"datasets.known lists well-known vendors and public datasets by a stable id, found by a dictionary over the full text where the sentence says the data is used; it is independent of the model and covers only names in the dictionary.","flags":"transaction_costs.modeled, results.evaluation_type and results.out_of_sample.method are platform classifications (structured-decision models); see https://thequant.space/score-guide/#penalty-flags","comparisons":"supports / contradicts / qualifies are a language model's reading of two papers' quoted findings, restricted to closely related papers that share no author. They are pointers to read, not verified replications, and coverage is partial.","implementation":"code_url is a repository the paper itself presents as its own (rule-scored, ambiguous cases judged by a model), checked for liveness when it was recorded."},"docs":"https://thequant.space/agents/"}