© 2026 Aqora Quantum S.A.S.

Terms Privacy Legal Notice

arXiv:1903.08256 · Advances in intelligent systems and computing

A Quantum Annealing-Based Approach to Extreme Clustering

Tim Jaschek, Marko Bucyk, Jaspreet S. Oberoi

Published Jan 1, 2020• 5 citations

DOI: 10.1007/978-3-030-39442-4_15

Related papers

Quantum annealing for combinatorial clustering

Vaibhaw Kumar, Gideon Bass, Casey Tomlin +1 more

arXiv:1708.05753•Quantum Information Processing•Jan 12, 2018•106 citations

Quantum-Enhanced Consensus Clustering Through Quantum Annealing and QAOA

Daniele Franch, Rui Wang, Amer Delilbasic +2 more

Communications in computer and information science•Jan 1, 2026•0 citations

Quantum annealing for Dirichlet process mixture models with applications to network clustering

Issei Sato, Shu Tanaka, Kenichi Kurihara +2 more

arXiv:1305.4325•Neurocomputing•Jun 19, 2013•12 citations

Clustering by quantum annealing on the three-level quantum elements qutrits

V. E. Zobov, I. S. Pichkovskiy

Quantum Information Processing•Apr 1, 2022•5 citations

Quantum Annealing for Clustering

Kenichi Kurihara, Shu Tanaka, Seiji Miyashita

This paper studies quantum annealing (QA) for clustering, which can be seen as an extension of simulated annealing (SA). We derive a QA algorithm for clustering and propose an annealing schedule, which is crucial in practice. Experiments show the proposed QA algorithm finds better clustering assignments than SA. Furthermore, QA is as easy as SA to implement.

arXiv:1408.2035•Aug 9, 2014•13 citations

Quantum Annealing for Clustering

Kenichi Kurihara, Shu Tanaka, Seiji Miyashita

This paper studies quantum annealing (QA) for clustering, which can be seen as an extension of simulated annealing (SA). We derive a QA algorithm for clustering and propose an annealing schedule, which is crucial in practice. Experiments show the proposed QA algorithm finds better clustering assignments than SA. Furthermore, QA is as easy as SA to implement.

arXiv:0905.3527•May 21, 2009•9 citations