This work studies the feasibility of applying quantum kernel methods to a real consumer classification task in the NISQ regime. We present a hybrid pipeline that combines a quantum-kernel Support Vector Machine (Q-SVM) with a quantum feature extraction module (QFE), and benchmark it against classical and quantum baselines in simulation (hardware validation remains future work). Hyperparameters were selected via nested cross-validation on the training partition and then fixed for test evaluation; under these settings, the proposed Q-SVM attains 0.7790 accuracy, 0.7647 precision, 0.8609 recall, 0.8100 F1, and 0.83 ROC AUC, exhibiting higher sensitivity while maintaining competitive precision relative to classical SVM. All headline metrics are obtained via high-fidelity simulation. We interpret these results as an initial indicator and a concrete starting point for NISQ-era workflows and hardware integration, rather than a definitive benchmark. Methodologically, our design aligns with recent work that formalizes quantum–classical separations and verifies resources via XEB-style (Cross-Entropy Benchmarking) approaches, motivating shallow yet expressive quantum embeddings to achieve robust separability despite hardware noise constraints.
This work studies the feasibility of applying quantum kernel methods to a real consumer classification task in the NISQ regime. We present a hybrid pipeline that combines a quantum-kernel Support Vector Machine (Q-SVM) with a quantum feature extraction module (QFE), and benchmark it against classical and quantum baselines in simulation (hardware validation remains future work). Hyperparameters were selected via nested cross-validation on the training partition and then fixed for test evaluation; under these settings, the proposed Q-SVM attains 0.7790 accuracy, 0.7647 precision, 0.8609 recall, 0.8100 F1, and 0.83 ROC AUC, exhibiting higher sensitivity while maintaining competitive precision relative to classical SVM. All headline metrics are obtained via high-fidelity simulation. We interpret these results as an initial indicator and a concrete starting point for NISQ-era workflows and hardware integration, rather than a definitive benchmark. Methodologically, our design aligns with recent work that formalizes quantum–classical separations and verifies resources via XEB-style (Cross-Entropy Benchmarking) approaches, motivating shallow yet expressive quantum embeddings to achieve robust separability despite hardware noise constraints.
This thesis presents a systematic empirical evaluation of quantum machine learning performance under noisy intermediate-scale quantum (NISQ) era constraints. Through 670 controlled experiments, it evaluated quantum kernel support vector machines and variational quantum classifiers against classical baselines on MNIST binary and multiclass classification tasks with systematic variation of problem difficulty, feature dimensionality (4, 8 qubits), and training set size (n ∈{100, 250, 400, 500, 2000, 4000}). Statistical rigor was ensured through five random seeds per condition and comprehensive significance testing. During the testing with binary datasets, classical methods (SVM, logistic regression, k-NN, neural networks) achieved 85.9% to 99.6% accuracy with training times under one second across all sample sizes. Quantum kernel methods utilizing ZZ feature maps yielded 70.5% to 96.0% accuracy, requiring 129 to 2,140 seconds training with quadratic sample size scaling. Larger scale quantum experiments (n = 4000 for both architectures, 8-qubit encoding with n = 2000 for quantum kernels) proved computationally impossible on available hardware leading to out of memory errors, highlighting practical NISQ-era scalability constraints. Variational quantum classifiers exhibited persistent performance stagnation, failing to exceed 66.5% accuracy despite increases in training data and feature dimensionality. Performance gaps ranged from 3.3 to 35.2 percentage points. All quantum classical differences achieved statistical significance (p< 0.05, with 13 of 14 comparisons meeting p< 0.01) and exhibited large to very large efect sizes (d> 1.0, with 13 of 14 comparisons exceeding d> 2.0). To further evaluate performance and scalability, a 4 class classification experiment was conducted following an identical experimental protocol, with training set sizes of n ∈{100, 250, 400}. Across 180 runs, classical baselines achieved mean accuracies between 87.2% and 95% across both 4 and 8 dimensional data. Quantum Kernel SVM struggled during runs with 4 dimensions, accuracy varying between 64.6% and 74%. Quantum Kernel SVM accuracy declined 16%-25% when the dimension and qubit count were increased to 8, showing findings of exponential kernel concentration. The Variational Quantum Classifier also performed poorly, with accuracy ranging from 43.4% to 44.6% across all runs, providing further evidence that it failed to leverage additional features or training data. Experiments employed noiseless statevector simulation, establishing that quantum underperformance stems from fundamental algorithmic limitations independent of hardware noise. A further extension to 8 class classification (digits 0–7) confirmed and amplified these findings: classical methods maintained 65–83% accuracy while Quantum Kernel SVM degraded to 34–47% and VQC collapsed to 21–23%, approaching the 12.5% random baseline. Supplementary appendix experiments further examined amplitude encoding on raw 784 dimensional pixel features and an alternative angle encoding scheme on the 8-class task; the latter demonstrated that replacing the ZZ Feature Map with simple per qubit rotations substantially recovered quantum kernel performance, suggesting feature map design as a more consequential variable than circuit depth or qubit count in near-term quantum classification.
Abstract Quantum kernel approaches have been touted as a possible way to gain representational advantages over classical machine learning techniques however most comparative work only looks at classification accuracy leaving the geometric structure of the kernels unexplored. We carry out a comprehensive kernel-level comparison between classical support vector machines (SVMs) with radial basis function (RBF) kernels and quantum support vector classifiers that use ZZFeatureMap and PauliFeatureMap fidelity kernels, tested on two synthetic and two real-world two-dimensional datasets. After applying centred kernel alignment(CKA), the Hilbert-Schmidt Independence Criterion (HSIC), eigenvalue spectrum analysis, spectral entropy, and effective rank. Firstly, shallow quantum kernels form a moderately aligned band with RBF across all datasets and conditions that is quite stable (CKA : 0.41 → 0.57), whereas going deeper in the circuit to two repetitions largely mismatches both alignment and accuracy with no representational gain (e.g. Iris cross-validation accuracy: 0.920 → 0.670, p = 0.0004). Secondly, depolarising noise surprisingly increases the quantum-classical kernel alignment, which means that near-term hardware kernels are structurally closer to RBF than noiseless simulations suggest. Thirdly, the scenarios that lead to maximum apparent quantum-classical divergence, small sample sizes and low noise, are precisely those most used to benchmark quantum kernel advantage. Kernel-level structural analysis is essential for meaningful evaluation of quantum machine learning methods.
Abstract Support vector machines (SVMs) are widely used for classification, but become computationally expensive as datasets grow and data become high-dimensional or nonlinearly separable. Quantum support vector machines (QSVMs) enhance the traditional SVMs by replacing conventional feature mappings with quantum-implemented embeddings that project data into high-dimensional Hilbert spaces, potentially improving expressive power and efficiency. However, training QSVMs on current noisy intermediate-scale quantum (NISQ) devices remains challenging, as constructing the quantum kernel matrix requires repeated circuit executions and scales quadratically with dataset size. We propose NQ-SVM , a hybrid quantum-classical method that incorporates the Nystr\"om approximation to enhance the scalability of QSVMs. By selecting a small set of landmark points, the Nystr\"om method yields a low-rank kernel approximation, reducing complexity from (O(n2)) to (O(nm)), while preserving the quantum advantages in handling high-dimensional, non-linear data. Extensive simulations demonstrate that NQ-SVM achieves comparable classification accuracy to classical SVMs and full QSVMs, while substantially reducing training time and kernel evaluation costs. These results underscore the potential of NQ-SVM as a scalable and practical hybrid framework for near-term quantum machine learning (QML).
Quantum kernel methods have been proposed as a promising approach for leveraging near-term quantum computers for supervised learning, yet rigorous benchmarks against strong classical baselines remain scarce. We present a comprehensive empirical study of quantum kernel support vector machines (QSVMs) across nine binary classification datasets, four quantum feature maps, three classical kernels, and multiple noise models, totalling 970 experiments with strict nested cross-validation.
Our analysis spans four phases: (i) statistical significance testing, revealing that none of 29 pairwise quantum-classical comparisons reach significance at α=0.05; (ii) learning curve analysis over six training fractions, showing steeper quantum slopes on six of eight datasets that nonetheless fail to close the gap to the best classical baseline; (iii) hardware validation on IBM ibm_fez (Heron r2), demonstrating kernel fidelity r≥0.976 across six experiments; and (iv) seed sensitivity analysis confirming reproducibility (mean CV 1.4%).
A Kruskal-Wallis factorial analysis reveals that dataset choice dominates performance variance (ε2=0.73), while kernel type accounts for only 9%. Spectral analysis offers a mechanistic explanation: current quantum feature maps produce eigenspectra that are either too flat or too concentrated, missing the intermediate profile of the best classical kernel, the radial basis function (RBF). Quantum kernel training (QKT) via kernel-target alignment yields the single competitive result -- balanced accuracy 0.968 on breast cancer -- but with ~2,000x computational overhead.
Our findings provide actionable guidelines for quantum kernel research. The complete benchmark suite is publicly available to facilitate reproduction and extension.
Detecting credit card fraud is notoriously difficult because fraudulent charges make up less than 0.2% of total transactions. Quantum Machine Learning (QML), particularly Quantum Kernel Support Vector Machines (QSVM), promises richer feature representations by embedding classical data into high-dimensional Hilbert spaces. However, whether this theoretical advantage holds up when managing real-world financial data bottlenecks remains unclear. We designed a controlled benchmark comparing three quantum encodings, Angle, ZZFeatureMap, and IQP against classical models while keeping sample sizes, feature counts, and scaling strictly matched. To handle class skew without corrupting quantum state overlaps, we embedded synthetic minority oversampling (SMOTE) directly into the quantum Gram matrix workflow, raising PR-AUC scores by roughly +0.04 across feature maps. When trained on the full European credit card dataset with 30 features, classical baselines reached a top PR-AUC of 0.983. However, restricting classical models to match QSVM hardware constraints (500 samples, 4 PCA features) dropped their PR-AUC to 0.750. This puts our best quantum result 0.730 PR-AUC using IQP encoding on 150 samples into realistic context. Testing on physical quantum hardware reduced performance further to 0.62 due to CNOT gate errors and thermal noise. Overall, our findings pinpoint two main operational bottlenecks for near-term quantum kernels: the scaling of Gram matrix evaluation and heavy information loss from squeezing features onto small qubit registers.
This paper examines the application of a Quantum Support Vector Machine (QSVM) for radarbased aerial target classification using micro-Doppler signatures. Classical features are extracted and reduced via Principal Component Analysis (PCA) to enable efficient quantum encoding. The reduced feature vectors are embedded into a quantum kernel-induced feature space using a fully entangled ZZFeatureMap and classified using a kernel based QSVM. Performance is first evaluated on a quantum simulator and subsequently validated on NISQ-era superconducting quantum hardware, specifically the IBM Torino (133-qubit) and IBM Fez (156-qubit) processors. Experimental results demonstrate that the QSVM achieves competitive classification performance relative to classical SVM baselines while operating on substantially reduced feature dimensionality. Hardware experiments reveal the impact of noise and decoherence and measurement shot count on quantum kernel estimation, and further show improved stability and fidelity on newer Heron r2 architecture. This study provides a systematic comparison between simulator-based and hardware-based QSVM implementations and highlights both the feasibility and current limitations of deploying quantum kernel methods for practical radar signal classification tasks.