{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,28]],"date-time":"2026-08-28T06:02:53Z","timestamp":1787896973480,"version":"build-2784847793"},"reference-count":19,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T00:00:00Z","timestamp":1743897600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers"],"abstract":"<jats:p>This study explores the application of quantum computing in asset management, focusing on the use of the Quantum Approximate Optimization Algorithm (QAOA) to solve specific classes of financial asset recommendation problems. While quantum computing holds promise for combinatorial optimization tasks, its application to portfolio management faces significant challenges in scalability for practical implementations. In this work, we model the problem using a graph representation where nodes represent investors, and edges reflect significant similarities in asset choices. We test the proposed method using quantum simulators, including cuQuantum, Cirq-GPU, and Cirq with IonQ, and compare the performance of quantum optimization against classical brute-force methods. Our results suggest that quantum algorithms may offer computational advantages for certain use cases, though classical heuristics also provide competitive performance for smaller datasets. This study contributes to the ongoing investigation into the potential of quantum computing for real-time financial decision-making, providing insights into both its applicability and limitations in asset management for larger and more complex investor datasets.<\/jats:p>","DOI":"10.3390\/computers14040137","type":"journal-article","created":{"date-parts":[[2025,4,7]],"date-time":"2025-04-07T03:23:07Z","timestamp":1743996187000},"page":"137","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Quantum Testing of Recommender Algorithms on GPU-Based Quantum Simulators"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-1467-0770","authenticated-orcid":false,"given":"Chenxi","family":"Liu","sequence":"first","affiliation":[{"name":"Department of Computing, Hong Kong Polytechnic University, Hong Kong, China"},{"name":"HedgeSPA Private Limited, 12 Woodlands Square #05-70 Woods Square Tower 1, Singapore 737715, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-4620-7065","authenticated-orcid":false,"given":"W. Bernard","family":"Lee","sequence":"additional","affiliation":[{"name":"HedgeSPA Private Limited, 12 Woodlands Square #05-70 Woods Square Tower 1, Singapore 737715, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2946-5509","authenticated-orcid":false,"given":"Anthony G.","family":"Constantinides","sequence":"additional","affiliation":[{"name":"AI & Data Analytics Lab, Imperial College London, London SW7 2AZ, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2025,4,6]]},"reference":[{"key":"ref_1","unstructured":"Fabozzi, F.J., and Markowitz, H.M. (2011). Equity Valuation and Portfolio Management, John Wiley & Sons."},{"key":"ref_2","first-page":"77","article-title":"Portfolio Selection","volume":"7","author":"Markowitz","year":"1952","journal-title":"J. Financ."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Karp, R.M. (2021). 36 Reducibility among Combinatorial Problems (1972). Ideas That Created the Future, MIT Press.","DOI":"10.7551\/mitpress\/12274.003.0038"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","article-title":"Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming","volume":"42","author":"Goemans","year":"1995","journal-title":"J. ACM"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0004-3702(93)90036-B","article-title":"Approximating probabilistic inference in Bayesian belief networks is NP-hard","volume":"60","author":"Dagum","year":"1993","journal-title":"Artif. Intell."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Punnen, A.P., and Punnen, A.P. (2022). The Quadratic Unconstrained Binary Optimization Problem: Theory, Algorithms, and Applications, Springer International Publishing AG. [1st ed.].","DOI":"10.1007\/978-3-031-04520-2"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10589-021-00310-6","article-title":"MADAM: A parallel exact solver for max-cut based on semidefinite programming and ADMM","volume":"80","author":"Hrga","year":"2021","journal-title":"Comput. Optim. Appl."},{"key":"ref_8","unstructured":"Cameron, I., Tomesh, T., Sasycamorem, Z., and Safro, I. (2024). Scaling Up the Quantum Divide and Conquer Algorithm for Combinatorial Optimization. arXiv."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1038\/s41567-020-01105-y","article-title":"Quantum approximate optimization of non-planar graph problems on a planar superconducting processor","volume":"17","author":"Harrigan","year":"2021","journal-title":"Nat. Phys."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/s10878-014-9734-0","article-title":"The unconstrained binary quadratic programming problem: A survey","volume":"28","author":"Kochenberger","year":"2014","journal-title":"J. Comb. Optim."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1006\/jcta.2000.3154","article-title":"Long Finite Sequences","volume":"95","author":"Friedman","year":"2001","journal-title":"J. Comb. Theory. Ser. A"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Bayraktar, H., Charara, A., Clark, D., Cohen, S., Costa, T., Fang, Y.L., Gao, Y., Guan, J., Gunnels, J., and Haidar, A. (2023). cuQuantum SDK: A High-Performance Library for Accelerating Quantum Science. arXiv.","DOI":"10.1109\/QCE57702.2023.00119"},{"key":"ref_13","unstructured":"Quantum AI Team (2025, April 04). Cirq: A Python Framework for Creating, Editing, and Optimizing Quantum Circuits. GitHub. Available online: https:\/\/github.com\/quantumlib\/Cirq."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Lee, L.B., and Constantinides, A.G. (2023, January 17\u201322). Computational Experiments for a Quantum Computing Application in Finance. Proceedings of the IEEE International Conference on Quantum Computing and Engineering, Bellevue, WA, USA.","DOI":"10.1109\/QCE57702.2023.00054"},{"key":"ref_15","unstructured":"Lee, W.B., and Constantinides, A.G. (2021, January 19\u201321). Recent Advances in Portfolio Construction and Expected Return Estimates Using Graph Theory. Proceedings of the ITISE, Gran Canaria, Spain."},{"key":"ref_16","unstructured":"Farhi, E., Goldstone, J., and Gutmann, S. (2014). A Quantum Approximate Optimization Algorithm. arXiv."},{"key":"ref_17","unstructured":"Lee, W.B., Carney, E.T., and Constantinides, A.G. (2021, January 8\u201312). Computational Results from Portfolio Graph Cut Simulations. Proceedings of the Annual Meeting of the American Statistical Association, Joint Statistical Meeting, (Virtual Conference)."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"015002","DOI":"10.1103\/RevModPhys.90.015002","article-title":"Adiabatic quantum computation","volume":"90","author":"Albash","year":"2018","journal-title":"Rev. Mod. Phys."},{"key":"ref_19","unstructured":"Kremenetski, V., Hogg, T., Hadfield, S., Cotton, S.J., and Tubman, N.M. (2021). Quantum Alternating Operator Ansatz (QAOA) Phase Diagrams and Applications for Quantum Chemistry. arXiv."}],"container-title":["Computers"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2073-431X\/14\/4\/137\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T17:11:14Z","timestamp":1760029874000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2073-431X\/14\/4\/137"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,6]]},"references-count":19,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2025,4]]}},"alternative-id":["computers14040137"],"URL":"https:\/\/doi.org\/10.3390\/computers14040137","relation":{},"ISSN":["2073-431X"],"issn-type":[{"value":"2073-431X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,4,6]]}}}