Quantum speed-up for unsupervised learning
type: Item
instance of: scholarly article
title: Quantum speed-up for unsupervised learning
zbMATH Open document ID: 1260.68319
author: Esma Aïmeur
author: Gilles Brassard
author: Sébastien Gambs
published in: Machine Learning
publication date: 2013-03-28T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 81P68
zbMATH DE Number: 6149273
zbMATH Keywords: unsupervised learning
zbMATH Keywords: clustering
zbMATH Keywords: quantum learning
zbMATH Keywords: quantum information processing
zbMATH Keywords: Grover's algorithm
describes a project that uses: LOF
MaRDI profile type: Publication
full work available at URL: s10994-012-5316-5
OpenAlex ID: W2031056773
Wikidata QID: Q60307406
cites work: Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
cites work: QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
cites work: Q4405998
cites work: Logical Reversibility of Computation
cites work: Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
cites work: Strengths and Weaknesses of Quantum Computing
cites work: Multidimensional binary search trees used for associative searching
cites work: Q4250174
cites work: Quantum communication complexity
cites work: Q4819589
cites work: Quantum pseudo-telepathy
cites work: Parallelizing quantum circuits
cites work: Q4939137
cites work: Q4865045
cites work: Performance guarantees for hierarchical clustering
cites work: Quantum communication and complexity.
cites work: Automata, Languages and Programming
cites work: Q4826665
cites work: On computing the diameter of a point set in high dimensional Euclidean space.
cites work: Q4198056
cites work: Quantum Random Access Memory
cites work: Clustering to minimize the maximum intercluster distance
cites work: Q4542520
cites work: Q4474204
cites work: Communication Complexity
cites work: A novel clustering algorithm based on quantum games
cites work: A hybrid classical-quantum clustering algorithm based on quantum walks
cites work: Least squares quantization in PCM
cites work: Q3549657
cites work: Sublinear time approximate clustering
cites work: The quantum query complexity of approximating the median and related statistics
cites work: Q2706552
cites work: Worst-Case and Probabilistic Analysis of a Geometric Location Problem
cites work: Q3694703
cites work: Quantum Walk Based Search Algorithms
cites work: Q4535084
cites work: Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
cites work: A theory of the learnable
cites work: Q5312442
cites work: Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
DBLP publication ID: journals/ml/AimeurBG13
DOI: 10.1007/S10994-012-5316-5
description: scientific article; zbMATH DE number 6149273