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.
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.
Abstract In this paper, we have studied the performance and role of local optimizers in quantum variational circuits. We studied the performance of the two most popular optimizers and compared their results with some popular classical machine learning algorithms. The classical algorithms we used in our study are support vector machine (SVM), gradient boosting (GB) and random forest (RF). These were compared with a variational quantum classifier (VQC) using two sets of local optimizers viz AQGD and COBYLA. For experimenting with VQC, IBM Quantum Experience and IBM Qiskit was used while for classical machine learning models, scikit-learn was used. The results show that machine learning on noisy immediate scale quantum machines can produce comparable results as on classical machines. For our experiments, we have used a 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 on using EfficientSU2 variational circuit. 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. In all the cases AQGD optimizer-based model with 100 Epochs performed better than all other models. It produced an accuracy of 77% and an F-Score of 0.785 which were highest across all the trained models.
With the advancement of quantum computing in the Noisy Intermediate-Scale Quantum (NISQ) era, hybrid quantum-classical algorithms have emerged as promising approaches for addressing certain machine learning tasks. This study investigates the Variational Quantum Classifier (VQC), a hybrid model that integrates parameterized quantum circuits with classical optimization routines, implemented via IBM’s Qiskit framework. We provide a detailed account of the VQC architecture, including feature encoding, ansatz construction, and optimization methodology. To assess its performance, we conduct a comparative analysis between VQC and classical Support Vector Classifiers (SVC) across synthetic and real-world datasets, including Iris and a binary-filtered version of MNIST. Experimental results reveal that classical models consistently achieve higher accuracy and faster training times. However, the VQC demonstrates functional viability, particularly under noise-free conditions and reduced-dimensionality settings. These findings underscore the current limitations of quantum models while highlighting the potential of VQC as a proof-of-concept for quantum-enhanced learning as quantum hardware matures.
A potential path forward is Quantum Machine Learning (QML), which aims to leverage quantum computing in conjunction with classical machine learning to enhance computing efficiency and the expressiveness of models. In this paper, two different quantum classifiers - Variational Quantum Classifier (VQC) and Quantum Kernel Support Vector Machine (QSVM) - are compared with three classical classifiers as baseline classifiers - Logistic Regression, Support Vector Machine (SVM), and a Multi-Layer Perceptron (MLP) - on the Breast Cancer Wisconsin dataset. The quantum circuits were created in the PennyLane framework and simulated on a classical backend. However, in terms of accuracy, classical Logistic Regression performed better with an accuracy of 97.8%, classical SVM and QSVM with an accuracy of 95.6% each, although the Quantum VQC achieved a lower accuracy of 88.9% and had a recall of 100% for the benign class, though it correctly identified only 12 of the 17 malignant cases (a malignant-class recall of approximately 70.6%). The drawback of quantum models is the higher training time; however, since the quantum circuit needs to be classically simulated, the quantum SVM took 23.29 seconds compared to less than 0.01 seconds for the classical linear models. These results indicate that for small structured datasets, classifiers based on quantum computing have not yet surpassed well-tuned classical counterparts. In some respects (e.g., benign-class recall), they perform competitively, though not on malignant-class recall, where the VQC in particular performed worse than the classical baselines, which is worth further investigation on real quantum computers.
Quantum Machine Learning (QML) has emerged as an interdisciplinary field that harnesses the potential of quantum computing to revolutionize classical machine learning paradigms. This paper presents a benchmarking study focused on four quantum classifier algorithms: Quantum Support Vector Classifier (QSVC), Variational Quantum Circuit (VQC), Quantum Neural Network Classifier (QNNC) and Pegasos Quantum Support Vector Classifier (PegasosQSVC). These quantum classifiers hold promise for unlocking quantum advantages in classification tasks. However, a systematic assessment of their performance across diverse datasets is yet to be fully explored. In this research study, we evaluate and compare the classification performance of quantum machine learning classifiers on various datasets (Breast Cancer, Diabetes, and Titanic) and compare them to a classical model. Our findings revealed that PegasosQSVC consistently maintained high performance across all datasets with the highest average accuracy, recall, and F1-score values of 0.81, 0.72, and 0.71, respectively, followed by VQC, followed by VQC, while QSVC and QNNC perform variably. Nevertheless, QSVC was found to balance performance and training time, achieving an average accuracy of 0.81 and a training time of 177 seconds. Overall, the classical model surpassed QML models as it was up to 10% higher in average accuracy.
Early and accurate diagnosis of breast cancer plays a critical role in improving patient survival rates and reducing treatment costs. Classical machine learning algorithms such as Logistic Regression and Support Vector Machines (SVM) have demonstrated strong performance in medical diagnosis tasks; however, their scalability and representational limits motivate the exploration of emerging paradigms. Quantum Machine Learning (QML), particularly Variational Quantum Classifiers (VQC), has recently gained attention due to its potential to model complex decision boundaries using quantum circuits. This paper presents a comparative analysis between a Variational Quantum Classifier and classical machine learning models for binary breast cancer classification. The study employs dimensionality-reduced clinical data and evaluates model performance using accuracy, confusion matrices, decision boundary visualization, Principal Component Analysis (PCA), and Receiver Operating Characteristic (ROC) curves. Experimental results indicate that the VQC achieves competitive performance with classical approaches, demonstrating its feasibility for small-scale medical datasets and highlighting the promise of quantum-enhanced learning in healthcare applications.
Breast cancer is rated as one of the top leading diagnosed and deadliest cancers affecting women worldwide and causing high mortality rate among cancers. With the data-driven applications, hybrid quantum-classical machine learning models have evolved as significant alternatives for handling complex feature spaces with the growing interest in quantum computing. This paper presents a systematic comparative study of classical and quantum machine learning approaches for breast cancer classification using the Wisconsin Breast Cancer Dataset. In this architecture we have preprocessed classical feature vectors using standard normalized techniques and parallelly quantum states are mapped through data embedding techniques which relies on parameterized rotational gates. In this work we have implemented all quantum models using the Pennylane library, resulting in hybrid quantum–classical optimization on near-term quantum simulators. The comparison results in multiple classical and quantum models. In classical we have Support Vector Machine (SVM), K-Nearest Neighbors (KNN) and Convolutional Neural Networks (CNN), which are compared with the quantum-based models such as the Variational Quantum Classifier (VQC), Quantum Support Vector Machine (QSVM) and Quantum Convolutional Neural Network (QCNN). In QSVM, we have performed dimensionality reduction using Principal Component Analysis (PCA) before to quantum embedding, and quantum-generated features are used to train a classical linear SVM. The evaluation metrics results in accuracy, precision, recall, F1-score, ROC curves and confusion matrices. The classical models achieves the accuracy in the range of 94%-96%, whereas competitive performance of quantum models demonstrate depending on the embedding strategy and circuit configuration. In the implemented quantum models, the variational quantum classifier achieved the highest classification accuracy of 96.06%, surpassing other evaluated models. These results demonstrate quantum embedding combined with variational quantum circuits can effectively capture discriminative patterns in medical datasets, indicating the implementation of quantum machine learning models for breast cancer diagnosis with the present quantum simulating platforms.