Balanced \(k\)-means clustering on an adiabatic quantum computer

DOI10.1007/s11128-021-03240-8OpenAlexW3196348232MaRDI QIDQ2685586

P. Date, Davis Arthur

Publication date: 22 February 2023

Published in: Quantum Information Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2008.04419

zbMATH Keywords

quantum computing\(k\)-means clusteringquantum machine learningbalanced clustering

Mathematics Subject Classification ID

Quantum computation (81P68)

Related Items (2)

Disturbance rejection in pattern recognition: a realization of quantum neural network ⋮ Clustering by quantum annealing on the three-level quantum elements qutrits

Uses Software

• Scikit
• AS 136
• k-means++

Cites Work

• Algorithm AS 136: A K-Means Clustering Algorithm
• Efficiently embedding QUBO problems on adiabatic quantum computers
• NP-hardness of Euclidean sum-of-squares clustering
• Constructing optimal binary decision trees is NP-complete
• Quantum annealing for combinatorial clustering
• Support vector machines on the D-wave quantum annealer
• Unnamed Item
• Unnamed Item

This page was built for publication: Balanced \(k\)-means clustering on an adiabatic quantum computer