Using the Variational-Quantum-Eigensolver (VQE) to Create an Intelligent Social Workers Schedule Problem Solver

The social worker programming problem is a class of combinatorial optimization problems that can be solved in exponential time at best. Because it belongs to the class of problems known as NP-Hard, which have a great impact on our society. Today, the focus on the quantum computer should no longer be only on its enormous computing power, but also on the use of its imperfection, (it was Noisy Intermediate-Scale Quantum (NISQ)) to create a powerful machine learning device. which uses the variational principle. to solve the optimization problem by reducing its complexity class. PhD candidate Parfait Atchadé together with Prof. Dr. Elisabet Golobardes and  Prof. Dr. Xavier Vilasís (Principal Investigator of the DS4DS) propose a formulation of the Vehicle Rooting Problem (VRP) with time windows to efficiently solve the problem of social workers' schedule using Variational Quantum Eigensolver (VQE). The quantum feasibility of the algorithm will be modeled with docplex and tested on IBMQ computers.

Read more at: https://link.springer.com/chapter/10.1007/978-3-030-61705-9_21