Recognition: unknown
Quantum Annealing for Clustering
classification
❄️ cond-mat.dis-nn
cond-mat.stat-mechcs.LGquant-ph
keywords
annealingclusteringalgorithmquantumassignmentsbettercrucialderive
read the original abstract
This paper studies quantum annealing (QA) for clustering, which can be seen as an extension of simulated annealing (SA). We derive a QA algorithm for clustering and propose an annealing schedule, which is crucial in practice. Experiments show the proposed QA algorithm finds better clustering assignments than SA. Furthermore, QA is as easy as SA to implement.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.