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.
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.
Quantum computing offers a powerful new paradigm for enhancing classical machine learning, particularly in classification tasks. In this paper, we examine the use of quantum kernels within Support Vector Classification (SVC) and compare their performance to classical SVC. Our experiments focus on the Iris and Wine datasets. For the Wine dataset, we applied Principal Component Analysis (PCA), reducing the feature space from 13 to 4 dimensions to improve computational efficiency. The results demonstrate that Quantum-enhanced SVC (QSVC) outperforms classical SVC, achieving an accuracy improvement from 96.15% with classical SVM to 98.05% with QSVC for the Wine dataset. Similarly, for the Iris dataset, classical SVC achieves near-perfect accuracy at 100%, while QSVC closely follows with 97.25% accuracy. These results highlight the capability of quantum kernels to improve both accuracy and efficiency in classification tasks, providing a promising direction for scalable quantum-classical hybrid systems in machine learning.
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.
Over The past decade, quantum computing and machine learning have each witnessed tremendous growth in their respective fields. While quantum computing promises a completely novel paradigm for computation, based on the principles of superposition, entanglement, and interference, machine learning has firmly cemented its place in the sphere of data-driven decision-making. This paper seeks to provide a practical solution to this question, implementing a quantum classical learning system that is capable of performing binary classification tasks. We achieve this through the creation of a Quantum Kernel Support Vector Classifier (QSVC) using the Qiskit framework. While the classical feature set from the Iris dataset is scaled appropriately for the quantum system, the feature set is then represented in the quantum state through the ZZFeatureMap circuit. The QSVC utilizes the kernel-based similarity between quantum states. The results were promising, with the QSVC obtaining a classification accuracy of 92% over a test set, with the model trained in 6.32 seconds on a simulated quantum backend. The decision boundaries learned by the model were complex, and the quantum kernel representation of the feature set was able to capture the underlying class structure, which would have been difficult to achieve in a classical low-dimensional feature space. Our method, with quantum circuits relegated to state preparation and measurement while leaving the optimization to classical processes, is designed to operate within these limits. This makes our method not only theoretically interesting but also immediately applicable to existing simulators and quantum hardware.
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%.
This study explores the performance of Quantum Support Vector Classifiers (QSVCs) and Quantum Neural Networks (QNNs) in comparison to classical models for machine learning tasks. By evaluating these models on the Iris and MNIST-PCA datasets, we find that quantum models tend to outperform classical approaches as the problem complexity increases. While QSVCs generally provide more consistent results, QNNs exhibit superior performance in higher-complexity tasks due to their increased quantum load. Additionally, we analyze the impact of hyperparameter tuning, showing that feature maps and ansatz configurations significantly influence model accuracy. We also compare the PennyLane and Qiskit frameworks, concluding that Qiskit provides better optimization and efficiency for our implementation. These findings highlight the potential of Quantum Machine Learning (QML) for complex classification problems and provide insights into model selection and optimization strategies
Quantum Machine Learning (QML) combines quantum computing principles and traditional machine learning principles to provide new ways to solve difficult classification problems through the use of quantum technology. The goal of this paper is to implement a Quantum Kernel Support Vector Machine (QKSVM) using PennyLane and evaluate it against a standard image classification dataset, Fashion-MNIST. The Fashion-MNIST images are represented as 28x28 grayscale pixel arrays; they are normalized using a min-max normalizer with output values between zero and one. The 28x28 arrays are then dimensionally reduced to a size of four principal components (approximately 85% cumulative explained variance), and the QKSVM will utilize a quantum circuit limited to four qubits which is consistent with today's Noisy, Intermediate-Scale Quantum (NISQ) capabilities for performing simulations. Each input feature is represented as a qubit via an RY rotation and the qubits are then entangled using a CNOT circuit to generate the quantum kernel matrix, which is computed as the pairwise fidelity of each input image's state, which is subsequently used by a classical SVM classifier implementing a one-versus-all classification method. The QKSVM achieved approximately 40% accuracy and a macro-F1 score of 0.37 on a 100 sample stratified subset of the Fashion-MNIST test dataset, compared with 60% and 91.2%, respectively, using a classical Radial Basis Function Support Vector Machine (RBF-SVM) classifier with the same four principal components of input features and a Convolutional Neural Network (CNN) with full input images. With a primary bottleneck of qubit count, circuit depth, and shot noise, this work serves as a fully documented and reproducible baseline for future research on quantifying the performance of hybrid classical and quantum image classifiers across standardized image dataset benchmarks.