Quantum Annealing for Clustering

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.

Cite

Text

Kurihara et al. "Quantum Annealing for Clustering." Conference on Uncertainty in Artificial Intelligence, 2009.

Markdown

[Kurihara et al. "Quantum Annealing for Clustering." Conference on Uncertainty in Artificial Intelligence, 2009.](https://mlanthology.org/uai/2009/kurihara2009uai-quantum/)

BibTeX

@inproceedings{kurihara2009uai-quantum,
  title     = {{Quantum Annealing for Clustering}},
  author    = {Kurihara, Kenichi and Tanaka, Shu and Miyashita, Seiji},
  booktitle = {Conference on Uncertainty in Artificial Intelligence},
  year      = {2009},
  pages     = {321-328},
  url       = {https://mlanthology.org/uai/2009/kurihara2009uai-quantum/}
}