Quantum k-means algorithm based on Manhattan distance
From MaRDI portal
Publication:2102207
Recommendations
- A quantum algorithm of K-means toward practical use
- Quantum \(K\)-nearest neighbor classification algorithm based on Hamming distance
- Quantum algorithm for \(k\)-nearest neighbors classification based on the metric of Hamming distance
- Quantum \(k\)-means algorithm based on trusted server in quantum cloud computing
- Quantum K nearest neighbor algorithm
Cites work
- scientific article; zbMATH DE number 1579275 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 2103524 (Why is no real title available?)
- Quantum Computing
- Quantum algorithm for \(k\)-nearest neighbors classification based on the metric of Hamming distance
- Quantum recommendation systems
- Quantum speed-up for unsupervised learning
Cited in
(8)- Quantum algorithms for similarity measurement based on Euclidean distance
- Quantum \(k\)-means algorithm based on trusted server in quantum cloud computing
- Balanced \(k\)-means clustering on an adiabatic quantum computer
- A study and analysis of a discrete quantum walk-based hybrid clustering approach using d-regular bipartite graph and 1D lattice
- Quantum clustering with \(k\)-means: a hybrid approach
- Quantum state clustering algorithm based on variational quantum circuit
- Quantum mean centering for block-encoding-based quantum algorithm
- A quantum algorithm of K-means toward practical use
This page was built for publication: Quantum \(k\)-means algorithm based on Manhattan distance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102207)
