Moderate Exponential-time Quantum Dynamic Programming Across the Subsets for Scheduling Problems - Laboratoire d'Informatique Fondamentale et Appliquée de Tours Access content directly
Preprints, Working Papers, ... (Preprint) Year : 2023

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 quantumclassical methods that reduce the worst-case time complexity for several 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 (ignoring the polynomial factors) in O*(c^n) can be reduced by a hybrid algorithm to O*(c_quant^n), with c_quant < c. In this paper, we provide a bounded-error hybrid algorithm that achieves such an improvement on NP-hard minimization problems for which we give a generic description. We illustrate our approach on a variety of scheduling problems. Moreover, we extend this algorithm to decision problems 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 pseudopolynomial factor.
Fichier principal
Vignette du fichier
ModerateExpo_Grange.pdf (512.04 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04296238 , version 1 (20-11-2023)

Identifiers

  • HAL Id : hal-04296238 , version 1

Cite

Camille Grange, Michael Poss, Eric Bourreau, Vincent t'Kindt, Olivier Ploton. Moderate Exponential-time Quantum Dynamic Programming Across the Subsets for Scheduling Problems. 2023. ⟨hal-04296238⟩
71 View
24 Download

Share

Gmail Facebook X LinkedIn More