We investigate the limitations of existing quantum algorithms to solve discrete optimization problems. First, we discuss the quantum counting algorithm of Brassard et al. (1998), and show that it has performance that is equivalent to that of a brute-force approach when approximating the number...

We show that the serial SNPV and the LCFDP are equivalent. The serial SNPV is a special case of the SNPV that tries maximize the expected NPV of a project by sequencing activities that have stochastic durations and cash flows that are incurred at the start of an activity. The LCFDP, on the other...

Schrage and Baker (1978) proposed a generic dynamic programming (DP) algorithm to tackle precedenceconstrained sequencing on a single machine. The performance of their DP method, however, is limited due to excessive memory requirements, particularly when the precedence network is not very dense....