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

arXiv:1804.10905 · Quantum Information Processing

An investigation on support vector clustering for big data in quantum paradigm

Arit Kumar Bishwas, Ashish Mani, Vasile Palade

Published Feb 11, 2020• 16 citations
arXivHTMLPDF
DOI
10.1007/s11128-020-2606-x

Related papers

Quantum Clustering on Streaming Data: A Novel Method for Analyzing Big Data

Rebecca Hofer, Kevin Mallinger

International Conference on Internet of Things, Big Data and Security (IoTBDS)•Jan 1, 2023•1 citation

Quantum-Accelerated Big Data Clustering Techniques: Scalable Quantum Encoding for High-Dimensional Datasets

S. Venkatakiran, Noor Basha, Amolkumar Jadhav +2 more

International Conference on Computational and Cognitive Systems Science•Jan 1, 2025•0 citations

Big Data Quantum Support Vector Clustering.

Arit Kumar Bishwas, Ashish Mani, Vasile Palade

Clustering is a complex process in finding the relevant hidden patterns in unlabeled datasets, broadly known as unsupervised learning. Support vector clustering algorithm is a well-known clustering algorithm based on support vector machines and Gaussian kernels. In this paper, we have investigated the support vector clustering algorithm in quantum paradigm. We have developed a quantum algorithm which is based on quantum support vector machine and the quantum kernel (Gaussian kernel and polynomial kernel) formulation. The investigation exhibits approximately exponential speed up in the quantum version with respect to the classical counterpart.

•Apr 29, 2018•4 citations

Quantum machine learning for support vector machine classification

S. S. Kavitha, Narasimha Kaulgud

Evolutionary Intelligence•Jul 11, 2022•98 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 Systems•Jun 8, 2024•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
Clustering is a complex process in finding the relevant hidden patterns in unlabeled datasets, broadly known as unsupervised learning. Support vector clustering algorithm is a well-known clustering algorithm based on support vector machines and Gaussian kernels. In this paper, we have investigated the support vector clustering algorithm in quantum paradigm. We have developed a quantum algorithm which is based on quantum support vector machine and the quantum kernel (Gaussian kernel and polynomial kernel) formulation. The investigation exhibits approximately exponential speed up in the quantum version with respect to the classical counterpart.
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.
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.