Qudit-based scalable quantum algorithm for solving the integer programming problem
The work proposes a scalable quantum algorithm using qudits to solve integer programming problems exponentially faster than classical methods. It uses two stages: first, an entangled constraint satisfaction mechanism via a distillation function to isolate feasible solutions; second, Grover's amplitude amplification combined with Quantum Phase Estimation (QPE) to find the optimal cost function value. This provides a provable speedup for complex optimization tasks.