International Journal of Electrical and Electronics Research

Performance Analysis of Quantum Classifier on Benchmarking Datasets

Tarun Kumar, Dilip Kumar, Gurmohan Singh

Published Jun 30, 2022• 8 citations

Abstract

Quantum machine learning (QML) is an evolving field which is capable of surpassing the classical machine learning in solving classification and clustering problems. The enormous growth in data size started creating barrier for classical machine learning techniques. QML stand out as a best solution to handle big and complex data. In this paper quantum support vector machine (QSVM) based models for the classification of three benchmarking datasets namely, Iris species, Pumpkin seed and Raisin has been constructed. These QSVM based classification models are implemented on real-time superconducting quantum computers/simulators. The performance of these classification models is evaluated in the context of execution time and accuracy and compared with the classical support vector machine (SVM) based models. The kernel based QSVM models for the classification of datasets when run on IBMQ_QASM_simulator appeared to be 232, 207 and 186 times faster than the SVM based classification model. The results indicate that quantum computers/algorithms deliver quantum speed-up.

DOI: 10.37391/ijeer.100252

Related papers

Implementation of Quantum Support Vector Machine Algorithm Using a Benchmarking Dataset

The evolution of quantum computers and quantum machine learning (QML) algorithms have started demonstrating exponential speed-ups. In machine learning problems, the efficient handling and manipulation of linear algebra subroutines defines the complexity of the task to be performed. Quantum computers handle big datasets in the form of vectors and matrix operations very efficiently. In this paper, quantum support vector machine (QSVM) algorithm is used to solve a classification problem using a benchmarking MNIST dataset of handwritten images of digits. Quantum SVM variational and kernel matrix algorithms are implemented to analyze quantum speedup on quantum simulator and physical quantum processor back-ends. The study compared classical and quantum SVM algorithms in terms of execution time and accuracy. The results explicitly prove quantum speed-up achieved by quantum classifiers on quantum back-ends for machine learning applications.

Indian Journal of Pure & Applied PhysicsApr 28, 202223 citations

Accuracy and processing speed trade-offs in classical and quantum SVM classifier exploiting PRISMA hyperspectral imagery

Riyaaz Uddien Shaik, Shoba Periasamy

Quantum machine learning (QML) focuses on machine learning models developed explicitly for quantum computers. Availability of the first quantum processor led to further research, particularly exploring possible practical applications of QML algorithms in the remote sensing field. The demand for extensive field data for remote sensing applications has started creating bottlenecks for classical machine learning algorithms. QML is becoming a potential solution to tackle big data problems as it can learn from fewer data. This paper presents a QML model based on a quantum support vector machine (QSVM) to classify Holm Oak trees using PRISMA hyperspectral Imagery. Implementation of quantum models was carried on a quantum simulator and a real-time superconducting quantum processor of IBM. The performance of the QML model is validated in terms of dataset size, overall accuracy, number of qubits, training and predicting speed. Results were indicative that (i) QSVM offered 5% higher accuracy than classical SVM (CSVM) with 50 samples and ≥12 qubits/feature dimensions whereas with 20 samples at 16 Qubits/feature dimension, (ii) training time for QSVM at maximum accuracy was 284 s with 50 samples and with 20 samples was 53.68 s and (iii) predicting time for 400 pixels using the QSVM model trained with 50 samples dataset was 5243 s whereas with 20 samples dataset was 2845 s. Results were indicative that QML offers better accuracy but lack training and predicting speed for hyperspectral data. Another observation is that predicting speed of QSVM depends on the number of samples used to train the model.

International Journal of Remote SensingApr 22, 202219 citations

Brain Tumour Classification Using Quantum Support Vector Machine Learning Algorithm

Tarun Kumar, Dilip Kumar, Gurmohan Singh

Quantum computing is an emerging field that can effectively solve several machine learning problems. The immensely growing data size has begun to create barriers for classical machine learning algorithms. Quantum computers proficiently handle and process big data composed of metrics and vectors. This paper presents the quantum machine learning model based on quantum support vector machines (QSVM) to classify brain tumours into malignant and benign. The dataset used in this experiment is Brats 2015, available on Kaggle. The QSVM-based model was run on real-time quantum machines and simulators to extract the performance metrics in terms of accuracy and execution time. The QSVM classification model is compared with its classical SVM equivalent. The kernel-based QSVM model implementation on a 32-qubit quantum simulator was 188 times faster with 95% accuracy which is 1.60% better than the classical equivalent. Similarly, the model takes 24.19% less time than the classical SVM model when realized on a 5-qubit real-time superconducting processor with the same accuracy. Hence, the results reveal that quantum machine learning models implemented on quantum computers outperformed their classical equivalents.

IETE Journal of ResearchAug 13, 202334 citations

Pancreatic Cancer Data Classification with Quantum Machine Learning

Amit Kumar Saxena, Smita Saxena

Quantum computing is a promising new approach to tackle the complex real-world computational problems by harnessing the power of quantum mechanics principles. The inherent parallelism and exponential computational power of quantum systems hold the potential to outpace classical counterparts in solving complex optimization problems, which are pervasive in machine learning. Quantum Support Vector Machine (QSVM) is a quantum machine learning algorithm inspired by classical Support Vector Machine (SVM) that exploits quantum parallelism to efficiently classify data points in high-dimensional feature spaces. We provide a comprehensive overview of the underlying principles of QSVM, elucidating how different quantum feature maps and quantum kernels enable the manipulation of quantum states to perform classification tasks. Through a comparative analysis, we reveal the quantum advantage achieved by these algorithms in terms of speedup and solution quality. As a case study, we explored the potential of quantum paradigms in the context of a real-world problem: classifying pancreatic cancer biomarker data. The Support Vector Classifier (SVC) algorithm was employed for the classical approach while the QSVM algorithm was executed on a quantum simulator provided by the Qiskit quantum computing framework. The classical approach as well as the quantum-based techniques reported similar accuracy. This uniformity suggests that these methods effectively captured similar underlying patterns in the dataset. Remarkably, quantum implementations exhibited substantially reduced execution times demonstrating the potential of quantum approaches in enhancing classification efficiency. This affirms the growing significance of quantum computing as a transformative tool for augmenting machine learning paradigms and also underscores the potency of quantum execution for computational acceleration.

Journal of quantum computingJan 1, 202310 citations

Quantum Machine Learning: Enhancing Algorithms through Quantum Neural Networks and Data Analysis

Rakesh Sengupta, Usha Desai, Anand Singh Rajawat +3 more

This paper evaluates the performance of two quantum machine learning algorithms: Quantum Support Vector Machine (QSVM) and Quantum Principal Component Analysis (Q-PCA). The scalability of QSVM is analyzed across increasing dataset sizes and feature dimensions, revealing faster-than-linear growth in kernel evaluation and SVM training times. However, this computational overhead is accompanied by a notable decline in classification accuracy, highlighting challenges in applying QSVM to larger or more complex datasets. In contrast, Q-PCA demonstrates near-linear scalability with dataset size and qubit count, leveraging the independence of quantum circuit execution and structured operations to maintain efficiency. A QNN-based implementation of Q-PCA further validates its ability to align data with principal components, maximize variance, and enable effective dimensionality reduction. These findings emphasize the potential of Q-PCA for efficient quantum-enhanced data analysis while underscoring the need for optimization in QSVM and further exploration of Q-PCA’s capabilities for real-world quantum computing applications.

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

Implementation and Performance Evaluation of Quantum Machine Learning Algorithms for Binary Classification

Surajudeen Shina Ajibosin, Deniz Çetinkaya

In this work, we studied the use of Quantum Machine Learning (QML) algorithms for binary classification and compared their performance with classical Machine Learning (ML) methods. QML merges principles of Quantum Computing (QC) and ML, offering improved efficiency and potential quantum advantage in data-driven tasks and when solving complex problems. In binary classification, where the goal is to assign data to one of two categories, QML uses quantum algorithms to process large datasets efficiently. Quantum algorithms like Quantum Support Vector Machines (QSVM) and Quantum Neural Networks (QNN) exploit quantum parallelism and entanglement to enhance performance over classical methods. This study focuses on two common QML algorithms, Quantum Support Vector Classifier (QSVC) and QNN. We used the Qiskit software and conducted the experiments with three different datasets. Data preprocessing included dimensionality reduction using Principal Component Analysis (PCA) and standardization using scalers. The results showed that quantum algorithms demonstrated competitive performance against their classical counterparts in terms of accuracy, while QSVC performed better than QNN. These findings suggest that QML holds potential for improving computational efficiency in binary classification tasks. This opens the way for more efficient and scalable solutions in complex classification challenges and shows the complementary role of quantum computing.

SoftwareNov 28, 202420 citations