Hybrid Quantum-Classical Multilevel Approach for Maximum Cuts on Graphs

Understand

Combinatorial optimization is one of the fields where near term quantum devices are being utilized with hybrid quantum-classical algorithms to demonstrate potentially practical applications of quantum computing.

• One of the most well studied problems in combinatorial optimization is the Max-Cut problem.
• The problem is also highly relevant to quantum and other types of "post Moore" architectures due to its similarity with the Ising model and other reasons.
• In this paper, we introduce a scalable hybrid multilevel approach to solve large instances of Max-Cut using both classical only solvers and quantum approximate optimization algorithm (QAOA).