Bridging Classical and Quantum with SDP initialized warm-starts for QAOA
Open accessThe DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Abstract
We study the Quantum Approximate Optimization Algorithm (QAOA) in the context of the Max-Cut problem. Noisy quantum devices are only able to accurately execute QAOA at low circuit depths, while classically-challenging problem instances may call for a relatively high circuit-depth. This is due to the need to build correlations between reachable pairs of vertices in potentially large graphs [16]. To enhance the solving power of low-depth QAOA, we introduce a classical pre-processing step that initializes QAOA with a biased superposition of possible cuts in the graph, referred to as a warm-start. In particular, we initialize QAOA with a solution to a low-rank semidefinite programming relaxation of the Max-Cut problem. Our experimental results show that this variant of QAOA, called QAOA-warm, is able to outperform standard QAOA on lower circuit depths in solution quality and training time. While this improvement is partly due to the classical warm-start, we find strong evidence of further improvement using QAOA circuit at small depth. We provide experimental evidence of improved performance as well as theoretical properties of the proposed framework.
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
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
Quantum Computing in the NISQ era and beyond
Preskill, J. (2018) · Quantum · doi:10.22331/q-2018-08-06-79 · Cited by 8,830
Exploring Network Structure, Dynamics, and Function Using NetworkX
Hagberg, A. A., Schult, D. A., & Swart, P. J. (2008) · Proceedings of the Python in Science Conference · doi:10.25080/tcwv9851 · Cited by 7,477 · cited 3×
“The remaining instances were generated using various random graph generators found in the NetworkX package [40]; the parameter names used below are the same as those used in the corresponding NetworkX functions .”
MethodInfluentialGoemans, M. X., & Williamson, D. P. (1995) · Journal of the ACM · doi:10.1145/227683.227684 · Cited by 3,587 · cited 11×
“7 To map this high dimensional solution to a cut in the graph, the GW algorithm considers a random hyperplane through the origin to partition the vertices into two sets according to which side of the hyperplane they lie on; Goemans and Williamson [7] showed that this choice of rounding yields a 0.878-approximation to…”
BackgroundMethodInfluentialSome optimal inapproximability results
Håstad, J. (2001) · Journal of the ACM · doi:10.1145/502090.502098 · Cited by 1,902
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 2×
“14 Due to the symmetries in the QAOA circuit for unit-weight graphs, we know that it suffices to check the values of Fp(γ, β) for (γ, β) in [−π, π]× [−π/4, π/4] [17].”
MethodQuantum approximate optimization algorithm for MaxCut: A fermionic view
Wang, Z., Hadfield, S., Jiang, Z., & Rieffel, E. G. (2018) · Physical Review A · doi:10.1103/physreva.97.022304 · Cited by 353
Obstacles to State Preparation and Variational Optimization from Symmetry Protection
Bravyi, S., Kliesch, A., Koenig, R., & Tang, E. (2019) · arXiv · doi:10.48550/arxiv.1910.08980 · Cited by 279
Obstacles to Variational Quantum Optimization from Symmetry Protection
Bravyi, S., Kliesch, A., Koenig, R., & Tang, E. (2020) · Physical Review Letters · doi:10.1103/physrevlett.125.260505 · Cited by 278
Warm-starting quantum optimization
Egger, D. J., Mareček, J., & Woerner, S. (2021) · Quantum · doi:10.22331/q-2021-06-17-479 · Cited by 269 · cited 4×
“[15] modify the mixer so that the warm start is the lowest energy eigenstate, while we maintain the standard mixer in this work.”
BackgroundMethodInfluential
Cited by
Warm-starting quantum optimization
Egger, D. J., Mareček, J., & Woerner, S. (2021) · Quantum · doi:10.22331/q-2021-06-17-479 · Cited by 269
“, based on polynomially-solvable special cases [62, 63], where one could for example consider low-rank approximations of Σ or the SDP [96] as well as analysis of the convergence properties when using a modified mixer that does not have the initial state as eigenstate.”
MethodChallenges and opportunities in quantum optimization
Abbas, A., Ambainis, A., Augustino, B., Bärtschi, A., Buhrman, H., Coffrin, C., Cortiana, G., Dunjko, V., Egger, D. J., Elmegreen, B. G., et al. (2024) · Nature Reviews Physics · doi:10.1038/s42254-024-00770-9 · Cited by 201
“Some variants adjust the QAOA to warm-start it from solutions obtained by classical algorithms, for example, by leveraging classical SDP relaxations and adjusting the QAOA mixers 54,55 .”
Self-citationQuantum Algorithms for Mixed Binary Optimization Applied to Transaction Settlement
Braine, L., Egger, D. J., Glick, J., & Woerner, S. (2021) · IEEE Transactions on Quantum Engineering · doi:10.1109/tqe.2021.3063635 · Cited by 51
“In doing so, the quantum algorithm inherits the performance guarantee of the classical algorithm, as shown for QUBO problems [15], [16].”
MethodQuantum Combinatorial Optimization in the NISQ Era: A Systematic Mapping Study
Gemeinhardt, F., Garmendia, A., Wimmer, M., Weder, B., & Leymann, F. (2024) · ACM Computing Surveys · doi:10.1145/3620668 · Cited by 22
“Concerning the former, a preconditioning of the quantum algorithm for VQAs is provided by warm-starting with classical solvers for relaxed CO problems [42], e.g., an SDP solver [137].”
BackgroundMethodTransfer learning of optimal QAOA parameters in combinatorial optimization
Montañez-Barrera, J. A., Willsch, D., & Michielsen, K. (2025) · Quantum Information Processing · doi:10.1007/s11128-025-04743-4 · Cited by 19
Metadata
- Authors
- Tate, R., Farhadi, M., Herold, C., Mohler, G., & Gupta, S.
- Venue
- ACM Transactions on Quantum Computing
- Published
- 2023-02-24
- Volume
- 4
- Issue
- 2
- Pages
- 1-39
- ISSN
- 2643-6809 (ISSN-L)
- 2643-6817
- OpenAlex
- W3097920226
- Cited by
- 57
- References
- 15
- FWCI
- 3.80
- Type
- journal article
- Language
- en
- Open access
- hybrid
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: Bridging Classical and Quantum with SDP initialized warm-starts for QAOA. https://app.cochat.ai/papers/10.1145/3549554
- The paper
- Tate, R., Farhadi, M., Herold, C., Mohler, G., & Gupta, S. (2023). Bridging Classical and Quantum with SDP initialized warm-starts for QAOA. ACM Transactions on Quantum Computing. https://doi.org/10.1145/3549554
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.