{"paper_id":"2505.09459","title":"Monte-Carlo Option Pricing in Quantum Parallel","authors":["Robert Scriba","Yuying Li","Jingbo B Wang"],"paper_date":"2025-05-14","paper_type":"methodological","paper_url":"https://arxiv.org/pdf/2505.09459v1","page_url":"https://thequant.space/flowcharts/monte-carlo-option-pricing-in-quantum-parallel/","scores":{"empirical_rigor":2,"math_complexity":8.5,"quadrant":"Lab Rats"},"proposes":{"status":"available","statement":"The paper proposes a stochastic method for simulating exponentially many asset price paths in quantum parallel to price options and assess portfolio risk.","quote":"we develop an effective stochastic method for simulating exponentially many potential asset paths in quantum parallel, leading to a highly accurate final distribution of stock prices.","summary":"Financial derivative pricing is a significant challenge in finance, involving the valuation of instruments like options based on underlying assets. While some cases have simple solutions, many require complex classical computational methods like Monte Carlo simulations and numerical techniques.…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"The underlying asset follows a Black‑Scholes stochastic evolution with constant drift µ and volatility σ.","type":"model","stated":"explicit","quote":"drift term = µ × ∆t × St−1, µ is the drift rate, and the diffusion term = σ × ∆Wt−1 × St−1, σ is the volatility of the stock"},{"assumption":"The Brownian increment ∆W is normally distributed with mean 0 and standard deviation √Δt.","type":"statistical","stated":"explicit","quote":"∆W is a stochastic variable, which is normally distributed about mean = 0 and std.= √∆t."},{"assumption":"Time to expiry is discretised into m = T/Δt equal steps.","type":"model","stated":"explicit","quote":"time to expiry of the option is discretised into m = T/∆t time steps."},{"assumption":"A logistic map with r=4 can generate a chaotic seed for sampling independent normal variables.","type":"execution","stated":"explicit","quote":"The seed generation function involves utilising a logistic map of r=4 to create approximate chaos"},{"assumption":"The number of quantum simulations N equals 2^{n_qubits}, where n_qubits is the number of index qubits.","type":"other","stated":"explicit","quote":"the equivalent number of simulations of the MCQP algorithm is given by N = 2nqubits where nqubits is the number of index qubits"}]},"datasets":{"status":"available","items":[{"name":"Synthetic Black‑Scholes Monte‑Carlo simulations","provider":null,"kind":"synthetic","access":"unknown","period":null,"universe":null,"quote":"... calculating an option price under the BSM, given a set of initial parameters, using a slightly modified classical Monte‑Carlo simulation"}],"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":"pricing-calibration","findings":[{"finding":"Pricing error decreases rapidly with the number of simulated paths, scaling down significantly quicker than classical Monte‑Carlo error.","kind":"theoretical","quote":"pricing error scales down significantly quicker, as would be theoretically expected."},{"finding":"Mean pricing error shows little dependence on the number of time steps beyond about 100 steps, where error plateaus.","kind":"performance","quote":"error begins to plateau at approximately 100 time steps."},{"finding":"Initial indications suggest lesser dependency of pricing accuracy on numerical precision bits and time steps compared with the number of simulations.","kind":"performance","quote":"model inputs and required computational resources and found initial indications of lesser dependency on numerical precision and time steps compared with the number of simulations."}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"available","supports":[],"contradicts":[{"paper":{"paper_id":"2311.07231","title":"Error Analysis of Option Pricing via Deep PDE Solvers: Empirical Study","paper_date":"2023-11-13","authors":["Rawin Assabumrungrat","Kentaro Minami","Masanori Hirano"],"empirical_rigor":8,"page_url":"https://thequant.space/flowcharts/error-analysis-of-option-pricing-via-deep-pde-solvers-empir/"},"question":"How does the number of time steps affect option pricing error in numerical methods?","this_paper_finding":"Mean pricing error shows little dependence on the number of time steps beyond about 100 steps, where error plateaus.","other_paper_finding":"A strong linear relationship exists between 1/√time steps and error, confirming that finer time discretization reduces pricing error, especially for MDBDP.","other_paper_quote":"There exists a particularly strong linear relationship between 1/√time steps and error.","note":"A finds error ∝1/√steps (linear with 1/√time steps), B finds error plateaus after ~100 steps, showing little dependence beyond that.","confidence":0.45}],"qualifies":[],"compared_with":27,"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":1,"extracted_at":"2026-11-14T17:38:20Z"},"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/"}