Qudit-based scalable quantum algorithm for solving the integer programming problem

Abstract

Integer programming (IP) is an NP-hard combinatorial optimization problem that is widely used to represent a diverse set of real-world problems spanning multiple fields, such as finance, engineering, logistics, and operations research. It is a hard problem to solve using classical algorithms, as its complexity increases exponentially with problem size. Most quantum algorithms for solving IP are highly resource inefficient because they encode integers into qubits. In [1], the issue of resource inefficiency was addressed by mapping integer variables to qudits. However, [1] has limited practical value due to a lack of scalability to multiple qudits to encode larger problems. In this work, by extending upon the ideas of [1], a circuit-based scalable quantum algorithm is presented using multiple interacting qudits for which we show a quantum speed-up. The quantum algorithm consists of a distillation function that efficiently separates the feasible from the infeasible regions, a phase-amplitude encoding for the cost function, and a quantum phase estimation coupled with a multi-controlled single-qubit rotation for optimization. We prove that the optimal solution has the maximum probability of being measured in our algorithm. The time complexity for the quantum algorithm is shown to be $O(d^{n/2} + m\cdot n^2\cdot \log{d} + n/\epsilon_{QPE})$ for a problem with the number of variables $n$ taking $d$ integer values, satisfying $m$ constraints with a precision of $\epsilon_{QPE}$. Compared to the classical time complexity of brute force $O(d^n)$ and the best classical exact algorithm $O((\log{n})^{3n})$, it incurs a reduction of $d^{n/2}$ in the time complexity in terms of $n$ for solving a general polynomial IP problem.