{"paper_id":"2509.18614","title":"Connecting Quantum Computing with Classical Stochastic Simulation","authors":["Jose Blanchet","Mark S. Squillante","Mario Szegedy","Guanyang Wang"],"paper_date":"2025-09-23","paper_type":"methodological","paper_url":"https://arxiv.org/pdf/2509.18614v1","page_url":"https://thequant.space/flowcharts/connecting-quantum-computing-with-classical-stochastic-simul/","scores":{"empirical_rigor":4,"math_complexity":6.5,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes quantum approaches to Monte Carlo computation, including quantum amplitude estimation and quantum‑accelerated multilevel Monte Carlo, illustrated with a financial example and a credit risk case study using Qiskit.","quote":"This tutorial paper introduces quantum approaches to Monte Carlo computation with applications in computational finance. Quantum-Accelerated Monte Carlo General Monte Carlo Methods Extends QAE to estimate the expected value of a general function, E[f(X)].","summary":"This tutorial paper introduces quantum approaches to Monte Carlo computation with applications in computational finance. We outline the basics of quantum computing using Grover’s algorithm for unstructured search to build intuition. We then move slowly to amplitude estimation problems and…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"A uniform superposition over the search space has been prepared.","type":"model","stated":"explicit","quote":"Once again, we assume that the uniform superposition has been applied.","support":"full"},{"assumption":"k distinguished elements are marked in the basis, represented by ω.","type":"model","stated":"explicit","quote":"Then, we assume that k distinguished elements are marked in the basis; as before, they altogether are represented by ω, which leads to |s⟩= 1 √ N N ∑ x=1 |x⟩= sinϕ |ω⟩+cosϕ |s′⟩.","support":"full"},{"assumption":"The Gaussian conditional independence model can be encoded with a finite number of qubits.","type":"model","stated":"implied","quote":"We use nz qubits to encode a discretized Gaussian variable Z, and allocate one qubit for each Xi.","support":"full"}]},"datasets":{"status":"available","items":[{"name":"Synthetic Gaussian Conditional Independence (GCI) model","provider":null,"kind":"synthetic","access":"unknown","period":null,"universe":null,"quote":"We use nz qubits to encode a discretized Gaussian variable Z, and allocate one qubit for each Xi. For example, we set nz = 4, and the truncation threshold between −3 to 3 for the discretized Gaussian.","support":"full"}],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"none"},"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":"Quantum Monte Carlo methods provide a quadratic speedup over classical Monte Carlo, allowing comparable accuracy with far fewer samples.","kind":"theoretical","quote":"The quadratic speedup of quantum approaches to Monte Carlo makes it possible to achieve comparable accuracy with far fewer samples. In such cases, quantum approaches to Monte Carlo (Montanaro 2015) can provide a quadratic speedup over Blanchet, Squillante, Szegedy, and Wang classical Monte Carlo approaches.","support":"full"},{"finding":"Quantum‑accelerated multilevel Monte Carlo can reduce the required number of samples, with speedup ranging from quadratic to sub‑quadratic depending on problem structure.","kind":"theoretical","quote":"The degree of speedup ranges from quadratic to sub-quadratic, depending on the structure of the problem.","support":"full"},{"finding":"A quantum‑inside‑quantum algorithm achieves quantum‑optimal complexity ˜O(1/ε) for nested Monte Carlo problems, improving on the classical O(1/ε²) rate.","kind":"theoretical","quote":"In contrast, the quantum-inside-quantum algorithm introduced by Blanchet et al. (2025) achieves the quantum-optimal complexity of ˜O(1/ε).","support":"full"}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":23,"citations":{"cited_by_in_corpus":0,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":0},"independent_papers":[],"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:47:27Z"},"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/"}