{"paper_id":"2402.17148","title":"Time series generation for option pricing on quantum computers using tensor network","authors":["Nozomu Kobayashi","Yoshiyuki Suimon","Koichi Miyamoto"],"paper_date":"2024-02-27","paper_type":"methodological","paper_url":"https://arxiv.org/pdf/2402.17148v1","page_url":"https://thequant.space/flowcharts/time-series-generation-for-option-pricing-on-quantum-compute/","scores":{"empirical_rigor":6,"math_complexity":8.5,"quadrant":"Holy Grail"},"proposes":{"status":"available","statement":"The paper proposes using a Matrix Product State (MPS) as a generative model for time series generation to enable path‑dependent option pricing on quantum computers.","quote":"To address these issues, we propose a novel approach that uses a Matrix Product State (MPS), which can be encoded into a state of qubits, as a generative model for time series generation.","summary":"Finance, especially option pricing, is a promising industrial field that might benefit from quantum computing. While quantum algorithms for option pricing have been proposed, it is desired to devise more efficient implementations of costly operations in the algorithms, one of which is preparing a…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"The risk‑free rate is assumed to be zero for simplicity.","type":"model","stated":"explicit","quote":"Note that, for the sake of simplicity, we assume the risk‑free rate to be 0 here and hereafter."},{"assumption":"Negative variance is avoided by reflecting it to positive (reflection positivity).","type":"model","stated":"explicit","quote":"To avoid a negative variance, we assume the reflection positivity, νi = −νi if νi < 0."},{"assumption":"Asset prices and volatility are discretized into m‑bit binary values.","type":"data","stated":"explicit","quote":"In the training of the MPS model, the physical dimensions are varied as 2m with m = 4, 5, 6. That means we discretize each price into m‑bit binary values."}]},"datasets":{"status":"available","items":[{"name":"Synthetic Heston model price paths","provider":null,"kind":"synthetic","access":"unknown","period":null,"universe":null,"quote":"With these settings, we then generate N = 10000 paths of the Heston model."}],"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":"The MPS model successfully generates price paths and probability distributions that resemble those of the Heston model.","kind":"performance","quote":"Our finding is that the proposed MPS model not only successfully generates price paths and probability distributions of the learned Heston model..."},{"finding":"Option prices computed from MPS‑generated paths become closer to Heston‑model prices as the bond dimension Dmax increases.","kind":"pricing-calibration","quote":"We find that, basically, the prices by the MPS model get closer to those by the Heston model as we increase Dmax."},{"finding":"For barrier options, the price difference between MPS and Heston models grows with larger Dmax, likely due to more paths crossing the barrier.","kind":"negative","quote":"Only for the barrier option, the price difference becomes larger as Dmax increases, which implies that the MPS model underestimates its value possibly because the MPS model generates more paths that exceed the barrier level..."}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":36,"citations":{"cited_by_in_corpus":1,"by_independent_authors":1,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":1,"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-14T18:13:50Z"},"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/"}