A clustering aggregation algorithm on neutral-atoms and annealing quantum processors

• Main Authors: Scotti, Riccardo, Bettonte, Gabriella, Costantini, Antonio, Marzella, Sara, Ottaviani, Daniele, Lodi, Stefano
• Format: Journal Article
• Language: English
• Published: 10.12.2024
• Subjects: Computer Science - Emerging Technologies; Computer Science - Performance; Physics - Quantum Physics
• DOI: 10.48550/arxiv.2412.07558

This work presents a hybrid quantum-classical algorithm to perform clustering aggregation, designed for neutral-atoms quantum computers and quantum annealers. Clustering aggregation is a technique that mitigates the weaknesses of clustering algorithms, an important class of data science methods for partitioning datasets, and is widely employed in many real-world applications. By expressing the clustering aggregation problem instances as a Maximum Independent Set (MIS) problem and as a Quadratic Unconstrained Binary Optimization (QUBO) problem, it was possible to solve them by leveraging the potential of Pasqal's Fresnel (neutral-atoms processor) and D-Wave's Advantage QPU (quantum annealer). Additionally, the designed clustering aggregation algorithm was first validated on a Fresnel emulator based on QuTiP and later on an emulator of the same machine based on tensor networks, provided by Pasqal. The results revealed technical limitations, such as the difficulty of adding additional constraints on the employed neutral-atoms platform and the need for better metrics to measure the quality of the produced clusterings. However, this work represents a step towards a benchmark to compare two different machines: a quantum annealer and a neutral-atom quantum computer. Moreover, findings suggest promising potential for future advancements in hybrid quantum-classical pipelines, although further improvements are needed in both quantum and classical components.