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

arXiv:2605.20413

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

Alakananda Mitra, David H. Fleisher, Vangimalla R. Reddy, Chittaranjan Ray

Published May 19, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2605.20413

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 PCA and Quantum Kernels for Interpretable Dimensionality Reduction in High-Dimensional Biomedical Data

Isnandar Agus

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.

Journal of Quantum Artificial Intelligence•Oct 27, 2026•0 citations

Prototype-Guided Optimization of Quantum Data Embeddings with Linear Cost

Seokhoon Jeong, Daniel K. Park

In supervised quantum machine learning with classical data, classification performance critically depends on the geometry induced by quantum data embedding. Existing data-adaptive approaches rely on pairwise fidelity evaluations between samples, which scale as $O(B^2)$ for $B$ samples and create a computational bottleneck in iterative embedding optimization. To address this issue, we propose a prototype-guided framework for efficient data-adaptive quantum embedding. Using class-prototype separation and sample-to-prototype compactness, we derive a measurable lower certificate for class-ensemble distinguishability and construct a prototype-based objective requiring only $O(B)$ fidelity evaluations. We integrate this objective into an end-to-end pipeline that combines task-specific quantum circuit architecture optimization with continuous refinement of the data-embedding parameters. Across five benchmark datasets with up to 20 qubits, our method retains competitive quantum kernel support vector machine (SVM) performance while reducing fidelity-evaluation cost, with particularly strong gains over budget-matched pairwise optimization on T-MNIST. Geometric analyses examine how the learned embeddings relate to kernel alignment and classification margins, revealing dataset-dependent benefits and limitations. We further derive a prototype-based classifier in the reproducing kernel Hilbert space that provides an explicit witness for the SVM objective and a low-cost proxy for model selection, and extend the framework to multiple prototypes for multimodal class structures.

quant-pharXiv:2610.24403•Oct 20, 2026•0 citations

Hybrid Quantum-Classical NLP Classification with Compact Semantic Representations: An Experimental Analysis of Representation Compression

Ali Hassan, Zijia Zhao, Maha A. Metawei

Large language and sentence-embedding models provide rich semantic representations, but their high dimensionality poses a challenge for near-term quantum machine learning (QML), where quantum circuits can process only a limited number of input features. We investigate a hybrid quantum-classical pipeline that transforms high-dimensional sentence embeddings into compact representations for variational quantum classification. The workflow combines a pretrained sentence-embedding model, dimensionality reduction, angle encoding, a variational quantum circuit (VQC), and a classical decision layer. We systematically compare principal component analysis (PCA), neighborhood components analysis (NCA), and linear discriminant analysis (LDA), covering both unsupervised and supervised dimensionality reduction. Using the TREC question-classification dataset, we study the relationship between representation dimensionality, information retention, qubit count, and classification performance. Preliminary PCA experiments reveal a strong information bottleneck: reducing 768-dimensional embeddings to 3, 4, 5, and 8 dimensions retains about 8.2%, 10.2%, 11.9%, and 16.4% of the variance, with corresponding classification accuracies of 50.3%, 51.2%, 57.9%, and 63.4%. In contrast, supervised reduction is substantially more efficient. LDA reaches 85.3% accuracy and NCA reaches 83.1% using only 5 dimensions, under a leakage-free cross-validation protocol, compared with 85.1% for a full 384-dimensional classical baseline. These results indicate that supervised dimensionality reduction can preserve task-relevant information far more effectively than variance-based compression, making compact representations a promising route toward practical hybrid quantum-classical NLP models.

arXiv:2609.10089•Sep 9, 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

Quantum Kernel Mapping Algorithms for Non-Linear Classification in Genomics

Dr. Praveen Kumar, Indu Purushothaman, Suresh Arumugam

The classification of high-dimensional genomic data presents fundamental difficulties for classical machine learning techniques because of the intrinsic non-linearity and the enormous amount of biological feature space represented. In this report, we propose a novel Quantum Kernel Mapping Algorithm (QKMA), which utilizes quantum superposition and entanglement to place genomic data into exponentially large Hilbert spaces and discover non-linear separating hyperplanes that are not computable with classical kernel methods. Our approach to QKMA is to create a parameterized quantum circuit architecture for genomic feature encoding by utilizing principles of variational quantum eigensolvers and support vector machine optimization. We have applied QKMA to three canonical classification problems in genomics: RNA sequencing data for the classification of cancer subtypes (n = 2,847 samples), SNP-based prediction of phenotypes (n = 5,102 subjects), and classification of epigenetic methylation patterns (n = 1,634 samples). QKMA achieved classification accuracies of 91.4%, 88.7%, and 93.2%, respectively, exceeding the baseline classical RBF-SVM accuracies by 7.2%, 6.3%, and 8.1%, respectively. Furthermore, our hybrid quantum-classical optimization framework reduces the kernel computation overhead by 34% compared to naive quantum simulation methods. These results suggest that quantum kernel methods provide a principled, scalable pathway to precision genomics and have important implications for early disease detection, pharmacogenomics, and personalized medicine.

International Journal of Artificial Intelligence and Machine Learning•May 24, 2026•0 citations
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.
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.
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.
In supervised quantum machine learning with classical data, classification performance critically depends on the geometry induced by quantum data embedding. Existing data-adaptive approaches rely on pairwise fidelity evaluations between samples, which scale as O(B2)O(B^2)O(B2) for BBB samples and create a computational bottleneck in iterative embedding optimization. To address this issue, we propose a prototype-guided framework for efficient data-adaptive quantum embedding. Using class-prototype separation and sample-to-prototype compactness, we derive a measurable lower certificate for class-ensemble distinguishability and construct a prototype-based objective requiring only O(B)O(B)O(B) fidelity evaluations. We integrate this objective into an end-to-end pipeline that combines task-specific quantum circuit architecture optimization with continuous refinement of the data-embedding parameters. Across five benchmark datasets with up to 20 qubits, our method retains competitive quantum kernel support vector machine (SVM) performance while reducing fidelity-evaluation cost, with particularly strong gains over budget-matched pairwise optimization on T-MNIST. Geometric analyses examine how the learned embeddings relate to kernel alignment and classification margins, revealing dataset-dependent benefits and limitations. We further derive a prototype-based classifier in the reproducing kernel Hilbert space that provides an explicit witness for the SVM objective and a low-cost proxy for model selection, and extend the framework to multiple prototypes for multimodal class structures.
Large language and sentence-embedding models provide rich semantic representations, but their high dimensionality poses a challenge for near-term quantum machine learning (QML), where quantum circuits can process only a limited number of input features. We investigate a hybrid quantum-classical pipeline that transforms high-dimensional sentence embeddings into compact representations for variational quantum classification. The workflow combines a pretrained sentence-embedding model, dimensionality reduction, angle encoding, a variational quantum circuit (VQC), and a classical decision layer. We systematically compare principal component analysis (PCA), neighborhood components analysis (NCA), and linear discriminant analysis (LDA), covering both unsupervised and supervised dimensionality reduction. Using the TREC question-classification dataset, we study the relationship between representation dimensionality, information retention, qubit count, and classification performance. Preliminary PCA experiments reveal a strong information bottleneck: reducing 768-dimensional embeddings to 3, 4, 5, and 8 dimensions retains about 8.2%, 10.2%, 11.9%, and 16.4% of the variance, with corresponding classification accuracies of 50.3%, 51.2%, 57.9%, and 63.4%. In contrast, supervised reduction is substantially more efficient. LDA reaches 85.3% accuracy and NCA reaches 83.1% using only 5 dimensions, under a leakage-free cross-validation protocol, compared with 85.1% for a full 384-dimensional classical baseline. These results indicate that supervised dimensionality reduction can preserve task-relevant information far more effectively than variance-based compression, making compact representations a promising route toward practical hybrid quantum-classical NLP 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.
The classification of high-dimensional genomic data presents fundamental difficulties for classical machine learning techniques because of the intrinsic non-linearity and the enormous amount of biological feature space represented. In this report, we propose a novel Quantum Kernel Mapping Algorithm (QKMA), which utilizes quantum superposition and entanglement to place genomic data into exponentially large Hilbert spaces and discover non-linear separating hyperplanes that are not computable with classical kernel methods. Our approach to QKMA is to create a parameterized quantum circuit architecture for genomic feature encoding by utilizing principles of variational quantum eigensolvers and support vector machine optimization. We have applied QKMA to three canonical classification problems in genomics: RNA sequencing data for the classification of cancer subtypes (n = 2,847 samples), SNP-based prediction of phenotypes (n = 5,102 subjects), and classification of epigenetic methylation patterns (n = 1,634 samples). QKMA achieved classification accuracies of 91.4%, 88.7%, and 93.2%, respectively, exceeding the baseline classical RBF-SVM accuracies by 7.2%, 6.3%, and 8.1%, respectively. Furthermore, our hybrid quantum-classical optimization framework reduces the kernel computation overhead by 34% compared to naive quantum simulation methods. These results suggest that quantum kernel methods provide a principled, scalable pathway to precision genomics and have important implications for early disease detection, pharmacogenomics, and personalized medicine.