Accelerating Quantum Approximate Optimization Algorithm using Machine Learning
Open accessThe DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
We propose a machine learning based approach to accelerate quantum approximate optimization algorithm (QAOA) implementation which is a promising quantum-classical hybrid algorithm to prove the so-called quantum supremacy. In QAOA, a parametric quantum circuit and a classical optimizer iterates in a closed loop to solve hard combinatorial optimization problems. The performance of QAOA improves with increasing number of stages (depth) in the quantum circuit. However, two new parameters are introduced with each added stage for the classical optimizer increasing the number of optimization loop iterations. We note a correlation among parameters of the lower-depth and the higher-depth QAOA implementations and, exploit it by developing a machine learning model to predict the gate parameters close to the optimal values. As a result, the optimization loop converges in a fewer number of iterations. We choose graph MaxCut problem as a prototype to solve using QAOA. We perform a feature extraction routine using 100 different QAOA instances and develop a training data-set with 13, 860 optimal parameters. We present our analysis for 4 flavors of regression models and 4 flavors of classical optimizers. Finally, we show that the proposed approach can curtail the number of optimization iterations by on average 44.9% (up to 65.7%) from an analysis performed with 264 flavors of graphs.
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
Bollobás, B. (2001) · doi:10.1017/cbo9780511814068 · Cited by 2,639
The elements of statistical learning: Data mining, inference, and prediction
Franklin, J. (2005) · The Mathematical Intelligencer · doi:10.1007/bf02985802 · Cited by 1,400
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 4×
“The QAOA performance is known to improve with the increasing number of stages in the circuit [8], [9].”
BackgroundInfluentialQuantum Supremacy through the Quantum Approximate Optimization Algorithm
Farhi, E., & Harrow, A. W. (2016) · arXiv · doi:10.48550/arxiv.1602.07674 · Cited by 331
Performance of the Quantum Approximate Optimization Algorithm on the Maximum Cut Problem
Crooks, G. E. (2018) · arXiv · doi:10.48550/arxiv.1811.08419 · Cited by 158
Training the quantum approximate optimization algorithm without access to a quantum processing unit
Streif, M., & Leib, M. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab8c2b · Cited by 125 · cited 1×
“Thus, exploring new avenues to improve the performance of QAOA has become an exciting research domain [8]–[13].”
BackgroundQuantum Algorithms for Fixed Qubit Architectures
Farhi, E., Goldstone, J., Gutmann, S., & Neven, H. (2017) · arXiv · doi:10.48550/arxiv.1703.06199 · Cited by 93
Wecker, D., Hastings, M. B., & Troyer, M. (2016) · Physical Review A · doi:10.1103/physreva.94.022309 · Cited by 88
Optimizing quantum heuristics with meta-learning
Wilson, M., Stromswold, S., Wudarski, F., Hadfield, S., Tubman, N. M., & Rieffel, E. (2019) · arXiv · doi:10.48550/arxiv.1908.03185 · Cited by 77
Cited by
Parameter Setting in Quantum Approximate Optimization of Weighted Problems
Sureshbabu, S. H., Herman, D., Shaydulin, R., Basso, J., Chakrabarti, S., Sun, Y., & Pistoia, M. (2024) · Quantum · doi:10.22331/q-2024-01-18-1231 · Cited by 41
Quantum 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
“Similarly, patterns in the parameters have been explored during advancement to higher depths of the circuit for parameter initialization [6, 154], e.g., via different regression techniques [6].”
BackgroundMethodEnergy-Efficient Cluster Head Selection via Quantum Approximate Optimization
Choi, J., Oh, S., & Kim, J. (2020) · Electronics · doi:10.3390/electronics9101669 · Cited by 20
Metadata
- Authors
- Alam, M., Ash-Saki, A., & Ghosh, S.
- Venue
- 2020 Design, Automation & Test in Europe Conference & Exhibition (DATE)
- Publisher
- IEEE
- Published
- 2020-03
- Pages
- 686-689
- OpenAlex
- W3004676721
- Cited by
- 46
- References
- 10
- FWCI
- 2.22
- Type
- conference paper
- Language
- en
- Open access
- green
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: Accelerating Quantum Approximate Optimization Algorithm using Machine Learning. https://app.cochat.ai/papers/10.23919/date48585.2020.9116348
- The paper
- Alam, M., Ash-Saki, A., & Ghosh, S. (2020). Accelerating Quantum Approximate Optimization Algorithm using Machine Learning. 2020 Design, Automation & Test in Europe Conference & Exhibition (DATE). https://doi.org/10.23919/date48585.2020.9116348
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.