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

IEEE Access

Quantum-Enhanced Support Vector Machine for Sentiment Classification

Fariska Zakhralativa Ruskanda, Muhammad Rifat Abiwardani, Rahmat Mulyawan, Infall Syafalni, Harashta Tatimma Larasati

Published Jan 1, 2023• 37 citations
Publisher

Abstract

The use of quantum technology in NLP tasks, especially sentiment classification, has the potential to be developed. In this research, we investigate the best technique to represent sentiment sentences so that sentiment can be analyzed using the Quantum-Enhanced Support Vector Machine (QE-SVM) algorithm. Investigations were carried out using circuit parameter optimization methods and data transformation. The pipeline of the proposed method consists of sentence-to-circuit conversion, circuit parameter training, statevector formation, and finally the training and testing processes. As a result, we obtained the best classification results with an accuracy of 93.33% using the SPSA optimization method and PCA transformation data. These results have also outperformed the baseline SVM method.

DOI
10.1109/access.2023.3304990

Related papers

Experimentation on Various Sentiment Classification Models in Quantum Natural Language Processing

Muddada Muralikrishna, S Nandini, Hima Keerthi Sagiraju +2 more

Quantum computers has the capacity to enhance the speed of intricate calculations, achieve parallelism via superpositions, and effectively process vast amounts of data. In addition, the domain of natural language processing (NLP) is swiftly drawing the attention of academics and engineers that want to construct more extensive computational models for NLP. Hence, the use of quantum technology in NLP endeavours, particularly in sentiment categorization, has promising prospects for further advancement. In this research work, a detailed analysis of different sentiment classification methods are investigated that are interpreted with quantum computing models. To be precise the Quantum Long Short Term Memory (QLSTM) and Quantum Support Vector Machines (QSVM) are examined to determine the efficiency among the models. The results are simulated in Qiskit simulator and real time quantum computer Qiskit_ibm_osaka to evaluate the examined models. The results shows the significance of the experimentation and it is proven using Accuracy, precision and recall as performance metrices. On an average, in terms of accuracy the proposed model outperforms existing methods with 8.9%, On precision the proposed model outperforms 11.1% compared to existing methods. And with respect to recall the proposed model outperforms 6.7% compared to existing methods.

International Conference on Augmented Reality, Intelligent Systems, and Industrial Automation (ARIIA)•Dec 20, 2024•0 citations

Quantum Kernel-Based Classification: An Optimized Quantum Support Vector Classifier Approach

Xiaoman Liu

Quantum machine learning has emerged as a promising frontier, leveraging the principles of quantum computing to enhance classical algorithms. This paper proposes an optimized Quantum Support Vector Classifier (QSVC) for the classification of the MNIST dataset (a benchmark in handwritten digit recognition). We employ a Chebyshev Parameterized Quantum Circuit (PQC) with an increased number of qubits and layers, and utilize an existing projected quantum kernel method to effectively capture the complex patterns in the data. To enhance model robustness, data augmentation techniques are applied, and dimensionality reduction is performed using Principal Component Analysis (PCA). The proposed QSVC demonstrates competitive accuracy on both the training and testing datasets, highlighting the potential of quantum kernel methods in practical machine learning applications. A comparative analysis with classical Support Vector Machines (SVM) demonstrates the feasibility of quantum methods for high-dimensional classification tasks. Additionally, we investigate the impact of varying the number of qubits in the quantum circuit, providing in-depth insights into the scalability and performance trade-offs of quantum kernel methods.

IEEE International Conference on Frontiers Technology of Information and Computer (ICFTIC)•Dec 13, 2024•0 citations

A quantum-enhanced support vector machine for galaxy classification

M. H. Hassanshahi, Marcin Jastrzebski, Sarah Alam Malik +1 more

Abstract Galaxy morphology, a key tracer of the evolution of a galaxy’s physical structure, has motivated extensive research on machine learning techniques for efficient and accurate galaxy classification. The emergence of quantum computers has generated optimism about the potential for significantly improving the accuracy of such classifications by leveraging the large dimensionality of quantum Hilbert space. This paper presents a quantum-enhanced support vector machine (SVM) algorithm for classifying galaxies based on their morphology. The algorithm requires the computation of a kernel matrix, a task that is performed on a simulated quantum computer using a quantum circuit conjectured to be intractable on classical computers. The result shows similar performance between classical and quantum-enhanced SVM algorithms. For a training size of 40k, the receiver operating characteristic curve for differentiating ellipticals and spirals has an under-curve area of 0.946 ± 0.005 for both classical and quantum-enhanced algorithms. Additionally, we demonstrate for a small data set that the performance of a noise-mitigated quantum SVM algorithm on a quantum device is in agreement with simulation. Finally, a necessary condition for achieving a potential quantum advantage is presented. This investigation is among the very first applications of quantum machine learning in astronomy and highlights their potential for further application in this field.

arXiv:2306.00881•RAS Techniques and Instruments•Jan 1, 2023•9 citations

Quantum Kernel based Support Vector Machine with Quantum Approximate Optimization Algorithm Embedding for improved Lung Cancer Prediction

Shivanya Shomir Dutta, Sahil Sandeep, Sriadibhatla Sridevi +2 more

The integration of classical machine learning with quantum computing has sparked a remarkable revolution, opening avenues to tackle previously insurmountable challenges in diverse fields, particularly in clinical applications. One such challenging task is to predict lung cancer with minimal clinical samples and features. The prominent objective of this proposed research is to introduce a novel Quantum Kernel Support Vector Machine (QKSVM) constructed with the Quantum Kernel Circuit (QKC) enriched with Quantum Approximation Optimization Algorithm (QAOA) embedding circuit to classify highly complex lung cancer using a minimal number of samples and minimal feature dimensions. In this context, to compare the classification performance of the transformative potential of the proposed QAOA embedding QKSVM classifier model, we implemented two other variants of the QKC leveraging Angle embedding (Angle Embedding QKSVM) and Instantaneous Quantum Polynomial embedding (IQP Embedding QKSVM). We also compared their performance with that of a classical SVM classifier. In this study, we delve into the transformative potential classification performance of the proposed QAOA Embedding-based QKSVM classifier, which is contrasted particularly in scenarios with limited sample size and feature dimensions. Our investigation reveals the quantum kernel’s superiority, even when operating with smaller datasets. This remarkable performance is attributed to the quantum models’ robustness in extracting intricate diagnosing features, enabling it to extract more pertinent insights from fewer data points. Notably, the QKSVM model trained with a significantly selected feature vector of 4-Dimensions (4D) with Principal Component Analysis (PCA) emerges as the frontrunner in lung cancer predictions, achieving an outstanding test accuracy of 94.64% and the highest area under curve (AUC) metric of 82.33%.

International Conference on Computing, Communication and Networking Technologies (ICCCNT)•Jun 24, 2024•9 citations

Quantum Assisted Superior Sentiment Classification for Optimized Review

Vikram C, K Rajkamal, Sakthivel Murugan S +1 more

Understanding people's emotions is becoming increasingly important in diverse areas such as social media, e-commerce, and brand or trend analysis. While both deep learning networks and traditional machine learning techniques, such as Support Vector Machines (SVM) have their uses, they often fail to efficiently handle very big or complicated datasets. The study of Quantum Machine Learning (QML) methods could help solve these problems. Support Vector Machine (SVM) quantum algorithms are a scalable way to work with large amounts of data. They are more accurate at classifying datasets than traditional SVM while using less computing power. We suggest a mixed model that blends QSVM and CNN for deep learning and quantum processing that work together. The method includes extracting features, classifying mood, and preparing data from two standard sets: Amazon reviews of goods and IMDb reviews of movies. As shown in experiments on a large dataset, the suggested QMLbased hybrid design method is up to 12 % more accurate and nearly 20 % faster when working than standard machine learning methods. The new development makes quantum computing useful for faster and more flexible data processing to help with mood classification in areas like brand intelligence, watching social media, and reviewing customer reviews.

International Conference on Mobile Computing and Sustainable Informatics (ICMCSI)•Jan 7, 2026•0 citations

Comparing Classical ML Models with Quantum ML Models with Parametrized Circuits for Sentiment Analysis Task

Nisheeth Joshi, Pragya Katyayan, Syed Afroz Ahmed

Abstract This paper studies the performance of classical and quantum machine learning models for sentiment analysis task. Here, popular machine learning algorithms viz support vector machine (SVM), gradient boosting (GB) and random forest (RF) are compared with variational quantum classifier (VQC) using two sets of parameterized circuits viz EfficientSU2 and RealAmplitudes. For experimenting with VQC, IBM Quantum Experience and IBM Qiskit were used while for classical machine learning models, scikit-learn was used. It was found that the performance of the VQC was slightly better than popular machine learning algorithms. For our experiments, we have used popular restaurant sentiment analysis dataset. The extracted features from this dataset and then after applying PCA reduced the feature set into 5 features. Quantum ML models were trained using 100 epochs and 150 epochs. Overall, four Quantum ML models were trained and three Classical ML models were trained. The performance of the trained models was evaluated using standard evaluation measures viz, Accuracy, Precision, Recall, F-Score etc. In all the cases EfficientSU2 based model with 100 Epochs performed better than all other models. Efficient SU2 model with 100 epochs produced an accuracy of 74.5% and an F-Score of 0.7605 which were highest across all the trained models.

Journal of Physics Conference Series•Apr 1, 2021•7 citations
The use of quantum technology in NLP tasks, especially sentiment classification, has the potential to be developed. In this research, we investigate the best technique to represent sentiment sentences so that sentiment can be analyzed using the Quantum-Enhanced Support Vector Machine (QE-SVM) algorithm. Investigations were carried out using circuit parameter optimization methods and data transformation. The pipeline of the proposed method consists of sentence-to-circuit conversion, circuit parameter training, statevector formation, and finally the training and testing processes. As a result, we obtained the best classification results with an accuracy of 93.33% using the SPSA optimization method and PCA transformation data. These results have also outperformed the baseline SVM method.
Quantum computers has the capacity to enhance the speed of intricate calculations, achieve parallelism via superpositions, and effectively process vast amounts of data. In addition, the domain of natural language processing (NLP) is swiftly drawing the attention of academics and engineers that want to construct more extensive computational models for NLP. Hence, the use of quantum technology in NLP endeavours, particularly in sentiment categorization, has promising prospects for further advancement. In this research work, a detailed analysis of different sentiment classification methods are investigated that are interpreted with quantum computing models. To be precise the Quantum Long Short Term Memory (QLSTM) and Quantum Support Vector Machines (QSVM) are examined to determine the efficiency among the models. The results are simulated in Qiskit simulator and real time quantum computer Qiskit_ibm_osaka to evaluate the examined models. The results shows the significance of the experimentation and it is proven using Accuracy, precision and recall as performance metrices. On an average, in terms of accuracy the proposed model outperforms existing methods with 8.9%, On precision the proposed model outperforms 11.1% compared to existing methods. And with respect to recall the proposed model outperforms 6.7% compared to existing methods.
Quantum machine learning has emerged as a promising frontier, leveraging the principles of quantum computing to enhance classical algorithms. This paper proposes an optimized Quantum Support Vector Classifier (QSVC) for the classification of the MNIST dataset (a benchmark in handwritten digit recognition). We employ a Chebyshev Parameterized Quantum Circuit (PQC) with an increased number of qubits and layers, and utilize an existing projected quantum kernel method to effectively capture the complex patterns in the data. To enhance model robustness, data augmentation techniques are applied, and dimensionality reduction is performed using Principal Component Analysis (PCA). The proposed QSVC demonstrates competitive accuracy on both the training and testing datasets, highlighting the potential of quantum kernel methods in practical machine learning applications. A comparative analysis with classical Support Vector Machines (SVM) demonstrates the feasibility of quantum methods for high-dimensional classification tasks. Additionally, we investigate the impact of varying the number of qubits in the quantum circuit, providing in-depth insights into the scalability and performance trade-offs of quantum kernel methods.
Abstract Galaxy morphology, a key tracer of the evolution of a galaxy’s physical structure, has motivated extensive research on machine learning techniques for efficient and accurate galaxy classification. The emergence of quantum computers has generated optimism about the potential for significantly improving the accuracy of such classifications by leveraging the large dimensionality of quantum Hilbert space. This paper presents a quantum-enhanced support vector machine (SVM) algorithm for classifying galaxies based on their morphology. The algorithm requires the computation of a kernel matrix, a task that is performed on a simulated quantum computer using a quantum circuit conjectured to be intractable on classical computers. The result shows similar performance between classical and quantum-enhanced SVM algorithms. For a training size of 40k, the receiver operating characteristic curve for differentiating ellipticals and spirals has an under-curve area of 0.946 ± 0.005 for both classical and quantum-enhanced algorithms. Additionally, we demonstrate for a small data set that the performance of a noise-mitigated quantum SVM algorithm on a quantum device is in agreement with simulation. Finally, a necessary condition for achieving a potential quantum advantage is presented. This investigation is among the very first applications of quantum machine learning in astronomy and highlights their potential for further application in this field.
The integration of classical machine learning with quantum computing has sparked a remarkable revolution, opening avenues to tackle previously insurmountable challenges in diverse fields, particularly in clinical applications. One such challenging task is to predict lung cancer with minimal clinical samples and features. The prominent objective of this proposed research is to introduce a novel Quantum Kernel Support Vector Machine (QKSVM) constructed with the Quantum Kernel Circuit (QKC) enriched with Quantum Approximation Optimization Algorithm (QAOA) embedding circuit to classify highly complex lung cancer using a minimal number of samples and minimal feature dimensions. In this context, to compare the classification performance of the transformative potential of the proposed QAOA embedding QKSVM classifier model, we implemented two other variants of the QKC leveraging Angle embedding (Angle Embedding QKSVM) and Instantaneous Quantum Polynomial embedding (IQP Embedding QKSVM). We also compared their performance with that of a classical SVM classifier. In this study, we delve into the transformative potential classification performance of the proposed QAOA Embedding-based QKSVM classifier, which is contrasted particularly in scenarios with limited sample size and feature dimensions. Our investigation reveals the quantum kernel’s superiority, even when operating with smaller datasets. This remarkable performance is attributed to the quantum models’ robustness in extracting intricate diagnosing features, enabling it to extract more pertinent insights from fewer data points. Notably, the QKSVM model trained with a significantly selected feature vector of 4-Dimensions (4D) with Principal Component Analysis (PCA) emerges as the frontrunner in lung cancer predictions, achieving an outstanding test accuracy of 94.64% and the highest area under curve (AUC) metric of 82.33%.
Understanding people's emotions is becoming increasingly important in diverse areas such as social media, e-commerce, and brand or trend analysis. While both deep learning networks and traditional machine learning techniques, such as Support Vector Machines (SVM) have their uses, they often fail to efficiently handle very big or complicated datasets. The study of Quantum Machine Learning (QML) methods could help solve these problems. Support Vector Machine (SVM) quantum algorithms are a scalable way to work with large amounts of data. They are more accurate at classifying datasets than traditional SVM while using less computing power. We suggest a mixed model that blends QSVM and CNN for deep learning and quantum processing that work together. The method includes extracting features, classifying mood, and preparing data from two standard sets: Amazon reviews of goods and IMDb reviews of movies. As shown in experiments on a large dataset, the suggested QMLbased hybrid design method is up to 12 % more accurate and nearly 20 % faster when working than standard machine learning methods. The new development makes quantum computing useful for faster and more flexible data processing to help with mood classification in areas like brand intelligence, watching social media, and reviewing customer reviews.
Abstract This paper studies the performance of classical and quantum machine learning models for sentiment analysis task. Here, popular machine learning algorithms viz support vector machine (SVM), gradient boosting (GB) and random forest (RF) are compared with variational quantum classifier (VQC) using two sets of parameterized circuits viz EfficientSU2 and RealAmplitudes. For experimenting with VQC, IBM Quantum Experience and IBM Qiskit were used while for classical machine learning models, scikit-learn was used. It was found that the performance of the VQC was slightly better than popular machine learning algorithms. For our experiments, we have used popular restaurant sentiment analysis dataset. The extracted features from this dataset and then after applying PCA reduced the feature set into 5 features. Quantum ML models were trained using 100 epochs and 150 epochs. Overall, four Quantum ML models were trained and three Classical ML models were trained. The performance of the trained models was evaluated using standard evaluation measures viz, Accuracy, Precision, Recall, F-Score etc. In all the cases EfficientSU2 based model with 100 Epochs performed better than all other models. Efficient SU2 model with 100 epochs produced an accuracy of 74.5% and an F-Score of 0.7605 which were highest across all the trained models.