IEEE International Conference on Advances in Computing Research on Science Engineering and Technology (ACROSET)
Quantum Kernel Encoding versus PCA-Based Dimensionality Reduction for Ayurvedic Prakriti Classification: A Comparative Analysis Using SVM and Hybrid Ensemble Models
It is an established practice in Ayurveda to classify human Prakriti from questionnaires, yet the machine learning aspect of it remains unexplored due to the availability of a dataset spanning over 40 to 132 categorical variables, with tension between dimensionality and small cohort size. This study directly compares Principal Component Analysis with derived quantum angle encoding to introduce the linear feature expansion by a quantum kernel to get a measurable classification advantage over PCA-based classical baselines on the same Prakriti dataset. The 105-feature dataset is preprocessed, ordinally encoded, standardized, and SMOTE-balanced. Eight PCA components are retained, capturing 37.9% of total variance; these form the shared representation for all models. Classical baselines (linear SVM, RBF SVM, Random Forest) operate directly on the eight PCA scores. The quantum pathway maps those scores to rotation angles and applies an analytic ZZ-kernel SVM. The ZZ-FeatureMap kernel is computed as a classical simulation, i.e., an analytic closed-form approximation evaluated in software, rather than executed on physical quantum hardware. A hybrid ensemble blends the quantum and classical predictions. The PCA SVM achieves 82.14% on the held-out test set, while the quantum kernel SVM reaches 98.21%. The hybrid ensemble achieves 98.21% with a five-fold cross-validated mean of 97.49%. The quantum feature map recovers the discriminative structure in the 256-dimensional ZZ-entanglement space that is absent from the 8-dimensional PCA subspace alone, with a 13.1-fold reduction in per-sample storage over raw features as a practical side benefit.
It is an established practice in Ayurveda to classify human Prakriti from questionnaires, yet the machine learning aspect of it remains unexplored due to the availability of a dataset spanning over 40 to 132 categorical variables, with tension between dimensionality and small cohort size. This study directly compares Principal Component Analysis with derived quantum angle encoding to introduce the linear feature expansion by a quantum kernel to get a measurable classification advantage over PCA-based classical baselines on the same Prakriti dataset. The 105-feature dataset is preprocessed, ordinally encoded, standardized, and SMOTE-balanced. Eight PCA components are retained, capturing 37.9% of total variance; these form the shared representation for all models. Classical baselines (linear SVM, RBF SVM, Random Forest) operate directly on the eight PCA scores. The quantum pathway maps those scores to rotation angles and applies an analytic ZZ-kernel SVM. The ZZ-FeatureMap kernel is computed as a classical simulation, i.e., an analytic closed-form approximation evaluated in software, rather than executed on physical quantum hardware. A hybrid ensemble blends the quantum and classical predictions. The PCA SVM achieves 82.14% on the held-out test set, while the quantum kernel SVM reaches 98.21%. The hybrid ensemble achieves 98.21% with a five-fold cross-validated mean of 97.49%. The quantum feature map recovers the discriminative structure in the 256-dimensional ZZ-entanglement space that is absent from the 8-dimensional PCA subspace alone, with a 13.1-fold reduction in per-sample storage over raw features as a practical side benefit.
Quantum kernel methods are often proposed as a route to improved medical image classification because quantum feature maps can embed data into high-dimensional Hilbert spaces. However, their practical value remains unclear when compared with strong classical kernels under leakage-controlled conditions. This study benchmarks two simulated quantum kernel support vector machines, QSVM-ZZ and QSVM-Pauli, against logistic regression, linear SVM, fixed-default RBF-SVM, and a compact multi-layer perceptron on BrainTumorMRI and BreastMNIST. All models used identical frozen ResNet18 features, train-only standardisation, PCA compression to four and eight dimensions, three random seeds, and matched classifier-training budgets where applicable. Across 24 seed-level matched comparisons, the best quantum kernel model never outperformed the best classical model. The mean quantum-minus-classical macro-F1 gap was - 0.2230, with all 24 gaps negative. Fixed pairwise comparisons confirmed that RBF-SVM exceeded both quantum kernels individually. QSVMs also required approximately 50 × to more than 220 × higher runtime. These findings show that, for compressed ResNet18 medical image features under noiseless simulation, the tested QSVM-ZZ and QSVM-Pauli kernels did not provide a practical advantage over fixed-default RBF-SVM.
Abstract Quantum kernel methods offer a potential advantage for classification tasks in high-dimensional feature spaces, yet their practical benefit critically depends on how input features are prepared. We compare five dimensionality reduction strategies—principal component analysis (PCA), Gaussian random projection (RP Gaussian), sparse random projection (RP Sparse), partial least squares (PLS), and uniform manifold approximation and projection (UMAP) — as pre-processing steps for quantum kernel support vector machines (SVMs) applied to trabecular bone classification from synthetic micro-computed tomography (micro-CT) data. Using a custom procedural generator based on Gaussian random field zero-crossings, we produced 500 synthetic trabecular bone volumes with controlled morphometric properties such as bone volume fraction (BV/TV), trabecular thickness (Tb.Th), number (Tb.N) and spacing (Tb.Sp). Texture features extracted from grayscale slices are reduced to 8-dimensional quantum circuit inputs via each method, then classified using both classical radial basis function (RBF)-SVMs and quantum kernel SVMs with ZZ feature maps on a statevector simulator, both evaluated with 5 × 5 repeated stratified cross-validation (25 folds). Our results show that UMAP is the only reduction method where the quantum kernel remains competitive with the classical baseline. Under repeated cross-validation, UMAP showed a +0.032 accuracy gap favouring the quantum kernel (Dietterich 5 × 2 CV p = 0.177); however, validation on 10 fully independent datasets—each with independently generated samples, separate reduction fits, and separate kernel matrices — reversed the sign to −0.030 (paired t -test p = 0.123; Wilcoxon p = 0.193; quantum wins 3/10 datasets), indicating that the apparent advantage was likely inflated by fold dependence. Nevertheless, UMAP’s gap remains small and non-significant in both analyses, whereas all linear methods (PCA, RP Gaussian, PLS) show substantial quantum deficits of −0.090 to −0.116 across BV/TV classification, with PCA and PLS remaining significant under corrected tests (5 × 2 CV p = 0.004 and p = 0.007 respectively). We additionally evaluate quantum kernel ridge regression for continuous morphometric prediction, finding that ZZ quantum kernels fail uniformly at regression (negative R 2 for all methods except PLS at 4 qubits), suggesting that the ZZ kernel captures decision boundaries but not smooth metric structure. These findings provide practical guidance for feature engineering in near-term quantum machine learning pipelines and demonstrate that the choice of dimensionality reduction can determine whether quantum kernels remain competitive with classical baselines.
Recently, there has been growing attention on combining quantum machine learning (QML) with classical deep learning approaches as computational techniques are key to improving the performance of image classification tasks.This study presents a hybrid approach that uses ResNet-50 (Residual Network) for feature extraction and Quantum Support Vector Machines (QSVM) for classification in the context of potato disease detection. Classical machine learning as well as deep learning models often struggle with high-dimensional and complex datasets necessitating advanced techniques like quantum computing to improve classification efficiency.In our research, we use ResNet-50 to extract deep feature representations from RGB images of potato diseases. These features are then subjected to dimensionality reduction using PCA (Principal Component Analysis). The resulting features are processed through QSVM models which apply various quantum feature maps—such as ZZ, Z and Pauli-X to transform classical data into quantum states. To assess the model’s performance we compared it with classical ML such as Support Vector Machine (SVM) and Random Forest (RF) using 5-fold stratified cross-validation for a comprehensive evaluation. The experimental results demonstrate that the Z-feature map-based QSVM outperforms classical models achieving an accuracy of 99.23% surpassing both SVM and RF models.This research highlights the advantages of integrating quantum computing into image classification and also provides disease detection solution into the potential of hybrid quantum-classical model.
Variational quantum classifiers (VQCs) are often compared with classical models under unequal data partitions, tuning budgets, or statistical treatment. We benchmark a 4-qubit VQC against logistic regression, an RBF-SVM, random forest, a quantum-kernel SVM (QSVM), and a majority-class control on Breast Cancer Wisconsin (n=569), Coimbra (n=116), and Golub leukemia (n=72), using five stratified folds across five seeds (25 paired blocks per dataset), identical training-fold-fitted preprocessing, and Nadeau–Bengio corrected paired tests with Holm correction. A first arm with a frozen configuration and the common [0, π] angle encoding left the VQC at 0.563, 0.515, and 0.576 accuracy (majority 0.617, 0.552, 0.652). In a second arm, in which every model was tuned by the same inner cross-validation and the encoding scale was a tuned hyperparameter, VQC accuracy rose to 0.864, 0.616, and 0.747. On Wisconsin the VQC stayed significantly below every matched classical model (differences 0.079–0.097, Holm p≤0.006) but above the majority class; on Golub it was significantly below only the SVM (Holm p=0.016); on Coimbra no comparison was significant. A QSVM with the same feature map exceeded the VQC numerically on every dataset, and three optimizers reached the same training loss in pilot diagnostics, pointing to the encoding and the variational head rather than the optimizer. The Wisconsin arms also differ in sample size (120 versus 569). Results apply to this low-qubit, PCA-compressed, exactly simulated setting and do not indicate a quantum advantage.
High-dimensional biomedical learning frequently suffers from fragile generalization and weak explanatory value when latent representations are optimized for variance alone. This study proposes an interpretable pipeline that couples Quantum Principal Component Analysis (Quantum PCA) with quantum kernel similarity learning to produce low-dimensional structure that remains predictive, geometrically faithful, and biologically auditable. Experiments were conducted on a harmonized cohort of n = 1038 samples with d = 2048 features across C = 3 diagnostic classes and 7 batch partitions. Compared with Classical PCA + SVM, Quantum PCA + SVM improved Macro-F1 from 0.821 to 0.848 and AUROC from 0.889 to 0.910, while reducing ECE from 0.044 to 0.038. Quantum Kernel SVM achieved the strongest discrimination with Macro-F1 0.868 and AUROC 0.923, while maintaining controlled calibration (ECE 0.039). Embedding diagnostics showed improved neighborhood preservation, with trustworthiness T(15) increasing from 0.916 under classical embeddings to 0.927 under Quantum PCA and 0.934 under quantum kernel geometry. Interpretability audits demonstrated stable component semantics, with loading stability ICC reaching 0.86 for PC1 and pathway enrichment attaining median FDR-adjusted significance on the order of 10-4. Robustness analysis under depolarizing perturbations exhibited gradual degradation, with Macro-F1 decreasing from 0.874 to 0.832 as noise increased to (p=0.010), and finite-shot sensitivity showing diminishing returns beyond 4096 shots as kernel variance stabilized. These results indicate that combining Quantum PCA and quantum kernels yields interpretable dimensionality reduction that improves predictive validity while preserving biomedical structure under practical constraints.
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.