Quantum Annealing for Clustering

  • Kurihara K
  • Tanaka S
  • Miyashita S
  • 46


    Mendeley users who have this article in their library.
  • 2


    Citations of this article.


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.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

  • PUI: 362624604
  • arXiv: 0905.3527
  • SCOPUS: 2-s2.0-80053142047
  • SGR: 80053142047


  • Kenichi Kurihara

  • Shu Tanaka

  • Seiji Miyashita

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free