Quantum algorithms for similarity measurement based on Euclidean distance

DOI10.1007/S10773-020-04567-1zbMath1450.81029OpenAlexW3081324583WikidataQ114226205 ScholiaQ114226205MaRDI QIDQ2208001

Yanyan Li

Publication date: 23 October 2020

Published in: International Journal of Theoretical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10773-020-04567-1

zbMATH Keywords

quantum algorithmEuclidean distancequantum machine learningsimilarity measurement

Mathematics Subject Classification ID

Computational learning theory (68Q32) Searching and sorting (68P10) Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05) Quantum computation (81P68) Networks and circuits as models of computation; circuit complexity (68Q06)

Cites Work

• Unnamed Item
• Unnamed Item
• The quest for a quantum neural network
• Quantum algorithm for \(k\)-nearest neighbors classification based on the metric of Hamming distance
• Efficient quantum algorithms for simulating sparse Hamiltonians
• Quantum speed-up for unsupervised learning
• Quantum voting scheme based on locally indistinguishable orthogonal product states
• BQP and the polynomial hierarchy
• Quantum Random Access Memory
• Quantum circuits cannot control unknown operations
• Local Search Yields Approximation Schemes for $k$-Means and $k$-Median in Euclidean and Minor-Free Metrics
• Better Guarantees for $k$-Means and Euclidean $k$-Median by Primal-Dual Algorithms
• Quantum discriminant analysis for dimensionality reduction and classification

This page was built for publication: Quantum algorithms for similarity measurement based on Euclidean distance