Unsupervised strategies for identifying optimal parameters in Quantum Approximate Optimization Algorithm
Abstract
Abstract As combinatorial optimization is one of the main quantum computing applications, many methods based on parameterized quantum circuits are being developed. In general, a set of parameters are being tweaked to optimize a cost function out of the quantum circuit output. One of these algorithms, the Quantum Approximate Optimization Algorithm stands out as a promising approach to tackle combinatorial problems, due to many interesting properties. However finding the appropriate parameters is a difficult task. Although QAOA exhibits concentration properties, they can depend on instances characteristics which may not be easy to identify, but may nonetheless offer useful information to find good parameters. In this work, we study unsupervised Machine Learning approaches for setting these parameters without optimization. We perform clustering with the angle values but also instances encodings (using instance features or the output of a variational graph autoencoder), and compare different approaches. These angle-fiding strategies can be used to reduce calls to quantum circuits when leveraging QAOA as a subroutine. We showcase them within Recursive-QAOA up to depth 3 where the number of QAOA parameters used per iteration is limited to 3, achieving a median approximation ratio of 0.94 for MaxCut over 200 Erdős-Rényi graphs. We obtain similar performances to the case where we extensively optimize the angles, hence saving numerous circuit calls.
Authors 4
-
Charles Moussa Aachen
Affiliation as printed
Leiden University
LIACS, Leiden University, Leiden, Netherlands
-
Hao Wang Aachen
Affiliation as printed
Leiden University
LIACS, Leiden University, Leiden, Netherlands
-
Thomas Bäck Aachen
Affiliation as printed
Leiden University
LIACS, Leiden University, Leiden, Netherlands
-
Vedran Dunjko Aachen
Affiliation as printed
Leiden University
LIACS, Leiden University, Leiden, Netherlands
Cited by 1 stored of 1
1 result
No patents citing this paper on Lens.org (checked 2026-10-11).
References 34
-
W6678261470details pending0citations
-
W6600234944details pending0citations
-
W3105677655details pending0citations
-
W4289125053details pending0citations
-
W4289283645details pending0citations
-
W4298109276details pending0citations
-
W3101122608details pending0citations
-
W6600336842details pending0citations
-
W6600565697details pending0citations
-
W3217508209details pending0citations
-
W4232161741details pending0citations
-
W3104824731details pending0citations
-
W3124804668details pending0citations
-
W6628759385details pending0citations