Branch-and-bound digitized counterdiabatic quantum optimization (2504.15367v1)

Abstract: Branch-and-bound algorithms effectively solve combinatorial optimization problems, relying on the relaxation of the objective function to obtain tight lower bounds. While this is straightforward for convex objective functions, higher-order formulations pose challenges due to their inherent non-convexity. In this work, we propose branch-and-bound digitized counterdiabatic quantum optimization (BB-DCQO), a quantum algorithm that addresses the relaxation difficulties in higher-order unconstrained binary optimization (HUBO) problems. By employing bias fields as approximate solutions to the relaxed problem, we iteratively enhance the quality of the results compared to the bare bias-field digitized counterdiabatic quantum optimization (BF-DCQO) algorithm. We refer to this enhanced method as BBB-DCQO. In order to benchmark it against simulated annealing (SA), we apply it on sparse HUBO instances with up to $156$ qubits using tensor network simulations. To explore regimes that are less tractable for classical simulations, we experimentally apply BBB-DCQO to denser problems using up to 100 qubits on IBM quantum hardware. We compare our results with SA and a greedy-tuned quantum annealing baseline. In both simulations and experiments, BBB-DCQO consistently achieved higher-quality solutions with significantly reduced computational overhead, showcasing the effectiveness of integrating counterdiabatic quantum methods into branch-and-bound to address hard non-convex optimization tasks.