{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T03:39:27Z","timestamp":1778643567893,"version":"3.51.4"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,12,16]],"date-time":"2022-12-16T00:00:00Z","timestamp":1671148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,12,16]],"date-time":"2022-12-16T00:00:00Z","timestamp":1671148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100011736","name":"Ministerium f\u00fcr Wirtschaft, Arbeit und Wohnungsbau Baden-W\u00fcrttemberg","doi-asserted-by":"publisher","award":["QORA"],"award-info":[{"award-number":["QORA"]}],"id":[{"id":"10.13039\/501100011736","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We present a detailed study of portfolio optimization using different versions of the quantum approximate optimization algorithm (QAOA). For a given list of assets, the portfolio optimization problem is formulated as quadratic binary optimization constrained on the number of assets contained in the portfolio. QAOA has been suggested as a possible candidate for solving this problem (and similar combinatorial optimization problems) more efficiently than classical computers in the case of a sufficiently large number of assets. However, the practical implementation of this algorithm requires a careful consideration of several technical issues, not all of which are discussed in the present literature. The present article intends to fill this gap and thereby provides the reader with a useful guide for applying QAOA to the portfolio optimization problem (and similar problems). In particular, we will discuss several possible choices of the variational form and of different classical algorithms for finding the corresponding optimized parameters. Viewing at the application of QAOA on error-prone NISQ hardware, we also analyse the influence of statistical sampling errors (due to a finite number of shots) and gate and readout errors (due to imperfect quantum hardware). Finally, we define a criterion for distinguishing between \u2018easy\u2019 and \u2018hard\u2019 instances of the portfolio optimization problem.<\/jats:p>","DOI":"10.1007\/s11128-022-03766-5","type":"journal-article","created":{"date-parts":[[2022,12,16]],"date-time":"2022-12-16T10:03:13Z","timestamp":1671184993000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":85,"title":["Benchmarking the performance of portfolio optimization with QAOA"],"prefix":"10.1007","volume":"22","author":[{"given":"Sebastian","family":"Brandhofer","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Braun","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0586-7354","authenticated-orcid":false,"given":"Vanessa","family":"Dehn","sequence":"additional","affiliation":[]},{"given":"Gerhard","family":"Hellstern","sequence":"additional","affiliation":[]},{"given":"Matthias","family":"H\u00fcls","sequence":"additional","affiliation":[]},{"given":"Yanjun","family":"Ji","sequence":"additional","affiliation":[]},{"given":"Ilia","family":"Polian","sequence":"additional","affiliation":[]},{"given":"Amandeep Singh","family":"Bhatia","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Wellens","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,12,16]]},"reference":[{"key":"3766_CR1","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A quantum approximate optimization algorithm. arXiv:1411.4028 (2014)"},{"key":"3766_CR2","doi-asserted-by":"publisher","first-page":"34","DOI":"10.3390\/a12020034","volume":"12","author":"S Hadfield","year":"2019","unstructured":"Hadfield, S., Wang, Z., O\u2019Gorman, B., Rieffel, E.G., Venturelli, D., Biswas, R.: From the quantum approximate optimization algorithm to a quantum alternating operator ansatz. Algorithms 12, 34 (2019)","journal-title":"Algorithms"},{"key":"3766_CR3","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Comput. 26, 1484 (1997)","journal-title":"SIAM J. Comput."},{"key":"3766_CR4","doi-asserted-by":"publisher","first-page":"150502","DOI":"10.1103\/PhysRevLett.103.150502","volume":"103","author":"AW Harrow","year":"2009","unstructured":"Harrow, A.W., Hassidim, A., Lloyd, S.: Quantum algorithm for linear systems of equations. Phys. Rev. Lett. 103, 150502 (2009)","journal-title":"Phys. Rev. Lett."},{"key":"3766_CR5","doi-asserted-by":"publisher","first-page":"120502","DOI":"10.1103\/PhysRevLett.127.120502","volume":"127","author":"L Bittel","year":"2021","unstructured":"Bittel, L., Kliesch, M.: Training variational quantum algorithms is NP-hard. Phys. Rev. Lett. 127, 120502 (2021)","journal-title":"Phys. Rev. Lett."},{"key":"3766_CR6","doi-asserted-by":"publisher","first-page":"6903","DOI":"10.1038\/s41598-019-43176-9","volume":"9","author":"GG Guerreschi","year":"2019","unstructured":"Guerreschi, G.G., Matsuura, A.Y.: QAOA for max-cut requires hundreds of qubits for quantum speed-up. Sci. Rep. 9, 6903 (2019)","journal-title":"Sci. Rep."},{"key":"3766_CR7","first-page":"021067","volume":"10","author":"L Zhou","year":"2020","unstructured":"Zhou, L., Wang, S.-T., Choi, S., Pichler, H., Lukin, M.D.: Quantum approximate optimization algorithm: performance, mechanism, and implementation on near-term devices. Phys. Rev. X 10, 021067 (2020)","journal-title":"Phys. Rev. X"},{"key":"3766_CR8","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0377-2217(98)00252-5","volume":"114","author":"R Mansini","year":"1999","unstructured":"Mansini, R., Speranza, M.G.: Heuristic algorithms for the portfolio selection problem with minimum transaction lots. Eur. J. Oper. Res. 114, 219 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"3766_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-012-0208-1","volume":"161","author":"J Detemple","year":"2014","unstructured":"Detemple, J.: Portfolio selection: a review. J. Optim. Theory Appl. 161, 1 (2014)","journal-title":"J. Optim. Theory Appl."},{"key":"3766_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18482-1","volume-title":"Linear and Mixed Integer Programming for Portfolio Optimization","author":"R Mansini","year":"2015","unstructured":"Mansini, R., Ogryczak, W., Speranza, M.G.: Linear and Mixed Integer Programming for Portfolio Optimization. Springer, Cham (2015)"},{"key":"3766_CR11","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/j.eswa.2019.02.011","volume":"125","author":"CB Kalayci","year":"2019","unstructured":"Kalayci, C.B., Ertenlice, O., Akbay, M.A.: A comprehensive review of deterministic models and applications for mean-variance portfolio optimization. Expert Syst. Appl. 125, 345 (2019)","journal-title":"Expert Syst. Appl."},{"key":"3766_CR12","doi-asserted-by":"publisher","first-page":"013006","DOI":"10.1103\/PhysRevResearch.4.013006","volume":"4","author":"S Mugel","year":"2022","unstructured":"Mugel, S., Kuchkovsky, C., S\u00e1nchez, E., Fern\u00e1ndez-Lorenzo, S., Luis-Hita, J., Lizaso, E., Or\u00fas, R.: Dynamic portfolio optimization with real datasets using quantum processors and quantum-inspired tensor networks. Phys. Rev. Res. 4, 013006 (2022)","journal-title":"Phys. Rev. Res."},{"key":"3766_CR13","doi-asserted-by":"publisher","first-page":"513","DOI":"10.22331\/q-2021-07-28-513","volume":"5","author":"N Slate","year":"2021","unstructured":"Slate, N., Matwiejew, E., Marsh, S., Wang, J.B.: Quantum walk-based portfolio optimisation. Quantum 5, 513 (2021)","journal-title":"Quantum"},{"key":"3766_CR14","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-030-77980-1_4","volume-title":"Computational Science\u2014ICCS 2021","author":"F Phillipson","year":"2021","unstructured":"Phillipson, F., Bhatia, H.S.: Portfolio optimisation using the d-wave quantum annealer. In: Paszynski, M., Kranzlm\u00fcller, D., Krzhizhanovskaya, V.V., Dongarra, J.J., Sloot, P.M.A. (eds.) Computational Science\u2014ICCS 2021, pp. 45\u201359. Springer, Cham (2021)"},{"key":"3766_CR15","unstructured":"Hodson, M., Ruck, B., Ong, H., Garvin, D., Dulman, S.: Portfolio rebalancing experiments using the quantum alternating operator ansatz. arXiv:1911.05296 (2019)"},{"key":"3766_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TQE.2020.3030314","volume":"1","author":"DJ Egger","year":"2020","unstructured":"Egger, D.J., Gambella, C., Marecek, J., McFaddin, S., Mevissen, M., Raymond, R., Simonetto, A., Woerner, S., Yndurain, E.: Quantum computing for finance: state of the art and future prospects. IEEE Trans. Quantum Eng. 1, 1 (2020)","journal-title":"IEEE Trans. Quantum Eng."},{"key":"3766_CR17","unstructured":"Baker, J.S., Radha, S.K.: Wasserstein solution quality and the quantum approximate optimization algorithm: a portfolio optimization case study. arXiv:2202.06782 (2022)"},{"key":"3766_CR18","first-page":"77","volume":"7","author":"H Markowitz","year":"1952","unstructured":"Markowitz, H.: Portfolio selection. J. Finance 7, 77 (1952)","journal-title":"J. Finance"},{"key":"3766_CR19","doi-asserted-by":"crossref","unstructured":"Shi, J., Tang, Y., Lu, Y., Feng, Y., Shi, R., Zhang, S.: Quantum circuit learning with parameterized boson sampling. IEEE Trans. Knowl. Data Eng., 1\u20131 (2021)","DOI":"10.1109\/TKDE.2021.3095103"},{"key":"3766_CR20","doi-asserted-by":"crossref","unstructured":"Shi, J., Wang, W., Lou, X., Zhang, S., Li, X.: Parameterized Hamiltonian learning with quantum circuit. IEEE Trans. Pattern Anal. Mach. Intell. 1\u201310 (2022)","DOI":"10.1109\/TPAMI.2022.3203157"},{"key":"3766_CR21","doi-asserted-by":"publisher","first-page":"012320","DOI":"10.1103\/PhysRevA.101.012320","volume":"101","author":"Z Wang","year":"2020","unstructured":"Wang, Z., Rubin, N.C., Dominy, J.M., Rieffel, E.G.: XY mixers: analytical and numerical results for the quantum alternating operator ansatz. Phys. Rev. A 101, 012320 (2020)","journal-title":"Phys. Rev. A"},{"key":"3766_CR22","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1103\/PhysRev.93.99","volume":"93","author":"RH Dicke","year":"1954","unstructured":"Dicke, R.H.: Coherence in spontaneous radiation processes. Phys. Rev. 93, 99 (1954)","journal-title":"Phys. Rev."},{"key":"3766_CR23","doi-asserted-by":"crossref","unstructured":"LaRose, R., Rieffel, E., Venturelli, D.: Mixer-phaser ans\u00e4tze for quantum optimization with hard constraints. arXiv:2107.06651 (2021)","DOI":"10.1007\/s42484-022-00069-x"},{"key":"3766_CR24","doi-asserted-by":"crossref","unstructured":"Cook, J., Eidenbenz, S., B\u00e4rtschi, A.: The quantum alternating operator ansatz on maximum k-vertex cover. In: 2020 IEEE International Conference on Quantum Computing and Engineering (QCE), pp. 83\u201392 (2020)","DOI":"10.1109\/QCE49297.2020.00021"},{"key":"3766_CR25","doi-asserted-by":"publisher","first-page":"202","DOI":"10.3390\/a15060202","volume":"15","author":"FG Fuchs","year":"2022","unstructured":"Fuchs, F.G., Lye, K.O., Nilsen, H.M., Stasik, A.J., Sartor, G.: Constraint preserving mixers for the quantum approximate optimization algorithm. Algorithms 15, 202 (2022)","journal-title":"Algorithms"},{"key":"3766_CR26","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press, Cambridge (2010)"},{"key":"3766_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41467-021-27045-6","volume":"12","author":"S Wang","year":"2021","unstructured":"Wang, S., Fontana, E., Cerezo, M., Sharma, K., Sone, A., Cincio, L., Coles, P.J.: Noise-induced barren plateaus in variational quantum algorithms. Nat. Commun. 12, 1 (2021)","journal-title":"Nat. Commun."},{"key":"3766_CR28","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-94-015-8330-5_4","volume-title":"Advances in Optimization and Numerical Analysis","author":"MJ Powell","year":"1994","unstructured":"Powell, M.J.: A direct search optimization method that models the objective and constraint functions by linear interpolation. In: Gomez, S., Hennart, J.-P. (eds.) Advances in Optimization and Numerical Analysis, pp. 51\u201367. Springer, Dordrecht (1994)"},{"key":"3766_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TQE.2020.3041479","volume":"1","author":"CS Mukherjee","year":"2020","unstructured":"Mukherjee, C.S., Maitra, S., Gaurav, V., Roy, D.: Preparing Dicke states on a quantum computer. IEEE Trans. Quantum Eng. 1, 1 (2020)","journal-title":"IEEE Trans. Quantum Eng."}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-022-03766-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-022-03766-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-022-03766-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T06:14:38Z","timestamp":1676528078000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-022-03766-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,16]]},"references-count":29,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,1]]}},"alternative-id":["3766"],"URL":"https:\/\/doi.org\/10.1007\/s11128-022-03766-5","relation":{},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,16]]},"assertion":[{"value":"12 September 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"25"}}