{"paper_id":"2407.19857","title":"PO-QA: A Framework for Portfolio Optimization using Quantum Algorithms","authors":["Kamila Zaman","Alberto Marchisio","Muhammad Kashif","Muhammad Shafique"],"paper_date":"2024-07-29","paper_type":"methodological","paper_url":"https://arxiv.org/pdf/2407.19857v1","page_url":"https://thequant.space/flowcharts/po-qa-a-framework-for-portfolio-optimization-using-quantum/","scores":{"empirical_rigor":6.5,"math_complexity":7,"quadrant":"Holy Grail"},"proposes":{"status":"available","statement":"The paper proposes a novel scalable PO-QA framework to systematically investigate quantum circuit parameter variations (rotation blocks, entanglement types, repetitions) for portfolio optimization using VQE and QAOA.","quote":"In this work, we propose a novel scalable framework, denoted PO-QA, to systematically investigate the variation of quantum parameters (such as rotation blocks, repetitions, and entanglement types) to observe their subtle effect on the overall performance.","summary":"Portfolio Optimization (PO) is a financial problem aiming to maximize the net gains while minimizing the risks in a given investment portfolio. The novelty of Quantum algorithms lies in their acclaimed potential and capability to solve complex problems given the underlying Quantum Computing (QC)…","strategy":null},"assumptions":{"status":"none_found","items":[]},"datasets":{"status":"available","items":[{"name":"Historical financial data of 8 stock values","provider":"Wikipedia DataProvider interface via Qiskit","kind":"market-prices","access":"public","period":"2016-07-01 to 2016-12-31","universe":"8 stocks","quote":"EVALUATING OUR PO-QA FRAMEWORK A. Experimental Setup In this work, we use historical financial data of 8 stock values from the Wikipedia DataProvider interface provided by Qiskit, in a time period of 6 months from 1st July 2016 to 31st December 2016.","support":"full"}],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"daily"},"transaction_costs":{"status":"none_found","modeled":"unclear","headline_net_of_costs":null,"detail":null,"quote":null,"source":"none","rule":"R0b","candidates":{"front_matter":"unclear","evidence_card":"no","evidence_card_quoted":false},"meaning":"no cost treatment was found in the passages the extractor read; that is not evidence that costs are not modeled"},"results":{"status":"available","evaluation_type":"unclear","findings":[{"finding":"QAOA outperforms VQE, matching the classical exact eigensolver more often across risk values.","kind":"performance","quote":"The classical solution is an exact eigensolver used to minimize the ground-energy state landscape. • Key Takeaway: Our results revealed that the QAOA outperforms the VQE and that interesting correlations between quantum circuit complexity, PO performance, risk, and ground state energy values can be found. II.","support":"full"},{"finding":"QAOA is mostly insensitive to quantum circuit variations, whereas VQE shows extremely high sensitivity to those variations.","kind":"performance","quote":"From the results, we can observe that the QAOA is mostly insensitive to the quantum circuit variations we have performed in the context of PO, whereas the VQE demonstrates extremely high sensitivity towards indices variations.","support":"full"},{"finding":"Five repetitions of the quantum circuit outperform three repetitions, indicating circuit depth is directly correlated with performance.","kind":"performance","quote":"For instance, we can observe that 5 repetitions outperform 3. We can derive that the circuit depth is directly correlated with the performance.","support":"full"},{"finding":"Experiments with low risk achieve lower ground state energy, while increasing risk progressively raises the energy value.","kind":"performance","quote":"We can also observe that experiments with low risk achieve a lower ground state energy, while increasing the risk progressively increases the energy value.","support":"full"},{"finding":"QAOA architectures have a higher matching rate with the exact eigensolver (classical benchmark) compared to VQE architectures.","kind":"performance","quote":"Overall, we can observe that the QAOA tends to perform better than the VQE since more QAOA architectures match with the baseline classical optimal portfolio as observable in Fig. 6. Fig. 6 clearly highlights that the QAOA has a higher matching rate with the exact eigensolver, which is being used as a classical benchmark.","support":"full"}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"available","supports":[],"contradicts":[],"qualifies":[],"compared_with":23,"citations":{"cited_by_in_corpus":2,"by_independent_authors":2,"how_cited":{"used_as_baseline":1,"uses_method_or_data":1,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":0},"independent_papers":[{"paper":{"paper_id":"2504.08843","title":"End-to-End Portfolio Optimization with Quantum Annealing","paper_date":"2025-04-10","authors":["Sai Nandan Morapakula","Sangram Deshpande","Rakesh Yata","Rushikesh Ubale","Uday Wad","Kazuki Ikeda"],"empirical_rigor":6,"page_url":"https://thequant.space/flowcharts/end-to-end-portfolio-optimization-with-quantum-annealing/"},"how":"used_as_baseline","quote":null},{"paper":{"paper_id":"2601.18811","title":"Variational Quantum Circuit-Based Reinforcement Learning for Dynamic Portfolio Optimization","paper_date":"2026-01-20","authors":["Vincent Gurgul","Ying Chen","Stefan Lessmann"],"empirical_rigor":7.5,"page_url":"https://thequant.space/flowcharts/variational-quantum-circuit-based-reinforcement-learning-for-dynamic-portfolio/"},"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:56:10Z"},"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/"}