Quantum Optimized Centroid Initialization

One of the major benefits of quantum computing is the potential to resolve complex computational problems faster than can be done by classical methods. There are many prototype-based clustering methods in use today, and the selection of the starting nodes for the center points is often done randomly. Clustering often suffers from accepting a local minima as a valid solution when there are possibly better solutions. We will present the results of a study to leverage the benefits of quantum computing for finding better starting centroids for prototype-based clustering.