Classical machine learning has practical significant advancements and extensive acceptance across various domains, enabling the growth of precise predictive models. The purpose of this work is to examine the accuracy gained by various machine learning algorithms, both classical and quantum. In addition, the study delves into the fundamental ideas and principles that form the backbone of quantum machine learning algorithms, such as quantum data representation, quantum feature mapping, and quantum optimization strategies. Experiments use classical machine learning models trained and tested on traditional hardware to measure evaluation metrics like classification accuracy, precision, recall, and F1-score for quantum machine learning models executed on quantum computing platforms or simulators. In quantum SVM, the seed dataset obtained 100% accuracy, and the supermarket dataset obtained 69% accuracy when compared to classical SVM. The findings imply that, under some conditions, quantum machine learning algorithms show the capacity to beat their conventional counterparts in terms of accuracy.
Classical machine learning has practical significant advancements and extensive acceptance across various domains, enabling the growth of precise predictive models. The purpose of this work is to examine the accuracy gained by various machine learning algorithms, both classical and quantum. In addition, the study delves into the fundamental ideas and principles that form the backbone of quantum machine learning algorithms, such as quantum data representation, quantum feature mapping, and quantum optimization strategies. Experiments use classical machine learning models trained and tested on traditional hardware to measure evaluation metrics like classification accuracy, precision, recall, and F1-score for quantum machine learning models executed on quantum computing platforms or simulators. In quantum SVM, the seed dataset obtained 100% accuracy, and the supermarket dataset obtained 69% accuracy when compared to classical SVM. The findings imply that, under some conditions, quantum machine learning algorithms show the capacity to beat their conventional counterparts in terms of accuracy.
Quantum computing has demonstrated remarkable prowess in addressing factorization issues and unordered search problems, showcasing its quantum parallelism capabilities that enable exponential speed-up for specific computational challenges. However, the seamless integration of classical and quantum computing to harness accelerated computation speed presents unique challenges. This paper delves into the intricacies of this integration, focusing on the current state of quantum machine learning (QML) and evaluating the performance of classical and quantum algorithms in terms of accuracy. To address these challenges, we conducted experiments utilizing three datasets for binary classification, implementing both classical Support Vector Machine (SVM) and Quantum SVM (QSVM) algorithms. Our investigations reveal that the QSVM algorithm consistently outperforms its classical counterpart on complex datasets. Notably, the performance gap between quantum and classical models widens with increasing dataset complexity, shedding light on the susceptibility of simple classical models to overfitting when confronted with intricate datasets.Despite the ongoing development required for quantum hardware with ample resources, our findings underscore the significant potential of quantum machine learning, particularly in unsupervised learning and generative models. As we move forward, it is imperative to channel more efforts into exploring novel quantum learning models capable of harnessing the inherent power of quantum mechanics to overcome the constraints of classical machine learning. This research contributes to the ongoing discourse on the future of quantum computing, emphasizing the need for continued exploration and innovation in quantum machine learning methodologies.
This study explores the integration of quantum data embedding techniques into classical machine learning (ML) algorithms; to assess performance enhancements and computational implications across a spectrum of models. We explored various classical-to-quantum mapping methods; ranging from basis encoding and angle encoding to amplitude encoding; for encoding classical data. We conducted an extensive empirical study encompassing popular ML algorithms, including Logistic Regression, K-Nearest Neighbors, Support Vector Machines, and ensemble methods like Random Forest, LightGBM, AdaBoost, and CatBoost. Our findings reveal that quantum data embedding contributes to improved classification accuracy and F1 scores, particularly notable in models that inherently benefit from enhanced feature representation. We observed nuanced effects on running time, with low-complexity models exhibiting moderate increases and more computationally intensive models experiencing discernible changes. Notably, ensemble methods demonstrated a favorable balance between performance gains and computational overhead. This study underscores the potential of quantum data embedding to enhance classical ML models and emphasizes the importance of weighing performance improvements against computational costs. Future research may involve refining quantum encoding processes to optimize computational efficiency and explore scalability for real-world applications. Our work contributes to the growing body of knowledge on the intersection of quantum computing and classical machine learning, offering insights for researchers and practitioners seeking to harness the advantages of quantum-inspired techniques in practical scenarios.
Quantum computing has emerged as a promising technology for solving complex computational problems by leveraging the principles of quantum mechanics, including superposition and entanglement. Integrating quantum computing with classical machine learning offers a potential approach to improving learning capabilities and classification performance. This research proposes a Hybrid Quantum-Classical Machine Learning Framework that combines classical data preprocessing techniques with parameterized quantum circuits to perform classification tasks. The framework uses classical machine learning components for feature preprocessing and data encoding, while a variational quantum circuit extracts quantum representations of the input data. A classical optimizer updates the quantum circuit parameters iteratively to minimize a predefined classification loss function. The proposed framework is evaluated using benchmark classification datasets and compared with conventional machine learning models, including Support Vector Machines, Logistic Regression, and classical Neural Networks. Performance is assessed using accuracy, precision, recall, F1-score, computational cost, and training time. Experiments also investigate the effects of circuit depth, feature selection, and simulated quantum noise on classification performance. The framework is implemented using the PennyLane quantum simulation library alongside standard machine learning libraries. The study identifies the conditions under which hybrid quantum-classical learning can provide competitive classification performance and determines the practical limitations of current quantum machine learning approaches. The findings contribute to a better understanding of the effectiveness, scalability, and feasibility of hybrid quantum classical models for realworld classification problems.
Quantum computing has been proven to excel in factorization issues and unordered search problems due to its capability of quantum parallelism. This unique feature allows exponential speed-up in solving certain problems. However, this advantage does not apply universally, and challenges arise when combining classical and quantum computing to achieve acceleration in computation speed. This paper aims to address these challenges by exploring the current state of quantum machine learning and benchmarking the performance of quantum and classical algorithms in terms of accuracy. Specifically, we conducted experiments with three datasets for binary classification, implementing Support Vector Machine (SVM) and Quantum SVM (QSVM) algorithms. Our findings suggest that the QSVM algorithm outperforms classical SVM on complex datasets, and the performance gap between quantum and classical models increases with dataset complexity, as simple models tend to overfit with complex datasets. While there is still a long way to go in terms of developing quantum hardware with sufficient resources, quantum machine learning holds great potential in areas such as unsupervised learning and generative models. Moving forward, more efforts are needed to explore new quantum learning models that can leverage the power of quantum mechanics to overcome the limitations of classical machine learning.
Breast cancer is a major health concern, and early detection can make a great difference in treatment and survival rates for breast cancer patients. Machine learning methods have noticeably improved prediction accuracy on high-dimensional medical datasets and have become widely used tools in medical diagnostics. The transition to a quantum computational framework has opened new directions in machine learning research. By using qubits instead of classical bits, quantum models may provide new ways to represent and process complex medical data. In medical diagnostics, this has led to a growing interest in whether quantum approaches can improve classification performance more effectively than classical methods. The purpose of this paper is to compare classical and quantum machine learning models on the task of breast cancer classification and to determine whether quantum models can achieve higher accuracy and faster prediction on a selected dataset. Alongside the main simulator-based experiment, a smaller experiment was performed on a real IBM quantum computer to demonstrate the practical execution of the same task under current hardware constraints. In the practical part of the study, the Wisconsin Diagnostic Breast Cancer (WDBC) dataset was used. This dataset consists of 569 samples with 30 numerical features extracted from digitized fine needle aspirate images and provides a reliable basis for evaluating model performance. A comparative analysis was conducted between classical and quantum machine learning models, including a support vector machine (SVM), an artificial neural network (ANN), a quantum support vector machine (QSVM), and a hybrid quantum-classical neural network (QNN). In the simulator-based experiment, both SVM and ANN achieved an accuracy of 0.956 with an F1-score of 0.965 on the test set, while QSVM reached an accuracy of 0.807 with an F1-score of 0.866 and the Hybrid QNN achieved 0.623 accuracy with an F1-score of 0.677. These quantum and hybrid models also required substantially longer training times than the classical baselines. A small hardware experiment on an IBM quantum device further illustrates both the practical feasibility and the current limitations of executing this classification task on noisy intermediate-scale quantum hardware.
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.