Classically-Boosted Quantum Optimization Algorithm

Understand

Considerable effort has been made recently in the development of heuristic quantum algorithms for solving combinatorial optimization problems.

• Meanwhile, these problems have been studied extensively in classical computing for decades.
• In this paper, we explore a natural approach to leveraging existing classical techniques to enhance quantum optimization.
• Specifically, we run a classical algorithm to find an approximate solution and then use a quantum circuit to search its "neighborhood" for higher-quality solutions.