Moderate exponential-time quantum dynamic programming across the subsets for scheduling problems

Abstract

Grover Search is currently one of the main quantum algorithms leading to hybrid quantum–classical methods that reduce the worst-case time complexity for some combinatorial optimization problems. Specifically, the combination of Quantum Minimum Finding (obtained from Grover Search) with dynamic programming has proved particularly efficient in improving the complexity of NP-hard problems currently solved by classical dynamic programming. For these problems, the classical dynamic programming complexity in $O^{\ast }\left(c^n\right)$, where $O^{\ast }$ denotes that polynomial factors are ignored, can be reduced by a hybrid algorithm to $O^{\ast }\left(c_{quant}^n\right)$, with $c_{quant}<c$. In this paper, we provide a bounded-error hybrid algorithm that achieves such an improvement for a broad class of NP-hard single-machine scheduling problems for which we give a generic description. Moreover, we extend this algorithm to tackle the 3-machine flowshop problem. Our algorithm reduces the exponential-part complexity compared to the best-known classical algorithm, sometimes at the cost of an additional pseudo-polynomial factor.