Quantum k-means algorithm based on Manhattan distance
From MaRDI portal
Publication:2102207
DOI10.1007/S11128-021-03384-7OpenAlexW4200371990WikidataQ114849349 ScholiaQ114849349MaRDI QIDQ2102207FDOQ2102207
Authors: Zhihao Wu, Ting-Ting Song, Yanbing Zhang
Publication date: 28 November 2022
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11128-021-03384-7
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
Cited In (6)
- Quantum \(k\)-means algorithm based on trusted server in quantum cloud computing
- Balanced \(k\)-means clustering on an adiabatic quantum computer
- 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)