Quantum Annealing for Clustering

08/09/2014
by   Kenichi Kurihara, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/19/2013

Quantum Annealing for Dirichlet Process Mixture Models with Applications to Network Clustering

We developed a new quantum annealing (QA) algorithm for Dirichlet proces...
research
04/30/2021

Continuous black-box optimization with quantum annealing and random subspace coding

A black-box optimization algorithm such as Bayesian optimization finds e...
research
01/10/2023

Towards Quantum Annealing for Multi-user NOMA-based Networks

Quantum Annealing (QA) uses quantum fluctuations to search for a global ...
research
01/02/2023

Quantum Annealing vs. QAOA: 127 Qubit Higher-Order Ising Problems on NISQ Computers

Quantum annealing (QA) and Quantum Alternating Operator Ansatz (QAOA) ar...
research
09/07/2010

Optimizing an Organized Modularity Measure for Topographic Graph Clustering: a Deterministic Annealing Approach

This paper proposes an organized generalization of Newman and Girvan's m...
research
12/17/2004

Clustering Techniques for Marbles Classification

Automatic marbles classification based on their visual appearance is an ...
research
09/03/2021

High-quality Thermal Gibbs Sampling with Quantum Annealing Hardware

Quantum Annealing (QA) was originally intended for accelerating the solu...

Please sign up or login with your details

Forgot password? Click here to reset