Quantum clustering with k-means: a hybrid approach
From MaRDI portal
Publication:6190010
DOI10.1016/J.TCS.2024.114466arXiv2212.06691MaRDI QIDQ6190010FDOQ6190010
Alessandro Berti, Alessandro Poggiali, Gianna M. Del Corso, Riccardo Guidotti, A. Bernasconi
Publication date: 5 March 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Abstract: Quantum computing is a promising paradigm based on quantum theory for performing fast computations. Quantum algorithms are expected to surpass their classical counterparts in terms of computational complexity for certain tasks, including machine learning. In this paper, we design, implement, and evaluate three hybrid quantum k-Means algorithms, exploiting different degree of parallelism. Indeed, each algorithm incrementally leverages quantum parallelism to reduce the complexity of the cluster assignment step up to a constant cost. In particular, we exploit quantum phenomena to speed up the computation of distances. The core idea is that the computation of distances between records and centroids can be executed simultaneously, thus saving time, especially for big datasets. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version, still obtaining comparable clustering results.
Full work available at URL: https://arxiv.org/abs/2212.06691
Cites Work
- Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Quantum Computation and Quantum Information
- Supervised learning with quantum computers
- Quantum \(k\)-means algorithm based on Manhattan distance
- Quantum \(k\)-means algorithm based on trusted server in quantum cloud computing
- Circuit-Based Quantum Random Access Memory for Classical Data With Continuous Amplitudes
Cited In (1)
This page was built for publication: Quantum clustering with \(k\)-means: a hybrid approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6190010)
