Improving the efficiency of QAOA using efficient parameter transfer initialization and targeted-single-layer regularized optimization with minimal performance degradation
Shubham Patel, Utkarsh Mishra

TL;DR
This paper enhances QAOA efficiency for MaxCut problems by combining parameter transfer initialization with targeted-single-layer optimization and regularization, achieving near-optimal results with significant speedup and reduced performance variability.
Contribution
It introduces a novel approach combining parameter transfer and targeted-single-layer optimization with regularization to improve QAOA efficiency and robustness.
Findings
Achieved 98.88% optimal performance with 8.06x speedup on unweighted graphs.
Targeted-single-layer optimization outperformed full optimization in 8.92% of cases.
Regularization reduced sub-optimal local minima from 8.92% to 3.81%.
Abstract
Quantum approximate optimization algorithm (QAOA) have promising applications in combinatorial optimization problems (COPs). We investigated the MaxCut problem in three different families of graphs using QAOA ansats with parameter transfer initialization followed by targeted single layer optimization. For 3 regular (3R), Erdos Renyi (ER), and Barabasi Albert (BA) graphs, the parameter transfer approach achieved mean approximation ratios of 0.9443 for targeted-single layer optimization as compared to 0.9551 of full optimization. It represents 98.88 percent optimal performance, with 8.06 times computational speedup in unweighted graphs. But, in weighted graph families, optimal performance is relatively low (less than 90 percent) for higher nodes graph, suggesting parameter transfer followed by targeted-single-layer optimization is not ideal for weighted graph families, however, we find…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Complexity and Algorithms in Graphs · Advanced Optimization Algorithms Research
