Communications of the ACM
Computational geometry: an introduction
Computational geometry: an introduction
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Strengths and Weaknesses of Quantum Computing
SIAM Journal on Computing
Communication complexity
A framework for fast quantum mechanical algorithms
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The quantum query complexity of approximating the median and related statistics
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
An efficient algorithm for the three-dimensional diameter problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
LOF: identifying density-based local outliers
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Multidimensional binary search trees used for associative searching
Communications of the ACM
Sublinear time approximate clustering
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Quantum computation and quantum information
Quantum computation and quantum information
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On computing the diameter of a point set in high dimensional Euclidean space
Theoretical Computer Science
Quantum communication and complexity
Theoretical Computer Science - Natural computing
Machine Learning
Machine Learning
Fast Outlier Detection in High Dimensional Spaces
PKDD '02 Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery
Quantum Entanglement and the Communication Complexity of the Inner Product Function
QCQC '98 Selected papers from the First NASA International Conference on Quantum Computing and Quantum Communications
Separating Quantum and Classical Learning
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
On Clustering Using Random Walks
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
An Exact Quantum Polynomial-Time Algorithm for Simon's Problem
ISTCS '97 Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97)
Quantum optimization for training support vector machines
Neural Networks - 2003 Special issue: Advances in neural networks research — IJCNN'03
On-Line Unsupervised Outlier Detection Using Finite Mixtures with Discounting Learning Algorithms
Data Mining and Knowledge Discovery
Quantum Speed-Up of Markov Chain Based Algorithms
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Performance guarantees for hierarchical clustering
Journal of Computer and System Sciences - Special issue on COLT 2002
Data Mining: Practical Machine Learning Tools and Techniques, Second Edition (Morgan Kaufmann Series in Data Management Systems)
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Proceedings of the 24th international conference on Machine learning
Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
IEEE Transactions on Computers
An Empirical Comparison of Exact Nearest Neighbour Algorithms
PKDD 2007 Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases
Parallelizing quantum circuits
Theoretical Computer Science
Logical reversibility of computation
IBM Journal of Research and Development
Quantum walk based search algorithms
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
A hybrid classical-quantum clustering algorithm based on quantum walks
Quantum Information Processing
Quantum reinforcement learning
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part II
Machine learning in a quantum world
AI'06 Proceedings of the 19th international conference on Advances in Artificial Intelligence: Canadian Society for Computational Studies of Intelligence
Least squares quantization in PCM
IEEE Transactions on Information Theory
Quantum decision tree classifier
Quantum Information Processing
| Hi-index | 0.00 |
We show how the quantum paradigm can be used to speed up unsupervised learning algorithms. More precisely, we explain how it is possible to accelerate learning algorithms by quantizing some of their subroutines. Quantization refers to the process that partially or totally converts a classical algorithm to its quantum counterpart in order to improve performance. In particular, we give quantized versions of clustering via minimum spanning tree, divisive clustering and k-medians that are faster than their classical analogues. We also describe a distributed version of k-medians that allows the participants to save on the global communication cost of the protocol compared to the classical version. Finally, we design quantum algorithms for the construction of a neighbourhood graph, outlier detection as well as smart initialization of the cluster centres.