CoChat

Transfer learning of optimal QAOA parameters in combinatorial optimization

Montañez-Barrera, J. A., Willsch, Dennis, Michielsen, Kristel · 2025 · Quantum Information Processing

The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.

Abstract

Solving combinatorial optimization problems (COPs) is a promising application of quantum computation, with the quantum approximate optimization algorithm (QAOA) being one of the most studied quantum algorithms for solving them. However, multiple factors make the parameter search of the QAOA a hard optimization problem. In this work, we study transfer learning (TL), a methodology to reuse pre-trained QAOA parameters of one problem instance into different COP instances. This methodology can be used to alleviate the necessity of classical optimization to find good parameters for individual problems. To this end, we select small cases of the traveling salesman problem (TSP), the bin packing problem (BPP), the knapsack problem (KP), the weighted maximum cut (MaxCut) problem, the maximal independent set (MIS) problem, and portfolio optimization (PO), and find optimal β\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\beta $$\end{document} and γ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\gamma $$\end{document} parameters for p layers. We compare how well the parameters found for one problem adapt to the others. Among the different problems, BPP is the one that produces the best transferable parameters, maintaining the probability of finding the optimal solution above a quadratic speedup over random guessing for problem sizes up to 42 qubits and p=10\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$p = 10$$\end{document} layers. Using the BPP parameters, we perform experiments on IonQ Harmony and Aria, Rigetti Aspen-M-3, and IBM Brisbane of MIS instances for up to 18 qubits. The results indicate that IonQ Aria yields the best overlap with the ideal probability distribution. Additionally, we show that cross-platform TL is possible using the D-Wave Advantage quantum annealer with the parameters found for BPP. We show an improvement in performance compared to the default protocols for MIS with up to 170 qubits. Our results suggest that there are QAOA parameters that generalize well for different COPs and annealing protocols.

Overview

Integrity signals

Registry

Crossref · 10.1007/s11128-025-04743-4

Cites

38 of 38 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 38 references

Research works printed but not linked: 6

  1. Farhi, E., Goldstone, J., Gutmann, S.: A quantum approximate optimization algorithm (2014), arXiv:1411.4028 [quant-ph] · arXiv
  2. Koßmann, G., Binkowski, L., van Luijk, L., Ziegler, T., Schwonnek, R.: Deep-circuit qaoa (2023). arXiv:2210.12406 [quant-ph] · arXiv
  3. Boulebnane, S., Montanaro, A.: Solving boolean satisfiability problems with the quantum approximate optimization algorithm (2022), arXiv:2208.06909 [quant-ph] · arXiv
  4. Wurtz, J., Lykov, D.: The fixed angle conjecture for qaoa on regular maxcut graphs (2021), arXiv:2107.00677 [quant-ph] · arXiv
  5. Powell, M.: A direct search optimization method that models the objective and constraint functions by linear interpolation. Adv. Optim. Numer. Anal. 275, 51 (1994)
  6. Cheeseman, P., Kanefsky, B., Taylor, W. M.: Where the Really Hard Problems Are, The 12nd International Joint Conference on Artificial Intelligence , 331 (1991)

Cited by

See all 19

Metadata

Authors
Montañez-Barrera, J. A., Willsch, D., & Michielsen, K.
Affiliations
Forschungszentrum Jülich (DE)
Corresponding author
Montañez-Barrera, J. A.
Venue
Quantum Information Processing
Published
2025-05-09
Volume
24
Issue
5
ISSN
  • 1570-0755 (ISSN-L)
  • 1573-1332
OpenAlex
W4410232493
Cited by
19
References
35
Citations by year
2026: 8 · 2025: 8
FWCI
6.42
Type
journal article
Language
en
Open access
closed
Licence
Locations
Quantum Information Processing (publishedVersion)
Funders
Bundesministerium für Bildung und Forschung (13N16149)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
Keywords
transfer learning, quantum approximate optimization algorithm, combinatorial optimization, bin packing, maximal independent sets, traveling salesman problem, knapsack problem, portfolio optimization, quantum annealing, D-Wave Advantage, IonQ, IBM

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: Transfer learning of optimal QAOA parameters in combinatorial optimization. https://app.cochat.ai/papers/10.1007/s11128-025-04743-4
The paper
Montañez-Barrera, J. A., Willsch, D., & Michielsen, K. (2025). Transfer learning of optimal QAOA parameters in combinatorial optimization. Quantum Information Processing. https://doi.org/10.1007/s11128-025-04743-4

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.