Competitive scaling of small-subsystem-optimization heuristics for LABS

Abstract

The low autocorrelation binary sequences (LABS) problem, often formulated as a spin-lattice energy-minimization problem, is a combinatorial optimization problem with a very rugged energy landscape. We demonstrate that iterative optimization of very small subsystems of n spins that are decoupled from the rest of the system achieves global optimization of LABS with a time-to-solution scaling that is competitive with heuristics that optimize the global system of N spins directly. Our isolated-subsystem heuristic with n = 4 achieves a time scaling of O(1.333N ) on the interval N = [27, 60], while the current state-of-the-art classical and quantum scalings are respectively O(1.34N ) and O(1.21N ). Our results suggest that specialized optimization hardware with only small numbers of logical spins may be of practical relevance.