Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Quantum Artificial Intelligence

Quantum PCA and Quantum Kernels for Interpretable Dimensionality Reduction in High-Dimensional Biomedical Data

Isnandar Agus

Published Oct 27, 2026• 0 citations
PDF (CC BY)Publisher

Abstract

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.

DOI
10.63913/jqai.v1i3.14

Related papers

Supervised Latent Restructuring for Fixed and Adaptive Quantum Kernel Learning in Small-Data Image Classification

Alakananda Mitra, David H. Fleisher, Chittaranjan Ray +1 more

Fine-grained image classification under limited labeled data presents a representation challenge: pretrained deep networks provide rich but high-dimensional features, whereas small-data learning and practical quantum encoding require substantially more compact representations. Direct dimensionality reduction can make such features computationally tractable but may not preserve the class-discriminative geometry needed for effective kernel learning. This study, therefore, examines whether supervised latent restructuring can produce a compact, class-aware, qubit-compatible representation that supports classical and quantum-kernel learning. EfficientNet-B0 embeddings were reduced from 1280 to 64 dimensions using PCA and subsequently restructured by LDA into an 11-dimensional Supervised Latent Restructuring (SLR) representation. SLR increased the held-out Silhouette coefficient from −0.0054 in PCA64 to 0.0490; however, predictive effects were model dependent: Random Forest and XGBoost improved, Linear SVM changed little, and RBF-SVM favored PCA64. A dimension-matched PCA11 control showed no consistent predictive advantage of SLR over PCA11 across the evaluated classifiers. Under the original 12-class taxonomy, the fixed quantum kernel remained below matched classical baselines. Under a broader three-group taxonomy, quantum-kernel performance improved with increasing training support, but RBF-SVM remained the strongest. $\gamma $ -only Quantum Kernel Alignment did not consistently outperform the fixed kernel and incurred up to $420\times $ greater runtime than the fixed kernel. Target-control and kernel-structure analyses showed that increased alignment produced little additional class-discriminative structure. Overall, the study shows that representation geometry, label granularity, numerical scaling, and adaptive feature scaling jointly influence small-data quantum-kernel learning; no quantum advantage was demonstrated.

IEEE Access•Jan 1, 2026•0 citations

Quantum Kernel Encoding versus PCA-Based Dimensionality Reduction for Ayurvedic Prakriti Classification: A Comparative Analysis Using SVM and Hybrid Ensemble Models

Riddhi Jayant Hedaoo, Sanket Gupta

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.

IEEE International Conference on Advances in Computing Research on Science Engineering and Technology (ACROSET)•Sep 1, 2026•0 citations

A Hybrid Dimensionality Reduction and Quantum Support Vector Machine for Breast Cancer Diagnosis

Hằng Đặng, My Nguyen, Van Tran +1 more

Quantum Support Vector Machines (QSVMs) have recently emerged as a promising approach for biomedical classification tasks. However, their practical deployment remains constrained by limited qubit availability and sensitivity to high-dimensional feature spaces. This study proposes a hybrid framework integrating Pearson correlation–based feature selection and Principal Component Analysis (PCA) with QSVM for breast cancer diagnosis. First, Pearson correlation analysis is employed to remove redundant and weakly relevant features. Subsequently, PCA projects the selected attributes into a compact subspace while preserving most of the original data variance. This dimensionality reduction strategy decreases the number of qubits required for quantum encoding and improves computational efficiency. Experiments conducted on the Wisconsin Diagnostic Breast Cancer (WDBC) dataset demonstrate that the proposed hybrid QSVM achieves 98% classification accuracy, outperforming or matching existing classical and quantum-based approaches. The results confirm that combining classical preprocessing techniques with quantum classifiers provides a robust and resource-efficient solution for biomedical data analysis.

Smart Systems and Devices•May 6, 2026•0 citations

Quantum Kernel Methods for Calibrated and Interpretable Neuroimaging Classification in Computational Psychiatry

Mouna Kettani, F. M. Abbou, Farid Abdi +2 more

Abstract Psychiatric disorders such as attention deficit hyperactivity disorder, schizophrenia, and bipolar disorder are notoriously difficult to distinguish on neuroimaging alone, owing to overlapping symptom profiles and heterogeneous neurobiological substrates. Conventional machine learning classifiers applied to structural MRI and electroencephalography data have shown modest discriminative performance and, more critically, tend to produce poorly calibrated probability estimates that limit their utility in clinical decision-making. We present a dual-pipeline framework in which quantum kernel support vector machines are applied independently to MRI-derived morphometric features and to EEG spectral representations, followed by rigorous post-hoc calibration and interpretability analyses. On the UCLA Consortium for Neuropsychiatric Phenomics dataset, a 4-qubit quantum kernel SVM achieved an AUC of 0.957 and a Matthews correlation coefficient of 0.679 for ADHD versus control discrimination, while a tuned classical radial basis function SVM performed at chance (AUC=0.497). For EEG-based emotion and cognitive state classification, a hybrid quantum-classical kernel outperformed both its pure quantum and classical counterparts (AUC=0.841 versus 0.824 and 0.812, respectively). Temperature scaling reduced expected calibration error by 85% for the MRI pipeline and by 49% for the EEG pipeline. Multimodal fusion of the two quantum kernel Gram matrices yielded an ECE of 0.0075, the lowest observed across all experimental configurations. Gradient-weighted class activation mapping and Shapley additive explanations recovered neurobiologically established signatures of ADHD and psychotic disorder in prefrontal, cingulate, and basal ganglia regions, lending biological credibility to the learned representations. Taken together, these results indicate that quantum kernel methods can confer genuine advantages over classical baselines in small-sample neuroimaging settings, and that the resulting models can be made reliable enough for clinical deployment through standard calibration procedures.

•Jul 10, 2026•0 citations

Supervised Latent Restructuring for Small-Data Quantum Learning in Plant Phenomics

Alakananda Mitra, David H. Fleisher, Vangimalla R. Reddy +1 more

High-dimensional biological data often exhibit a severe mismatch between feature dimensionality and sample size, making reliable classification difficult in extremely small-data regimes. In these settings, kernel methods can lose discriminative power when latent compression fails to preserve class-separating structure. We study this problem in fine-grained plant phenomics and propose a hybrid workflow that compresses 1280-dimensional deep image embeddings into a 64-dimensional PCA space and then restructures them into an 11-dimensional supervised latent space using Linear Discriminant Analysis (LDA), followed by GPU-accelerated Quantum Kernel Alignment (QKA) on NVIDIA L40S hardware. Empirically, supervised latent restructuring substantially improves the geometric separability of the compressed representation, increasing the Silhouette coefficient from 0.003 in the raw embedding space and -0.006 in PCA-64 to 0.197 in the supervised LDA-11 space. However, downstream classical evaluation reveals a clear compression trade-off: Linear SVM and XGBoost improve in the restructured latent space, whereas RBF-SVM and Random Forest degrade under the same 11-dimensional bottleneck. Under a constrained optimization budget, QKA in this regime remains challenging, indicating that latent geometry alone is not sufficient for strong trainable quantum performance. These findings position representation geometry as a central design variable in small-data quantum learning and expose the practical difficulty of recovering nonlinear discriminative structure from aggressively compressed biological representations.

arXiv:2605.20413•May 19, 2026•0 citations

A comparative evaluation of quantum machine learning architectures for breast cancer classification using clinical and genomic data

Saartak Allena, Smrithy Girijakumari Sreekantan Nair, Balaji Chandrasekaran

Introduction: In recent years, high-dimensional clinical and genomic data have gained significant importance for prognosis and personalized medicine in breast cancer. But the use of quantum machine learning (QML) on such data is limited by the availability of few qubits, the computation time of quantum simulation, and dimensionality reduction. This work systematically compares several QML architectures for breast cancer classification in the presence of realistic and simulator constraints. Methods: The experiments were performed on a dataset of METABRIC breast cancer patients (2,509 patients). After handling missing values and one-hot encoding, there were 63 features in the processed data set. The feature space was reduced by Principal Component Analysis (PCA) to 12, 4 and 2 components for the implementations of quantum computers, respectively, with 56.10 ± 0.14%, 26.78 ± 0.57% and 16.23 ± 0.33% of the variance retained. Three QML models were tested: Quantum Neural Networks (QNN), Quantum K-Nearest Neighbors (QKNN), and Quantum Support Vector Machines (QSVM), with the models being simulated. Seven classical classification models were tested: Logistic Regression, SVM with RBF kernel, K-Nearest Neighbors, Random Forest, XGBoost, LightGBM and Multilayer Perceptron, both with PCA-matched and full 63-feature representation. All primary results are reported with 5-fold cross validation. Results: Among the evaluated QML architectures, QKNN using 12 principal components achieved the strongest performance, attaining an accuracy of **75.11% ± 3.76%**, an F1-score of **0.7088 ± 0.0433**, and a ROC-AUC of **0.8148 ± 0.0394**. Even though all of the QML models performed significantly poorly in comparison to classical models trained on the entire 63-feature data set, the latter models were able to achieve about **94% accuracy** with XGBoost, Random Forest, and Logistic Regression. The comparison also showed the effect of information loss due to PCA is significant in predictive performance in both classical and quantum models. Discussion: The results show that for high dimensional breast cancer data, currently available simulator-based QML models can learn meaningful patterns with limited quantum resources, but are not as effective as powerful classical machine learning models when complete feature representations are available. The study does not report any sort of quantum advantage or clinical use, but rather a benchmark of current QML architectures that has been rigorously calculated and repeated, with a focus on the impact of dimensionality reduction, validation approaches, and simulator limitations, as well as outlining challenges that need to be overcome prior to practical implementation on real quantum hardware.

Frontiers in Artificial Intelligence•Jul 29, 2026•1 citation
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.
Fine-grained image classification under limited labeled data presents a representation challenge: pretrained deep networks provide rich but high-dimensional features, whereas small-data learning and practical quantum encoding require substantially more compact representations. Direct dimensionality reduction can make such features computationally tractable but may not preserve the class-discriminative geometry needed for effective kernel learning. This study, therefore, examines whether supervised latent restructuring can produce a compact, class-aware, qubit-compatible representation that supports classical and quantum-kernel learning. EfficientNet-B0 embeddings were reduced from 1280 to 64 dimensions using PCA and subsequently restructured by LDA into an 11-dimensional Supervised Latent Restructuring (SLR) representation. SLR increased the held-out Silhouette coefficient from −0.0054 in PCA64 to 0.0490; however, predictive effects were model dependent: Random Forest and XGBoost improved, Linear SVM changed little, and RBF-SVM favored PCA64. A dimension-matched PCA11 control showed no consistent predictive advantage of SLR over PCA11 across the evaluated classifiers. Under the original 12-class taxonomy, the fixed quantum kernel remained below matched classical baselines. Under a broader three-group taxonomy, quantum-kernel performance improved with increasing training support, but RBF-SVM remained the strongest. $\gamma $ -only Quantum Kernel Alignment did not consistently outperform the fixed kernel and incurred up to $420\times $ greater runtime than the fixed kernel. Target-control and kernel-structure analyses showed that increased alignment produced little additional class-discriminative structure. Overall, the study shows that representation geometry, label granularity, numerical scaling, and adaptive feature scaling jointly influence small-data quantum-kernel learning; no quantum advantage was demonstrated.
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 Support Vector Machines (QSVMs) have recently emerged as a promising approach for biomedical classification tasks. However, their practical deployment remains constrained by limited qubit availability and sensitivity to high-dimensional feature spaces. This study proposes a hybrid framework integrating Pearson correlation–based feature selection and Principal Component Analysis (PCA) with QSVM for breast cancer diagnosis. First, Pearson correlation analysis is employed to remove redundant and weakly relevant features. Subsequently, PCA projects the selected attributes into a compact subspace while preserving most of the original data variance. This dimensionality reduction strategy decreases the number of qubits required for quantum encoding and improves computational efficiency. Experiments conducted on the Wisconsin Diagnostic Breast Cancer (WDBC) dataset demonstrate that the proposed hybrid QSVM achieves 98% classification accuracy, outperforming or matching existing classical and quantum-based approaches. The results confirm that combining classical preprocessing techniques with quantum classifiers provides a robust and resource-efficient solution for biomedical data analysis.
Abstract Psychiatric disorders such as attention deficit hyperactivity disorder, schizophrenia, and bipolar disorder are notoriously difficult to distinguish on neuroimaging alone, owing to overlapping symptom profiles and heterogeneous neurobiological substrates. Conventional machine learning classifiers applied to structural MRI and electroencephalography data have shown modest discriminative performance and, more critically, tend to produce poorly calibrated probability estimates that limit their utility in clinical decision-making. We present a dual-pipeline framework in which quantum kernel support vector machines are applied independently to MRI-derived morphometric features and to EEG spectral representations, followed by rigorous post-hoc calibration and interpretability analyses. On the UCLA Consortium for Neuropsychiatric Phenomics dataset, a 4-qubit quantum kernel SVM achieved an AUC of 0.957 and a Matthews correlation coefficient of 0.679 for ADHD versus control discrimination, while a tuned classical radial basis function SVM performed at chance (AUC=0.497). For EEG-based emotion and cognitive state classification, a hybrid quantum-classical kernel outperformed both its pure quantum and classical counterparts (AUC=0.841 versus 0.824 and 0.812, respectively). Temperature scaling reduced expected calibration error by 85% for the MRI pipeline and by 49% for the EEG pipeline. Multimodal fusion of the two quantum kernel Gram matrices yielded an ECE of 0.0075, the lowest observed across all experimental configurations. Gradient-weighted class activation mapping and Shapley additive explanations recovered neurobiologically established signatures of ADHD and psychotic disorder in prefrontal, cingulate, and basal ganglia regions, lending biological credibility to the learned representations. Taken together, these results indicate that quantum kernel methods can confer genuine advantages over classical baselines in small-sample neuroimaging settings, and that the resulting models can be made reliable enough for clinical deployment through standard calibration procedures.
High-dimensional biological data often exhibit a severe mismatch between feature dimensionality and sample size, making reliable classification difficult in extremely small-data regimes. In these settings, kernel methods can lose discriminative power when latent compression fails to preserve class-separating structure. We study this problem in fine-grained plant phenomics and propose a hybrid workflow that compresses 1280-dimensional deep image embeddings into a 64-dimensional PCA space and then restructures them into an 11-dimensional supervised latent space using Linear Discriminant Analysis (LDA), followed by GPU-accelerated Quantum Kernel Alignment (QKA) on NVIDIA L40S hardware. Empirically, supervised latent restructuring substantially improves the geometric separability of the compressed representation, increasing the Silhouette coefficient from 0.003 in the raw embedding space and -0.006 in PCA-64 to 0.197 in the supervised LDA-11 space. However, downstream classical evaluation reveals a clear compression trade-off: Linear SVM and XGBoost improve in the restructured latent space, whereas RBF-SVM and Random Forest degrade under the same 11-dimensional bottleneck. Under a constrained optimization budget, QKA in this regime remains challenging, indicating that latent geometry alone is not sufficient for strong trainable quantum performance. These findings position representation geometry as a central design variable in small-data quantum learning and expose the practical difficulty of recovering nonlinear discriminative structure from aggressively compressed biological representations.
Introduction: In recent years, high-dimensional clinical and genomic data have gained significant importance for prognosis and personalized medicine in breast cancer. But the use of quantum machine learning (QML) on such data is limited by the availability of few qubits, the computation time of quantum simulation, and dimensionality reduction. This work systematically compares several QML architectures for breast cancer classification in the presence of realistic and simulator constraints. Methods: The experiments were performed on a dataset of METABRIC breast cancer patients (2,509 patients). After handling missing values and one-hot encoding, there were 63 features in the processed data set. The feature space was reduced by Principal Component Analysis (PCA) to 12, 4 and 2 components for the implementations of quantum computers, respectively, with 56.10 ± 0.14%, 26.78 ± 0.57% and 16.23 ± 0.33% of the variance retained. Three QML models were tested: Quantum Neural Networks (QNN), Quantum K-Nearest Neighbors (QKNN), and Quantum Support Vector Machines (QSVM), with the models being simulated. Seven classical classification models were tested: Logistic Regression, SVM with RBF kernel, K-Nearest Neighbors, Random Forest, XGBoost, LightGBM and Multilayer Perceptron, both with PCA-matched and full 63-feature representation. All primary results are reported with 5-fold cross validation. Results: Among the evaluated QML architectures, QKNN using 12 principal components achieved the strongest performance, attaining an accuracy of **75.11% ± 3.76%**, an F1-score of **0.7088 ± 0.0433**, and a ROC-AUC of **0.8148 ± 0.0394**. Even though all of the QML models performed significantly poorly in comparison to classical models trained on the entire 63-feature data set, the latter models were able to achieve about **94% accuracy** with XGBoost, Random Forest, and Logistic Regression. The comparison also showed the effect of information loss due to PCA is significant in predictive performance in both classical and quantum models. Discussion: The results show that for high dimensional breast cancer data, currently available simulator-based QML models can learn meaningful patterns with limited quantum resources, but are not as effective as powerful classical machine learning models when complete feature representations are available. The study does not report any sort of quantum advantage or clinical use, but rather a benchmark of current QML architectures that has been rigorously calculated and repeated, with a focus on the impact of dimensionality reduction, validation approaches, and simulator limitations, as well as outlining challenges that need to be overcome prior to practical implementation on real quantum hardware.