Quantum speed-up for unsupervised learning

DOI10.1007/S10994-012-5316-5zbMath1260.68319DBLPjournals/ml/AimeurBG13OpenAlexW2031056773WikidataQ60307406 ScholiaQ60307406MaRDI QIDQ1945031

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

Publication date: 28 March 2013

Published in: Machine Learning (Search for Journal in Brave)

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)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A hybrid classical-quantum clustering algorithm based on quantum walks
• Quantum communication complexity
• Parallelizing quantum circuits
• Clustering to minimize the maximum intercluster distance
• Performance guarantees for hierarchical clustering
• Quantum communication and complexity.
• On computing the diameter of a point set in high dimensional Euclidean space.
• Quantum pseudo-telepathy
• The quantum query complexity of approximating the median and related statistics
• Quantum Random Access Memory
• Quantum Walk Based Search Algorithms
• Adiabatic Quantum Computation Is Equivalent to Standard Quantum Computation
• A novel clustering algorithm based on quantum games
• A theory of the learnable
• Worst-Case and Probabilistic Analysis of a Geometric Location Problem
• Multidimensional binary search trees used for associative searching
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Strengths and Weaknesses of Quantum Computing
• Communication via one- and two-particle operators on Einstein-Podolsky-Rosen states
• Least squares quantization in PCM
• QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
• Communication Complexity
• Automata, Languages and Programming
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
• Logical Reversibility of Computation

Related Items (32)

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

Uses Software

• LOF

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