{"paper_id":"2508.13557","title":"Portfolio construction using a sampling-based variational quantum scheme","authors":["Gabriele Agliardi","Dimitris Alevras","Vaibhaw Kumar","Roberto Lo Nardo","Gabriele Compostella","Sumit Kumar","Manuel Proissl","Bimal Mehta"],"paper_date":"2025-08-19","paper_type":"methodological","paper_url":"https://arxiv.org/pdf/2508.13557v2","page_url":"https://thequant.space/flowcharts/portfolio-construction-using-a-sampling-based-variational-qu/","scores":{"empirical_rigor":8,"math_complexity":7.5,"quadrant":"Holy Grail"},"proposes":{"status":"available","statement":"The paper proposes a sampling-based CVaR Variational Quantum Algorithm (VQA) combined with a classical local-search post‑processing workflow and a problem formulation that avoids qubit overhead for portfolio construction.","quote":"We evaluate the sampling-based CVaR Variational Quantum Algorithm (VQA), combined with a local-search post-processing, for solving problem instances that beyond a certain size become classically hard. We also propose a problem formulation that is suited for sampling-based VQA.","summary":"The efficient and effective construction of portfolios that adhere to real-world constraints is a challenging optimization task in finance. We investigate a concrete representation of the problem with a focus on design proposals of an Exchange Traded Fund. We evaluate the sampling-based CVaR…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"Portfolio variables are integer numbers of bond lots (yi) for each candidate bond.","type":"model","stated":"explicit","quote":"PROBLEM FORMULATION In various industry-relevant scenarios, the problem variables are integer variables yi, where i = 1, ..., N spans all candidate bonds that may be included in the portfolio.","support":"full"},{"assumption":"Constraints can be incorporated without slack variables, using a rescaling factor s that penalises violations.","type":"model","stated":"explicit","quote":"It should be noted that during the conversion of the problem to the binary unconstrained form, the inequality constraints are usually handled by the introduction of slack variables, which in turn leads to an increase in the number of binary variables. In this work, we propose an equivalent unconstrained form of the problem as min x ∈{0, 1}n xT Qx + 1T max{0, s ⊙(Ax −b)}, (4) where s ∈Rm is an appropriate rescaling","support":"full"},{"assumption":"One qubit is used per bond, implying no qubit overhead for constraints.","type":"execution","stated":"explicit","quote":"II-A, it allows us to introduce problem constraints without any qubit overhead. As a consequence, we use only one qubit per bond.","support":"full"},{"assumption":"CVaR parameter α is set in the range (0, 1] to improve convergence and robustness to hardware noise.","type":"model","stated":"explicit","quote":"When setting α in the range (0, 1], then CVaR is known to lead to better convergence in quantum optimization [6], [9] and shows to be more robust against hardware noise [10].","support":"full"},{"assumption":"Hardware noise is present but does not prevent the quantum samples from improving over iterations.","type":"execution","stated":"implied","quote":"Our results indicate that despite the hardware noise, the raw samples continually improve over an increasing number of iterations and converge towards lower objective values.","support":"full"},{"assumption":"Local‑search post‑processing can improve the quality of quantum‑generated samples.","type":"model","stated":"explicit","quote":"Recent works [14]–[16] have shown that a classical post-processing of candidate solutions found by the quantum algo-rithm, based on local search, can often improve the quality of solutions. In this work, we examine, in detail, the effect of local search on the samples obtained from the quantum scheme.","support":"full"}]},"datasets":{"status":"none_found","items":[],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"unclear"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"evidence_card","rule":"R2","candidates":{"front_matter":"unclear","evidence_card":"n/a","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"unclear","findings":[{"finding":"Utility‑scale experiments on IBM Heron processors with 109 qubits and up to 4200 gates achieve a relative solution error of 0.49 %.","kind":"performance","quote":"Our utility-scale experiments on IBM Heron processors involve 109 qubits and up to 4200 gates, achieving a relative solution error of 0.49%.","support":"full"},{"finding":"A combined quantum‑classical workflow (CVaR‑VQA + local search) attains better accuracy than purely classical local search.","kind":"performance","quote":"Results indicate that a combined quantum-classical workflow achieves better accuracy compared to purely classical local search, and that hard-to-simulate quantum circuits may lead to better convergence than simpler circuits. Our simulation-based study on problems involving 100+ qubits indicates that the local search alone achieves worse results than in combination with CVaR-VQA.","support":"full"},{"finding":"Local search alone yields worse results than when combined with CVaR‑VQA on problems involving 100+ qubits.","kind":"performance","quote":"Our simulation-based study on problems involving 100+ qubits indicates that the local search alone achieves worse results than in combination with CVaR-VQA.","support":"full"},{"finding":"Hardware runs show that raw quantum samples improve over iterations and converge toward lower objective values despite noise.","kind":"performance","quote":"Our results indicate that despite the hardware noise, the raw samples continually improve over an increasing number of iterations and converge towards lower objective values.","support":"full"},{"finding":"After local‑search post‑processing, the best optimization gap is 0.49 % (TwoLocal bilinear ansatz), followed by 0.55 % (TwoLocal color) and 0.91 % (BFCD color).","kind":"performance","quote":"The best performance after local search is achieved by the TwoLocal bilinear ansatz (0.49% optimization gap), followed by the TwoLocal color (0.55%) and BFCD color (0.91%).","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":16,"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:48:12Z"},"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/"}