Branch-and-bound digitized counterdiabatic quantum optimization

Anton Simen, Sebastián V. Romero, Alejandro Gomez Cadavid +2

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 s…