Journal of Electrical Systems

Planning, Design, and Execution of a Quantum Incremental Clustering Algorithm System for the Examination of Unsupervised Data

Pornima Niranjane Vaibhav D. Dabhade

Published Mar 31, 2024• 0 citations

Abstract

The exponential growth of data in various domains has underscored the need for efficient unsupervised learning algorithms to discover hidden patterns and structures within large datasets. Traditional clustering algorithms often face challenges in handling dynamic datasets and require periodic retraining, making them less suitable for real-time applications. In response to these challenges, this research introduces a Quantum Incremental Clustering Algorithm System (QICAS) designed to adapt to evolving datasets and provide timely insights into the underlying structures. The proposed QICAS is based on quantum computing principles, leveraging the unique properties of qubits and quantum superposition to perform clustering tasks more efficiently than classical counterparts. The research focuses on the planning, design, and execution of the QICAS, ensuring a comprehensive understanding of the algorithm's capabilities and performance.

DOI: 10.52783/jes.1792

Related papers

Quantum-Enhanced Clustering Algorithms for Big Data

Jincheng Zhang

This paper investigates the application of quantum algorithms to enhance clustering performance on big data. Traditional clustering algorithms often struggle with the computational complexity associated with large datasets and intricate data distributions. We propose and analyze the implementation of quantum k-means and quantum hierarchical clustering algorithms, leveraging quantum superposition and entanglement to potentially achieve significant speedups. The theoretical framework outlines the core concepts and mathematical formulations of these algorithms. We explore the potential for quantum algorithms to address the limitations of classical approaches, particularly in scenarios involving high-dimensional data and complex clusters. The research focuses on the algorithmic design, examining the key steps involved in transforming classical clustering problems into quantum computations. This work contributes to the emerging field of quantum data mining and provides a foundational understanding of how quantum computing can revolutionize data analysis tasks. The primary focus is on the theoretical aspects of quantum clustering and does not include experimental validation.

Sep 5, 20260 citations

Efficient Quantum Algorithms for Data Clustering

Julien Rauch

Data clustering consists of grouping data without prior training, a process known as unsupervised learning. Given the constant growth of database volumes, contemporary computers require significant computational time to perform this partitioning. To effectively address this challenge, quantum computing offers a promising perspective, as it could eventually provide more efficient resources for clustering massive datasets. However, current quantum computers are not yet mature; they are prone to noise, which limits their practical utility. In this context, we have designed a hybrid classical-quantum clustering algorithm tailored for the current Noisy Intermediate-Scale Quantum (NISQ) era. We evaluated this algorithm under various conditions and across different types of datasets, comparing it against several well-known clustering algorithms. Our results demonstrate that, under certain conditions, quantum noise can actually provide an advantage to our algorithm. Furthermore, we worked on deploying this algorithm on actual quantum processors and developed tools to optimize this deployment. Finally, to diversify the quantum architectures used, we extended our research to include neutral-atom quantum computers.

Oct 8, 20260 citations

Q-ClusterSim - Design & Simulation of Resource-Efficient Quantum-Accelerated Clustering Algorithms for Large-Scale Datasets

Nida Afreen Rizvi, Shadab Pasha Khan

The article introduces Q-ClusterSim, a resource-efficient hybrid quantum-classical framework designed to accelerate clustering operations on large-scale and high-dimensional datasets. The proposed model combines quantum-enhanced k-means and density-based clustering within a unified quantum simulation environment to achieve improved computational efficiency and scalability. By leveraging the parallelism of quantum circuits and the adaptability of classical optimization, Q-ClusterSim significantly reduces execution time while maintaining clustering accuracy. Simulations are conducted using IBM Qiskit and TensorFlow Quantum on benchmark datasets, where the proposed model consistently outperforms classical clustering algorithms in terms of convergence speed, precision, and resource consumption. Results validate the model’s effectiveness in managing complex data structures under limited qubit resources, making it suitable for real-world large data applications. This study highlights the transformative potential of quantum-assisted clustering in reshaping future data analytics and computational intelligence paradigms..

International Conference on Next-Gen Quantum and Advanced Computing: Algorithms, Security, and Beyond (NQComp)Mar 5, 20260 citations

基于量子纠缠的动态矩阵的自适应聚类算法

Jincheng Zhang

This paper introduces a novel dynamic matrix-based clustering algorithm leveraging the unique properties of quantum entanglement. Traditional clustering algorithms often struggle with complex data patterns and require significant computational resources. This work proposes a new approach that utilizes quantum entanglement to accelerate matrix operations and improve the accuracy and diversity of the resulting clusters. The algorithm iteratively evolves a dynamic matrix representing the data, allowing for a more nuanced and adaptive clustering process. We demonstrate the effectiveness of this method through simulations and preliminary experiments, showcasing its potential to outperform conventional clustering techniques in several benchmark datasets. The core mechanism focuses on the application of entanglement to enhance the computational efficiency and feature representation within the matrix operations, ultimately leading to superior clustering outcomes.

Sep 4, 20260 citations

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 SystemsJun 8, 20240 citations

Patient Data Analysis with the Quantum Clustering Method

Shradha Deshmukh, Bikash K. Behera, Preeti Mulay

Quantum computing is one of the most promising solutions for solving optimization problems in the healthcare world. Quantum computing development aims to light up the execution of a vast and complex set of algorithmic instructions. For its implementation, the machine learning models are continuously evolving. Hence, the new challenge is to improve the existing complex and critical machine learning training models. Therefore, the healthcare sector is shifting from a classical to a quantum domain to sustain patient-oriented attention to healthcare patrons. This paper presents a hybrid classical-quantum approach for training the unsupervised data models. In order to achieve good performance and optimization of the machine learning algorithms, a quantum k-means (QK-means) clustering problem was deployed on the IBM quantum simulators, i.e.,the IBM QASM simulator. In the first place, the approach was theoretically studied and then implemented to analyze the experimental results. The approach was further tested using small synthetics and cardiovascular datasets on a qsam simulator to obtain the clustering solution. The future direction connecting the dots is the incremental k-means algorithm with the quantum platform, which would open hitherto unimaginable technological doors.

Quantum ReportsFeb 13, 202311 citations