Quantum and classical correlations in shrinking algorithms for optimization

TL;DR

This paper investigates recursive shrinking algorithms for combinatorial optimization, comparing quantum and classical correlation methods, and finds classical LP and SDP relaxations often outperform quantum approaches in MaxCut problems.

Contribution

It introduces and analyzes a recursive shrinking algorithm that leverages quantum and classical correlations, benchmarking their effectiveness on MaxCut instances.

Findings

LP outperforms others on low-density graphs

SDP is best for high-density graphs

Deeper QAOA circuits improve quantum correlation performance

Abstract

Understanding the benefits of quantum computing for solving combinatorial optimization problems (COPs) remains an open research question. In this work, we extend and analyze algorithms that solve COPs by recursively shrinking them. The algorithms leverage correlations between variables extracted from quantum or classical subroutines to recursively simplify the problem. We compare the performance of the algorithms equipped with correlations from the quantum approximate optimization algorithm (QAOA) as well as the classical linear programming (LP) and semi-definite programming (SDP) relaxations. This allows us to benchmark the utility of QAOA correlations against established classical relaxation algorithms. We apply the recursive algorithm to MaxCut problem instances with up to a hundred vertices at different graph densities. Our results indicate that LP outperforms all other approaches for low-density instances, while SDP excels for high-density problems. Moreover, the shrinking algorithm proves to be a viable alternative to established methods of rounding LP and SDP relaxations. In addition, the recursive shrinking algorithm outperforms its bare counterparts for all three types of correlations, i.e., LP with spanning tree rounding, the Goemans-Williamson algorithm, and conventional QAOA. While the lowest depth QAOA consistently yields worse results than the SDP, our tensor network experiments show that the performance increases significantly for deeper QAOA circuits.