A competitive NISQ and qubit-efficient solver for the LABS problem (2506.17391v1)

Abstract: Pauli Correlation Encoding (PCE) has recently been introduced as a qubit-efficient approach to combinatorial optimization problems within variational quantum algorithms (VQAs). The method offers a polynomial reduction in qubit count and a super-polynomial suppression of barren plateaus. Moreover, it has been shown to feature a competitive performance with classical state-of-the-art methods on MaxCut. Here, we extend the PCE-based framework to solve the Low Autocorrelation Binary Sequences (LABS) problem. This is a notoriously hard problem with a single instance per problem size, considered a major benchmark for classical and quantum solvers. We simulate our PCE variational quantum solver for LABS instances of up to $N=44$ binary variables using only $n=6$ qubits and a brickwork circuit Ansatz of depth $10$, with a total of $30$ two-qubit gates, i.e. well inside the NISQ regime. We observe a significant scaling advantage in the total time to (the exact) solution of our solver with respect to previous studies using QAOA, and even a modest advantage with respect to the leading classical heuristic, given by Tabu search. Our findings point at PCE-based solvers as a promising quantum-inspired classical heuristic for hard-in-practice problems as well as a tool to reduce the resource requirements for actual quantum algorithms, with both fundamental and applied potential implications.