Quantum annealing for combinatorial clustering

DOI10.1007/s11128-017-1809-2zbMath1400.81071arXiv1708.05753OpenAlexW2750232680MaRDI QIDQ1617211

Joseph III Dulny, Casey Tomlin, Vaibhaw Kumar, Gideon Bass

Publication date: 7 November 2018

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

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

zbMATH Keywords

clusteringmachine learning\(k\)-meansquantum annealing

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Quantum computation (81P68) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (5)

Applications and Computational Advances for Solving the QUBO Model ⋮ Balanced \(k\)-means clustering on an adiabatic quantum computer ⋮ Spiking neural network dynamic system modeling for computation of quantum annealing and its convergence analysis ⋮ Adiabatic quantum algorithm for multijet clustering in high energy physics ⋮ Clustering by quantum annealing on the three-level quantum elements qutrits

Uses Software

• Scikit
• AS 136

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Algorithm AS 136: A K-Means Clustering Algorithm
• Efficient algorithms for divisive hierarchical clustering with the diameter criterion
• The Euclidean traveling salesman problem is NP-complete
• A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version.
• Very fast simulated re-annealing
• Hierarchical clustering schemes
• Beitrag zur Theorie des Ferromagnetismus
• Optimization using quantum mechanics: quantum annealing through adiabatic evolution
• The elements of statistical learning. Data mining, inference, and prediction

This page was built for publication: Quantum annealing for combinatorial clustering