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.

Appears in Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence (UAI2009)

References in corpus (2)

• Quantum Annealing in the Transverse Ising Model
• Theory of Quantum Annealing of an Ising Spin Glass

Cited by in corpus (6)

• An introduction to quantum annealing
• Quantum Annealing for Dirichlet Process Mixture Models with Applications to Network Clustering
• Preparing ground states of the XXZ model using the quantum annealing with inductively coupled superconducting flux qubits
• Quantum annealing with twisted fields
• QUBO Decision Tree: Annealing Machine Extends Decision Tree Splitting
• QUBO-inspired Molecular Fingerprint for Chemical Property Prediction