Application of Grover’s Quantum Algorithm on Agent’s Scheduling Optimization Problem (Without Constraints)

Abstract

The following paper presents a curious use of Grover’s quantum algorithm to try to solve the optimization problem of agents schedulling. It begins with the statement of the schedulling problem and later it developes the algorithm in depth. Gives special attention to the process of inversion over the mean, showing explicitly the evolution of the quantumn states on every iteration of the algorithm. Finally, exposes the theoretical limits of the algorithm.