February 15, 2024
Conference Paper

Efficient QAOA Optimization using Directed Restarts and Graph Lookup


Variational Quantum Algorithms (VQA) aim to enhance the capabilities of Noisy Intermediate-Scale Quantum (NISQ) devices. These algorithms utilize parameterized circuits and classical optimizers to iteratively execute circuits with varying parameters. However, VQA faces computational overheads due to repeated iterations and random restarts. Prior work suggests using basic sub-graphs to transfer parameters for the input graph, reducing optimizer overheads but limiting applicability to structured regular graphs. In real-world applications, random irregular graphs are common, and existing methods are not scalable or practical for such graphs. This paper presents a framework that aims to improve random irregular graphs in VQA. The framework uses graph similarity and important features like total edge counts, average edge counts, and variance. It follows an iterative process to choose basis sub-graphs from a small database and adjust parameters accordingly. Classical optimizers then utilize these parameters to determine when to restart and perform gradient descent. This approach increases the chances of reaching global maximum points.

Published: February 15, 2024


Wang M., B. Fang, A. Li, and P. Nair. 2023. Efficient QAOA Optimization using Directed Restarts and Graph Lookup. In QCCC '23: Proceedings of the 2023 International Workshop on Quantum Classical Cooperative (QCCC 2023), June 20, 2023, Orlando, FL, 5–8. New York, New York:Association for Computing Machinery. PNNL-SA-189163. doi:10.1145/3588983.3596680