Variational Quantum and Quantum-Inspired Clustering
Abstract: Here we present a quantum algorithm for clustering data based on a variational quantum circuit. The algorithm allows to classify data into many clusters, and can easily be implemented in few-qubit Noisy Intermediate-Scale Quantum (NISQ) devices. The idea of the algorithm relies on reducing the clustering problem to an optimization, and then solving it via a Variational Quantum Eigensolver (VQE) combined with non-orthogonal qubit states. In practice, the method uses maximally-orthogonal states of the target Hilbert space instead of the usual computational basis, allowing for a large number of clusters to be considered even with few qubits. We benchmark the algorithm with numerical simulations using real datasets, showing excellent performance even with one single qubit. Moreover, a tensor network simulation of the algorithm implements, by construction, a quantum-inspired clustering algorithm that can run on current classical hardware.
- R. Orús, Annals of Physics 349, 117 (2014).
- R. Orús, Nature Reviews Physics 1, 538 (2019).
- UCI Machine Learning Repository: Iris data set .
- D. Horn and A. Gottlieb, Phys. Rev. Lett. 88, 018702 (2001).
- A. Poggiali, A. Berti, A. Bernasconi, G. M. D. Corso, and R. Guidotti, “Quantum clustering with k-means: a hybrid approach,” (2022), arXiv:2212.06691 [quant-ph] .
- S. Patil, S. Banerjee, and P. K. Panigrahi, “Measurement-based quantum clustering algorithms,” (2023), arXiv:2302.00566 [quant-ph] .
Paper Prompts
Sign up for free to create and run prompts on this paper.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.