Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

ICML
2007
IEEE

favoriteEmaildiscussreport

113views Machine Learning» more ICML 2007»

Quantum clustering algorithms

14 years 5 months ago

Quantum clustering algorithms

Download www.machinelearning.org

By the term "quantization", we refer to the process of using quantum mechanics in order to improve a classical algorithm, usually by making it go faster. In this paper, we initiate the idea of quantizing clustering algorithms by using variations on a celebrated quantum algorithm due to Grover. After having introduced this novel approach to unsupervised learning, we illustrate it with a quantized version of three standard algorithms: divisive clustering, k-medians and an algorithm for the construction of a neighbourhood graph. We obtain a significant speedup compared to the classical approach.

Esma Aïmeur, Gilles Brassard, Sébastie

Real-time Traffic

Celebrated Quantum Algorithm | Classical Algorithm | Divisive Clustering | ICML 2007 | Machine Learning |

claim paper

Related Content

» Graph drawing using quantum commute time

» HumanCompetitive Evolution of Quantum Computing Artefacts by Genetic Programming

» Accelerating Quantum Monte Carlo Simulations of Real Materials on GPU Clusters

» Clustering Algorithms Optimizer A Framework for Large Datasets

» Evolving Hoggs Quantum Algorithm Using LinearTree GP

» Simulating and Compiling Code for the Sequential Quantum Random Access Machine

» Analysis and synthesis of quantum circuits by using quantum decision diagrams

» Quantum Authenticated Key Distribution

» Training a Quantum Neural Network

Post Info
More Details (n/a)

Added	17 Nov 2009
Updated	17 Nov 2009
Type	Conference
Year	2007
Where	ICML
Authors	Esma Aïmeur, Gilles Brassard, Sébastien Gambs

Comments (0)