Unsupervised strategies for identifying optimal parameters in Quantum Approximate Optimization Algorithm

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 tackling combinatorial problems. However, finding the appropriate parameters is a difficult task. Although QAOA exhibits concentration properties, they can depend on instances characteristics that 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-finding 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.

arXiv commentSecond version after publishing in journal

References in corpus (8)

• Quantum Computing in the NISQ era and beyond
• Parameterized quantum circuits as machine learning models
• Quantum optimization using variational algorithms on near-term quantum devices
• Quantum Supremacy through the Quantum Approximate Optimization Algorithm
• Parameter Concentration in Quantum Approximate Optimization
• Learning to Optimize Variational Quantum Circuits to Solve Combinatorial Problems
• To quantum or not to quantum: towards algorithm selection in near-term quantum optimization
• Tabu-driven Quantum Neighborhood Samplers

Cited by in corpus (5)

• Reinforcement Learning Assisted Recursive QAOA
• The Quantum Alternating Operator Ansatz for Satisfiability Problems
• Hyperparameter Importance of Quantum Neural Networks Across Small Datasets
• Quantum Approximate Optimization Algorithm Parameter Prediction Using a Convolutional Neural Network
• Resource frugal optimizer for quantum machine learning