Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Procedia Computer Science

Harmonic mean similarity based quantum annealing for k-means

Jo Takano, Toshiaki Omori

Published Jan 1, 2018• 3 citations
Publisher

Abstract

Clustering is an important machine learning approach in analyzing big data. In this study, we propose a clustering method using quantum annealing (QA) based on harmonic average of purity and inverse purity. By using harmonic average of purity and inverse purity, we introduce the effect of quantum noise for clustering algorithm while considering both quality of clusters and quality of categories. Using benchmark data, we show the effectiveness of the proposed QA clustering based on the harmonic average of purity and inverse purity.

DOI
10.1016/j.procs.2018.10.531

Related papers

Quantum Supervised Clustering Algorithm for Big Data

Arit Kumar Bishwas, Ashish Mani, Vasile Palade

Supervised clustering is the process of grouping unlabeled objects by using some specific objectives and any supervised learning technique. In traditional clustering algorithms, the similarity measure is based on some distance finding formulations. In supervised clustering, this similarity measure is trained with the help of asupervised learning method. In this paper, we have designed a quantum supervised clustering algorithm and analyzed the overall runtime complexity of the algorithm. In our approach, we have trained the similarity measure model with quantum support vector machine. This quantum mechanically trained similarity measure model is used in the quantum K-Means algorithm, instead of the traditional distance-based similarity measure functions, for clustering unlabeled objects. Our analysis demonstrates that the proposed approach exhibits exponential speed up when compared to the classical implementation.

IEEE International Conference for Convergence in Technology (I2CT)•Apr 1, 2018•3 citations

Quantum recurrent-assisted adaptive K-harmonic means clustering approach for classification task

Kondragunta Rama Krishnaiah, Ramesh Mande, Anjaneyulu Nelluru +3 more

The rapid growth of data and the collective complexity of high-dimensional classification issues have pushed traditional computer technologies to their limits. However, quantum computing has emerged as a possible paradigm to address these difficulties. In this study, a novel quantum machine learning procedure for classification tasks is proposed. The research is separated into three phases: Pre-processing, clustering and classification. Initially, collect the data from the dataset and perform pre-processing using min-max normalization. Clustering and classification methods are essential constituents of this research because they enable the efficient organization and interpretation of complex datasets related to power generation and other features. Novel clustering methods are used to group similar data points based on their characteristics without requiring labelled data. This clustering approach has been performed by quantum assisted adaptive k-harmonic means (Quant-AdKharmonic) algorithm, which can group similar data effectively. After a clustering approach-based label creation, the classifier model, namely Entanglement-Variational Quantum Recurrent Classifier, is used for the classification task (En-VarQuantum). The integration of both models has handled noisy data for better power prediction and analysis. The performance of the suggested model is assessed employing two datasets: TWTDUS and SDWTT18. Thus, the findings of the TWTDUS dataset, utilizing clustering and classification methods, achieve the highest accuracy of 97.18%. Similarly, for the SDWTT18 dataset, the proposed method achieves an accuracy of 98.17%.

International Journal of Quantum Information•Mar 6, 2026•0 citations

Research and evaluation of underwater acoustic signal classification capability using quantum K-mean algorithm on real dataset

Bach Nhat Hoang, Dang Tien Sy, Doan Trung Thanh +1 more

In the big data era, traditional machine learning algorithms like K-means face computational challenges in processing large, high-dimensional datasets, particularly for underwater acoustic signal classification. This study investigates the application of the quantum clustering algorithm Q-means, a quantum-enhanced variant of K-means, to real passive sonar datasets. The purpose is to evaluate Q-means' effectiveness in classifying propeller-driven ship signals under noisy conditions, leveraging quantum principles such as superposition and entanglement for exponential speedup. The research extends classical K-means to δ-k-means for robustness, implementing quantum subroutines including distance estimation, cluster assignment, and state tomography. Preprocessed features from power spectral density analysis of real datasets (from prior studies on varying ship speeds) are used as input to avoid issues with raw time-series data, such as high dimensionality and sensitivity to shifts. Simulations on 15,000 passive sonar samples demonstrate that Q-means achieves clustering quality comparable to K-means, with clear separation of three clusters and accurate centroids, while reducing complexity from O(n) to O(polylog(n)). This validates Q-means as a promising tool for large-scale, noisy acoustic data in national security applications, bridging quantum theory with practical machine learning.

Journal of Military Science and Technology•Oct 30, 2025•1 citation

Advanced Quantum Algorithms for Big Data Clustering and High-Dimensional Classification

José Gabriel Carrasco Ramírez

The exponential growth of data and the increasing complexity of high-dimensional classification problems have pushed classical computing methods to their limits. Quantum computing emerges as a promising paradigm to address these challenges. This research article explores advanced quantum algorithms for big data clustering and high-dimensional classification. We investigate quantum versions of K-means, spectral clustering, and support vector machines, comparing their performance with classical counterparts. Our results demonstrate significant speedups in processing time and improvements in clustering quality for high-dimensional datasets. Additionally, we propose a novel quantum-inspired classical algorithm that bridges the gap between quantum and classical approaches. This comprehensive study provides insights into the potential of quantum computing in revolutionizing data analysis and machine learning, paving the way for future advancements in the field.

Journal of Advanced Computing Systems•Jun 8, 2024•0 citations

Quantum Algorithm for Regularized Spectral Clustering

Changzhou Long, Yasunori Futamura, Xiucai Ye +1 more

Spectral clustering is one of the most robust methods of an unsupervised machine learning field. Compared with the well-known k-means, spectral clustering uses the spectral properties of the Laplacian matrix to project data to a low-dimensional clustering with higher efficiency. However, for a sparse network with a substantial degree of heterogeneity, standard spectral clustering often overfits noise in the periphery of a sparse and stochastic graph. In our work, we combined the quantum version of the k-means algorithm with regularized spectral clustering and proposed a new quantum machine learning algorithm. It is more like a combination of classical and quantum algorithms. Compared with the established quantum k-means algorithm, our method has obvious computational advantages in non-convex or nested structures. At this stage, the research of quantum algorithms mainly stays in the simulation of classical computers. Our method does not need to expend a lot of effort to preprocess the data at the initial quantum state stage. Under the assumption of quantum data encoding, we theoretically demonstrate the feasibility of the quantum regularized spectral clustering algorithm. Then combine Q-means algorithm complexity advantages to complete the clustering task. This work aims to pave the path and help realize quantum spectral clustering algorithms on real quantum computers in the future and help create other versions of quantum machine learning algorithms. We provide simulations and data examples to illustrate these results.

International Conference on Machine Learning and Computing (ICMLC)•Feb 17, 2023•2 citations

Quantum Annealing for Machine Learning: Applications in Feature Selection, Instance Selection, and Clustering

Pomeroy, Chloe, Aleksandar Pramov, Karishma Thakrar +1 more

This paper explores the applications of quantum annealing (QA) and classical simulated annealing (SA) to a suite of combinatorial optimization problems in machine learning, namely feature selection, instance selection, and clustering. We formulate each task as a Quadratic Unconstrained Binary Optimization (QUBO) problem and implement both quantum and classical solvers to compare their effectiveness. For feature selection, we propose several QUBO configurations that balance feature importance and redundancy, showing that quantum annealing (QA) produces solutions that are computationally more efficient. In instance selection, we propose a few novel heuristics for instance-level importance measures that extend existing methods. For clustering, we embed a classical-to-quantum pipeline, using classical clustering followed by QUBO-based medoid refinement, and demonstrate consistent improvements in cluster compactness and retrieval metrics. Our results suggest that QA can be a competitive and efficient tool for discrete machine learning optimization, even within the constraints of current quantum hardware.

arXiv:2507.15063•Jul 20, 2025•3 citations
Clustering is an important machine learning approach in analyzing big data. In this study, we propose a clustering method using quantum annealing (QA) based on harmonic average of purity and inverse purity. By using harmonic average of purity and inverse purity, we introduce the effect of quantum noise for clustering algorithm while considering both quality of clusters and quality of categories. Using benchmark data, we show the effectiveness of the proposed QA clustering based on the harmonic average of purity and inverse purity.
Supervised clustering is the process of grouping unlabeled objects by using some specific objectives and any supervised learning technique. In traditional clustering algorithms, the similarity measure is based on some distance finding formulations. In supervised clustering, this similarity measure is trained with the help of asupervised learning method. In this paper, we have designed a quantum supervised clustering algorithm and analyzed the overall runtime complexity of the algorithm. In our approach, we have trained the similarity measure model with quantum support vector machine. This quantum mechanically trained similarity measure model is used in the quantum K-Means algorithm, instead of the traditional distance-based similarity measure functions, for clustering unlabeled objects. Our analysis demonstrates that the proposed approach exhibits exponential speed up when compared to the classical implementation.
The rapid growth of data and the collective complexity of high-dimensional classification issues have pushed traditional computer technologies to their limits. However, quantum computing has emerged as a possible paradigm to address these difficulties. In this study, a novel quantum machine learning procedure for classification tasks is proposed. The research is separated into three phases: Pre-processing, clustering and classification. Initially, collect the data from the dataset and perform pre-processing using min-max normalization. Clustering and classification methods are essential constituents of this research because they enable the efficient organization and interpretation of complex datasets related to power generation and other features. Novel clustering methods are used to group similar data points based on their characteristics without requiring labelled data. This clustering approach has been performed by quantum assisted adaptive k-harmonic means (Quant-AdKharmonic) algorithm, which can group similar data effectively. After a clustering approach-based label creation, the classifier model, namely Entanglement-Variational Quantum Recurrent Classifier, is used for the classification task (En-VarQuantum). The integration of both models has handled noisy data for better power prediction and analysis. The performance of the suggested model is assessed employing two datasets: TWTDUS and SDWTT18. Thus, the findings of the TWTDUS dataset, utilizing clustering and classification methods, achieve the highest accuracy of 97.18%. Similarly, for the SDWTT18 dataset, the proposed method achieves an accuracy of 98.17%.
In the big data era, traditional machine learning algorithms like K-means face computational challenges in processing large, high-dimensional datasets, particularly for underwater acoustic signal classification. This study investigates the application of the quantum clustering algorithm Q-means, a quantum-enhanced variant of K-means, to real passive sonar datasets. The purpose is to evaluate Q-means' effectiveness in classifying propeller-driven ship signals under noisy conditions, leveraging quantum principles such as superposition and entanglement for exponential speedup. The research extends classical K-means to δ-k-means for robustness, implementing quantum subroutines including distance estimation, cluster assignment, and state tomography. Preprocessed features from power spectral density analysis of real datasets (from prior studies on varying ship speeds) are used as input to avoid issues with raw time-series data, such as high dimensionality and sensitivity to shifts. Simulations on 15,000 passive sonar samples demonstrate that Q-means achieves clustering quality comparable to K-means, with clear separation of three clusters and accurate centroids, while reducing complexity from O(n) to O(polylog(n)). This validates Q-means as a promising tool for large-scale, noisy acoustic data in national security applications, bridging quantum theory with practical machine learning.
The exponential growth of data and the increasing complexity of high-dimensional classification problems have pushed classical computing methods to their limits. Quantum computing emerges as a promising paradigm to address these challenges. This research article explores advanced quantum algorithms for big data clustering and high-dimensional classification. We investigate quantum versions of K-means, spectral clustering, and support vector machines, comparing their performance with classical counterparts. Our results demonstrate significant speedups in processing time and improvements in clustering quality for high-dimensional datasets. Additionally, we propose a novel quantum-inspired classical algorithm that bridges the gap between quantum and classical approaches. This comprehensive study provides insights into the potential of quantum computing in revolutionizing data analysis and machine learning, paving the way for future advancements in the field.
Spectral clustering is one of the most robust methods of an unsupervised machine learning field. Compared with the well-known k-means, spectral clustering uses the spectral properties of the Laplacian matrix to project data to a low-dimensional clustering with higher efficiency. However, for a sparse network with a substantial degree of heterogeneity, standard spectral clustering often overfits noise in the periphery of a sparse and stochastic graph. In our work, we combined the quantum version of the k-means algorithm with regularized spectral clustering and proposed a new quantum machine learning algorithm. It is more like a combination of classical and quantum algorithms. Compared with the established quantum k-means algorithm, our method has obvious computational advantages in non-convex or nested structures. At this stage, the research of quantum algorithms mainly stays in the simulation of classical computers. Our method does not need to expend a lot of effort to preprocess the data at the initial quantum state stage. Under the assumption of quantum data encoding, we theoretically demonstrate the feasibility of the quantum regularized spectral clustering algorithm. Then combine Q-means algorithm complexity advantages to complete the clustering task. This work aims to pave the path and help realize quantum spectral clustering algorithms on real quantum computers in the future and help create other versions of quantum machine learning algorithms. We provide simulations and data examples to illustrate these results.
This paper explores the applications of quantum annealing (QA) and classical simulated annealing (SA) to a suite of combinatorial optimization problems in machine learning, namely feature selection, instance selection, and clustering. We formulate each task as a Quadratic Unconstrained Binary Optimization (QUBO) problem and implement both quantum and classical solvers to compare their effectiveness. For feature selection, we propose several QUBO configurations that balance feature importance and redundancy, showing that quantum annealing (QA) produces solutions that are computationally more efficient. In instance selection, we propose a few novel heuristics for instance-level importance measures that extend existing methods. For clustering, we embed a classical-to-quantum pipeline, using classical clustering followed by QUBO-based medoid refinement, and demonstrate consistent improvements in cluster compactness and retrieval metrics. Our results suggest that QA can be a competitive and efficient tool for discrete machine learning optimization, even within the constraints of current quantum hardware.