Quantum speed-up for unsupervised learning

DOI10.1007/S10994-012-5316-5MaRDI QIDQ1945031zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Esma Aïmeur, Gilles Brassard, Sébastien Gambs

Publication date 28 March 2013

Published in Machine Learning (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/s10994-012-5316-5

zbMATH Keywords

clusteringunsupervised learningquantum information processingGrover's algorithmquantum learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Quantum computation (81P68)

Recommendations

• A quantum algorithm of K-means toward practical use
• Quantum machine learning. What quantum computing means to data mining
• Quantum speedup of Bayes’ classifiers
• Quantum \(K\) nearest neighbor algorithm
• Quantum algorithm for help-training semi-supervised support vector machine

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 5485493 (Why is no real title available?)
• scientific article; zbMATH DE number 3919830 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1303550 (Why is no real title available?)
• scientific article; zbMATH DE number 1934540 (Why is no real title available?)
• scientific article; zbMATH DE number 2081091 (Why is no real title available?)
• scientific article; zbMATH DE number 1754656 (Why is no real title available?)
• scientific article; zbMATH DE number 1775388 (Why is no real title available?)
• scientific article; zbMATH DE number 2103524 (Why is no real title available?)
• scientific article; zbMATH DE number 2115029 (Why is no real title available?)
• scientific article; zbMATH DE number 847265 (Why is no real title available?)
• scientific article; zbMATH DE number 1406113 (Why is no real title available?)
• scientific article; zbMATH DE number 2200689 (Why is no real title available?)
• A hybrid classical-quantum clustering algorithm based on quantum walks
• A novel clustering algorithm based on quantum games
• A theory of the learnable
• Automata, Languages and Programming
• Clustering to minimize the maximum intercluster distance
• Communication Complexity
• Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
• Least squares quantization in PCM
• Logical Reversibility of Computation
• Multidimensional binary search trees used for associative searching
• On computing the diameter of a point set in high dimensional Euclidean space.
• Parallelizing quantum circuits
• Performance guarantees for hierarchical clustering
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
• Quantum Walk Based Search Algorithms
• Quantum communication and complexity.
• Quantum communication complexity
• Quantum pseudo-telepathy
• Quantum random access memory
• Strengths and Weaknesses of Quantum Computing
• Sublinear time approximate clustering
• The quantum query complexity of approximating the median and related statistics
• Worst-Case and Probabilistic Analysis of a Geometric Location Problem

Cited in

(33)

• Quantum algorithms for similarity measurement based on Euclidean distance
• QCF: quantum collaborative filtering recommendation algorithm
• Optimal quantum sample complexity of learning algorithms
• Quantum learning of concentrated Boolean functions
• Quantum data compression by principal component analysis
• Quantum partial search for uneven distribution of multiple target items
• Quantum-enhanced feature selection with forward selection and backward elimination
• Quantum speedup of Bayes’ classifiers
• Quantum-hybrid neural vector quantization -- a mathematical approach
• A Quantum Implementation Model for Artificial Neural Networks
• Inherently trap-free convex landscapes for fully quantum optimal control
• Demonstration of a measurement-based adaptation protocol with quantum reinforcement learning on the IBM Q experience platform
• Quantum algorithm for help-training semi-supervised support vector machine
• Quantum \(k\)-means algorithm based on trusted server in quantum cloud computing
• Quantum adiabatic machine learning
• The role of entanglement for enhancing the efficiency of quantum kernels towards classification
• Quantum algorithm for unsupervised anomaly detection
• Constructing a qubit POVM from quantum data
• Quantum support vector machine based on regularized Newton method
• Quantum decision tree classifier
• Quantum error-correcting output codes
• Quantum classifiers for domain adaptation
• Obtaining a linear combination of the principal components of a matrix on quantum computers
• Quantum computation for large-scale image classification
• The quest for a quantum neural network
• NISQ-friendly measurement-based quantum clustering algorithms
• A hybrid classical-quantum clustering algorithm based on quantum walks
• Emulation of high-performance correlation-based quantum clustering algorithm for two-dimensional data on FPGA
• Quantum speedup for pool-based active learning
• Quantum-enhanced deliberation of learning agents using trapped ions
• Efficient quantum feature extraction for CNN-based learning
• Statistical online learning in recurrent and feedforward quantum neural networks
• Quantum \(k\)-means algorithm based on Manhattan distance

Describes a project that uses

Uses Software

• LOF

This page was built for publication: Quantum speed-up for unsupervised learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1945031)