The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Benchmarking the performance of portfolio optimization with QAOA
Open accessAbstract
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 ‘easy’ and ‘hard’ instances of the portfolio optimization problem.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Figures






![Fig. 7 The approximation ratio of the investigated QAOA instance as a function of depolarizing noise strength η for different mixers using a density matrix simulator with 8192 measurement samples. The classical optimizer COBYLA [28] was used](https://figures.cochat.ai/paper-figures/140c3121521b4fceb7705a7e199f451a/benchmarking-the-performance-of-portfolio-optimization-with-qaoa-figure-7.png)


Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Coherence in Spontaneous Radiation Processes
Dicke, R. H. (1954) · Physical Review · doi:10.1103/physrev.93.99 · Cited by 7,445
Quantum Algorithm for Linear Systems of Equations
Harrow, A. W., Hassidim, A., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.150502 · Cited by 3,325
A Quantum Approximate Optimization Algorithm
Farhi, E., Goldstone, J., & Gutmann, S. (2014) · arXiv · doi:10.48550/arxiv.1411.4028 · Cited by 1,789
Powell, M. J. D. (1994) · Advances in Optimization and Numerical Analysis · doi:10.1007/978-94-015-8330-5_4 · Cited by 1,369
Zhou, L., Wang, S.-T., Choi, S., Pichler, H., & Lukin, M. D. (2020) · Physical Review X · doi:10.1103/physrevx.10.021067 · Cited by 913 · cited 6×
“Of crucial importance are the initial values of the circuit parameters γ and β fed into the classical optimization routine: similarly to [7], we perform the optimization for increasing values of the QAOA depth p, using an extrapolation method to deduce initial values from the optimized values of γ and β obtained previ…”
BackgroundMethodInfluentialNoise-induced barren plateaus in variational quantum algorithms
Wang, S., Fontana, E., Cerezo, M., Sharma, K., Sone, A., Cincio, L., & Coles, P. J. (2021) · Nature Communications · doi:10.1038/s41467-021-27045-6 · Cited by 773
From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
Hadfield, S., Wang, Z., O’Gorman, B., Rieffel, E. G., Venturelli, D., & Biswas, R. (2019) · Algorithms · doi:10.3390/a12020034 · Cited by 772
Training Variational Quantum Algorithms Is NP-Hard
Bittel, L., & Kliesch, M. (2021) · Physical Review Letters · doi:10.1103/physrevlett.127.120502 · Cited by 398 · cited 1×
“Since QAOA involves a numerical classical optimization of variational circuit parameters (which, in itself, is an NP-hard problem [5]), analytical results concerning the performance of QAOA for a large number of qubits are not available.”
BackgroundQuantum Computing for Finance: State-of-the-Art and Future Prospects
Egger, D. J., Gambella, C., Marecek, J., McFaddin, S., Mevissen, M., Raymond, R., Simonetto, A., Woerner, S., & Yndurain, E. (2020) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2020.3030314 · Cited by 366
Research works printed but not linked: 2
- Markowitz, H.: Portfolio selection. J. Finance 7, 77 (1952)
- Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press, Cambridge (2010)
Cited by
Quantum Computational Finance: Quantum Algorithm for Portfolio Optimization
Rebentrost, P., & Lloyd, S. (2024) · Künstliche Intell. · doi:10.1007/s13218-024-00870-9 · Cited by 191
Best practices for portfolio optimization by quantum computing, experimented on real quantum devices
Buonaiuto, G., Gargiulo, F., Pietro, G. D., Esposito, M., & Pota, M. (2023) · Scientific Reports · doi:10.1038/s41598-023-45392-w · Cited by 120
Naik, A. S., Yeniaras, E., Hellstern, G., Prasad, G., & Vishwakarma, S. (2025) · Financial Innovation · doi:10.1186/s40854-025-00751-6 · Cited by 82
Self-citationQuantum Optimization: Potential, Challenges, and the Path Forward
Abbas, A., (NNSA), U. N. N. S. A., Ambainis, A., Augustino, B., Bärtschi, A., Buhrman, H., Coffrin, C., Cortiana, G., Dunjko, V., Egger, D., et al. (2023) · OSTI OAI (U.S. Department of Energy Office of Scientific and Technical Information) · doi:10.2172/2229681 · Cited by 67
Alignment between initial state and mixer improves QAOA performance for constrained optimization
He, Z., Shaydulin, R., Chakrabarti, S., Herman, D., Li, C., Sun, Y., & Pistoia, M. (2023) · npj Quantum Information · doi:10.1038/s41534-023-00787-5 · Cited by 103
Metadata
- Authors
- Brandhofer, S., Braun, D., Dehn, V., Hellstern, G., Hüls, M., Ji, Y., Polian, I., Bhatia, A. S., & Wellens, T.
- Affiliations
- University of Stuttgart (DE)
- University of Tübingen (DE)
- Fraunhofer Institute for Applied Solid State Physics (DE)
- Ravensburg University of Cooperative Education (DE)
- Corresponding author
- Dehn, Vanessa
- ORCID
- Venue
- Quantum Information Processing
- Published
- 2022-12-16
- Volume
- 22
- Issue
- 1
- ISSN
- 1570-0755 (ISSN-L)
- 1573-1332
- OpenAlex
- W4313293044
- Cited by
- 106
- References
- 26
- Citations by year
- 2026: 27 · 2025: 32 · 2024: 32 · 2023: 12 · 2022: 3
- FWCI
- 6.50
- Type
- journal article
- Language
- en
- Open access
- hybrid
- doi.org
- Licence
- cc-by
- creativecommons.org/licenses/by/4.0 (tdm)
- creativecommons.org/licenses/by/4.0 (vor)
- Locations
- Quantum Information Processing (publishedVersion, cc-by)
- arXiv (Cornell University) (submittedVersion)
- Fraunhofer-Publica (Fraunhofer-Gesellschaft) (submittedVersion)
- arXiv (Cornell University) (cc-by)
- Funders
- Ministerium für Wirtschaft, Arbeit und Wohnungsbau Baden-Württemberg (QORA)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Social Sciences › Decision Sciences › Management Science and Operations Research › Risk and Portfolio Optimization
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Keywords
- portfolio optimization, quantum approximate optimization algorithm, variational formulation, parameter optimization, NISQ devices, shot noise, benchmarking
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Benchmarking the performance of portfolio optimization with QAOA. https://app.cochat.ai/papers/10.1007/s11128-022-03766-5
- The paper
- Brandhofer, S., Braun, D., Dehn, V., Hellstern, G., Hüls, M., Ji, Y., Polian, I., Bhatia, A. S., & Wellens, T. (2022). Benchmarking the performance of portfolio optimization with QAOA. Quantum Information Processing. https://doi.org/10.1007/s11128-022-03766-5
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.