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

International Conference on Microelectronics, Computing and Communications

Documents clustering using quantum clustering algorithm

Rupam Bhagawati, Sahinur Rahman Laskar, Bhagaban Swain

Published Jan 1, 2016• 3 citations
Publisher

Abstract

In the domain of Quantum Information processing (QIP), quantum clustering approach plays a vital role for processing information. The quantum clustering technique is basically used for providing effective information navigation and browsing mechanism. There are many classical approach of clustering the documents like k-means clustering algorithm, hierarchical clustering algorithm, information bottleneck clustering algorithm and many more. In this paper we proposed a clustering method which is based on quantum theory. For clustering the documents, such that which provides an agreeable result in comparison of existing classical approach.

DOI
10.1109/microcom.2016.7522562

Related papers

A Clustering Approach for Information Retrieval Using A Quantum-Based Computation Technique

Rupam Bhagawati, Thiruselvan Subramanian

Today’s era of the internet and digitalization requires information of various forms. Information in any configuration is predominant in performing various tasks like management and retrieval. Static information is mostly present in documents and to perform retrieval, browsing, and managing this kind of information, we have many strategies available in classical form. Many classical forms can also be categorized from high level to low level. To some extent, the realm of Quantum Computing is also employed for the task and many contemporary researchers state efficient algorithms for the task. Relevant information per the user’s need is the most prominent goal of an Information System. Documents play an important role in information in this regard as well as keeping uncertainty on the relevancy of correct information as per the requirement. Documents are representations of all kinds of information related to numerous fields like academia, media, law, engineering, geography, and many more. A huge collection of information representation is scattered everywhere throughout the logical world of the internet. The collection is a blender of all types of documents from different fields and semantics. Searching and sorting complete relevant documents from this gigantic blender according to information need is an onerous task to an extent. Grouping the same information in clusters brings a change to the relevancy rate of the required information. Quantum mechanics track towards Quantum information processing provides a realm for clustering of information in the form of acquaintances. Using quantum computation in the realm of quantum mechanics, an algorithm is proposed for the task which will lead to the grouping of information by considering the microscopic properties of each and every acquaintance.

International Journal of Intelligent Systems and Applications in Engineering•Feb 2, 2024•0 citations

Clusters Analyzer Algorithm for Informative Acquaintances - Quantum Clustering Algorithm

Rupam Bhagawati

In this internet and digitalization age, information in any form is very important to perform a digital task. The processing of any information to obtain the desired results requires a specific medium and sometimes to accomplish various tasks related to that set of information like browsing, searching, sorting, retrieval and management. In order to perform those tasks on the information, which are present on various acquaintances, we need to analyze the information by performing an unsupervised clustering in the realm of quantum computation. Quantum clustering is the core technique used in quantum computation to perform clustering of information with several algorithms that have been introduced and studied till date to analyze the cluster for increasing the efficiency of information exploration, information retrieval, information management and browsing system. Hence, introducing a quantum clustering technique to form clusters which would include sentences from a set of informative data set and the formation of clusters would be carried out by performing Semantic Analysis.

International Conference on Computing Methodologies and Communication (ICCMC)•Mar 1, 2020•8 citations

Quantum-Inspired Clustering Algorithms for Big Data

Jincheng Zhang

Traditional clustering algorithms, such as k-means and DBSCAN, often face significant challenges when applied to big data. The computational complexity associated with distance calculations and nearest neighbor searches scales poorly with dataset size, limiting their effectiveness. This paper proposes a novel approach to clustering inspired by quantum measurement theory, specifically quantum-inspired nearest neighbor search. We leverage concepts from quantum mechanics, such as superposition and measurement, to design clustering algorithms that can efficiently identify clusters within high-dimensional datasets. The core idea is to treat the clustering problem as a measurement process, where candidate cluster centers are repeatedly measured against data points, and the most likely cluster centers are selected. The resulting algorithms aim to provide scalability improvements over conventional methods, particularly for datasets with a large number of features and data points. The effectiveness of the proposed algorithms is demonstrated through theoretical analysis and conceptual explanations, highlighting the potential benefits and future research directions.

•Aug 31, 2026•0 citations

Comparative Analysis of Classical and Quantum Approach for Unsupervised K-Means Algorithm

G. Murali, Paruchuri Pravallika, Narreddy Aravind Reddy +2 more

Quantum algorithms are being extensively researched nowadays, seeing the potential to provide exponential speedup compared to classical algorithm execution. This speedup can play a significant role in machine learning, where training a model is usually prolonged. Training a machine learning model requires compressing large vectors into small computational units, and quantum computers inherently are fast at compressing the large vectors into small computations and tensor products. The present work aims to compare the K-means, a classical machine learning algorithm, and Q-means, a Quantum algorithm. Here in this work, we use q-means, a quantum algorithm for clustering, a canonical problem in unsupervised machine learning. The q-means algorithm has convergence and precision guarantees similar to k-means. [14]It outputs with high probability a good approximation of the k cluster centroids like the classical algorithm. The experimental results are demonstrated, which show a significant difference between k-means and q-means algorithms.

•Jul 2, 2021•0 citations

Spectral Clustering of Hyperspectral Images in Quantum Framework

Archana G. Pai, Krishna Mohan Buddhiraju, Surya S. Durbha

Clustering hyperspectral images is a complex task that requires careful consideration of the data's high dimensionality, noise, and redundancy. Spectral clustering has proven to be a powerful tool for analyzing hyperspectral images, due to its ability to capture non-linear relationships and intricate structures, providing robust clustering results even in highdimensional, complex datasets. By leveraging a combination of pre-processing techniques, and clustering algorithms, it is possible to effectively cluster hyperspectral data and extract meaningful information. In this work, we presented a hybrid approach of spectral clustering by utilizing quantum computing's ability to process complex, high-dimensional spaces and compute similarity measures more efficiently. This experiment demonstrates that when quantum kernel was used for clustering, the quality of the clusters improved significantly. Implementation of these quantum algorithms is currently limited by the number of qubits, gate fidelity, and coherence time of existing quantum computers. Despite these challenges, as quantum hardware and algorithms continue to evolve, this hybrid quantum-classical approach to spectral clustering holds promise for future applications.

IEEE India Geoscience and Remote Sensing Symposium (InGARSS)•Dec 10, 2025•0 citations

Quantum Algorithm for Sequence Clustering

Arit Kumar Bishwas, A.S. Radha Mani, Vasile Palade

In recent years we have seen that the world is increasingly driven by data or information. Data has always been important for business and research, but in the current era the concept of big data is changing the way people employ data for decision making. Big data is playing a big role in informed decision making processes. In recent years, the importance of clustering with big sequential data sets has grown substantially due to its wide applications in areas like DNA genome modeling and financial data analysis. Handling big data clustering activity is a complex task. This intrinsic difficulty worsens with huge sequential data (can be termed as “Big Sequences” ) where the structure of the underlying process is often difficult to deduce because of the difference in lengths of sequences. In this chapter, we have proposed an interesting approach for clustering sequencing data in a quantum paradigm which is based on Quantum K-Means clustering and the Hidden Markov Model. In this approach, a new representation space of input data objects (sequences) is established. The vector of each object's similarities with respect to a pre-determinate set of other objects describes the respective object. These similarities are identified using the Hidden Markov Model . A novel representation space of input sequences has been mapped to quantum states with the help of quantum RAM (QRAM) . Then clustering is performed using quantum K -means clustering over the new transformed input data set. We have observed an exponential speed up gain in run time complexity in our approach as compared to the classical approaches.

Chapman & Hall/CRC eBooks•Oct 30, 2017•0 citations
In the domain of Quantum Information processing (QIP), quantum clustering approach plays a vital role for processing information. The quantum clustering technique is basically used for providing effective information navigation and browsing mechanism. There are many classical approach of clustering the documents like k-means clustering algorithm, hierarchical clustering algorithm, information bottleneck clustering algorithm and many more. In this paper we proposed a clustering method which is based on quantum theory. For clustering the documents, such that which provides an agreeable result in comparison of existing classical approach.
Today’s era of the internet and digitalization requires information of various forms. Information in any configuration is predominant in performing various tasks like management and retrieval. Static information is mostly present in documents and to perform retrieval, browsing, and managing this kind of information, we have many strategies available in classical form. Many classical forms can also be categorized from high level to low level. To some extent, the realm of Quantum Computing is also employed for the task and many contemporary researchers state efficient algorithms for the task. Relevant information per the user’s need is the most prominent goal of an Information System. Documents play an important role in information in this regard as well as keeping uncertainty on the relevancy of correct information as per the requirement. Documents are representations of all kinds of information related to numerous fields like academia, media, law, engineering, geography, and many more. A huge collection of information representation is scattered everywhere throughout the logical world of the internet. The collection is a blender of all types of documents from different fields and semantics. Searching and sorting complete relevant documents from this gigantic blender according to information need is an onerous task to an extent. Grouping the same information in clusters brings a change to the relevancy rate of the required information. Quantum mechanics track towards Quantum information processing provides a realm for clustering of information in the form of acquaintances. Using quantum computation in the realm of quantum mechanics, an algorithm is proposed for the task which will lead to the grouping of information by considering the microscopic properties of each and every acquaintance.
In this internet and digitalization age, information in any form is very important to perform a digital task. The processing of any information to obtain the desired results requires a specific medium and sometimes to accomplish various tasks related to that set of information like browsing, searching, sorting, retrieval and management. In order to perform those tasks on the information, which are present on various acquaintances, we need to analyze the information by performing an unsupervised clustering in the realm of quantum computation. Quantum clustering is the core technique used in quantum computation to perform clustering of information with several algorithms that have been introduced and studied till date to analyze the cluster for increasing the efficiency of information exploration, information retrieval, information management and browsing system. Hence, introducing a quantum clustering technique to form clusters which would include sentences from a set of informative data set and the formation of clusters would be carried out by performing Semantic Analysis.
Traditional clustering algorithms, such as k-means and DBSCAN, often face significant challenges when applied to big data. The computational complexity associated with distance calculations and nearest neighbor searches scales poorly with dataset size, limiting their effectiveness. This paper proposes a novel approach to clustering inspired by quantum measurement theory, specifically quantum-inspired nearest neighbor search. We leverage concepts from quantum mechanics, such as superposition and measurement, to design clustering algorithms that can efficiently identify clusters within high-dimensional datasets. The core idea is to treat the clustering problem as a measurement process, where candidate cluster centers are repeatedly measured against data points, and the most likely cluster centers are selected. The resulting algorithms aim to provide scalability improvements over conventional methods, particularly for datasets with a large number of features and data points. The effectiveness of the proposed algorithms is demonstrated through theoretical analysis and conceptual explanations, highlighting the potential benefits and future research directions.
Quantum algorithms are being extensively researched nowadays, seeing the potential to provide exponential speedup compared to classical algorithm execution. This speedup can play a significant role in machine learning, where training a model is usually prolonged. Training a machine learning model requires compressing large vectors into small computational units, and quantum computers inherently are fast at compressing the large vectors into small computations and tensor products. The present work aims to compare the K-means, a classical machine learning algorithm, and Q-means, a Quantum algorithm. Here in this work, we use q-means, a quantum algorithm for clustering, a canonical problem in unsupervised machine learning. The q-means algorithm has convergence and precision guarantees similar to k-means. [14]It outputs with high probability a good approximation of the k cluster centroids like the classical algorithm. The experimental results are demonstrated, which show a significant difference between k-means and q-means algorithms.
Clustering hyperspectral images is a complex task that requires careful consideration of the data's high dimensionality, noise, and redundancy. Spectral clustering has proven to be a powerful tool for analyzing hyperspectral images, due to its ability to capture non-linear relationships and intricate structures, providing robust clustering results even in highdimensional, complex datasets. By leveraging a combination of pre-processing techniques, and clustering algorithms, it is possible to effectively cluster hyperspectral data and extract meaningful information. In this work, we presented a hybrid approach of spectral clustering by utilizing quantum computing's ability to process complex, high-dimensional spaces and compute similarity measures more efficiently. This experiment demonstrates that when quantum kernel was used for clustering, the quality of the clusters improved significantly. Implementation of these quantum algorithms is currently limited by the number of qubits, gate fidelity, and coherence time of existing quantum computers. Despite these challenges, as quantum hardware and algorithms continue to evolve, this hybrid quantum-classical approach to spectral clustering holds promise for future applications.
In recent years we have seen that the world is increasingly driven by data or information. Data has always been important for business and research, but in the current era the concept of big data is changing the way people employ data for decision making. Big data is playing a big role in informed decision making processes. In recent years, the importance of clustering with big sequential data sets has grown substantially due to its wide applications in areas like DNA genome modeling and financial data analysis. Handling big data clustering activity is a complex task. This intrinsic difficulty worsens with huge sequential data (can be termed as “Big Sequences” ) where the structure of the underlying process is often difficult to deduce because of the difference in lengths of sequences. In this chapter, we have proposed an interesting approach for clustering sequencing data in a quantum paradigm which is based on Quantum K-Means clustering and the Hidden Markov Model. In this approach, a new representation space of input data objects (sequences) is established. The vector of each object's similarities with respect to a pre-determinate set of other objects describes the respective object. These similarities are identified using the Hidden Markov Model . A novel representation space of input sequences has been mapped to quantum states with the help of quantum RAM (QRAM) . Then clustering is performed using quantum K -means clustering over the new transformed input data set. We have observed an exponential speed up gain in run time complexity in our approach as compared to the classical approaches.