Learning to Optimize Variational Quantum Circuits to Solve Combinatorial Problems

by   Sami Khairy, et al.

Quantum computing is a computational paradigm with the potential to outperform classical methods for a variety of problems. Proposed recently, the Quantum Approximate Optimization Algorithm (QAOA) is considered as one of the leading candidates for demonstrating quantum advantage in the near term. QAOA is a variational hybrid quantum-classical algorithm for approximately solving combinatorial optimization problems. The quality of the solution obtained by QAOA for a given problem instance depends on the performance of the classical optimizer used to optimize the variational parameters. In this paper, we formulate the problem of finding optimal QAOA parameters as a learning task in which the knowledge gained from solving training instances can be leveraged to find high-quality solutions for unseen test instances. To this end, we develop two machine-learning-based approaches. Our first approach adopts a reinforcement learning (RL) framework to learn a policy network to optimize QAOA circuits. Our second approach adopts a kernel density estimation (KDE) technique to learn a generative model of optimal QAOA parameters. In both approaches, the training procedure is performed on small-sized problem instances that can be simulated on a classical computer; yet the learned RL policy and the generative model can be used to efficiently solve larger problems. Extensive simulations using the IBM Qiskit Aer quantum circuit simulator demonstrate that our proposed RL- and KDE-based approaches reduce the optimality gap by factors up to 30.15 when compared with other commonly used off-the-shelf optimizers.


page 1

page 2

page 3

page 4


Reinforcement-Learning-Based Variational Quantum Circuits Optimization for Combinatorial Problems

Quantum computing exploits basic quantum phenomena such as state superpo...

Sub-universal variational circuits for combinatorial optimization problems

Quantum variational circuits have gained significant attention due to th...

Reinforcement Learning Assisted Recursive QAOA

Variational quantum algorithms such as the Quantum Approximation Optimiz...

Accelerating Quantum Approximate Optimization Algorithm using Machine Learning

We propose a machine learning based approach to accelerate quantum appro...

Hard instance learning for quantum adiabatic prime factorization

Prime factorization is a difficult problem with classical computing, who...

Equivariant quantum circuits for learning on weighted graphs

Variational quantum algorithms are the leading candidate for near-term a...

Track-Assignment Detailed Routing Using Attention-based Policy Model With Supervision

Detailed routing is one of the most critical steps in analog circuit des...

Please sign up or login with your details

Forgot password? Click here to reset