This paper compares classical and hybrid quantum-classical machine learning methods for classifying the severity of UAV engine failures from telemetry data. Using 23 engine failure flights from the ALFA dataset, we create a severity label from per-flight z-scored latent variables and validate it against ground-truth fault onset timestamps. Classical models are tested with leave-one-flight-out (LOFO) cross-validation. The results show that strong within-flight F1 scores overestimate performance on unseen flights by 0.19-0.37 points for complex models. We also run a quantum pilot study on an identified flight, comparing a Variational Quantum Classifier (VQC) and a Quantum Kernel SVM with classical baselines using the same features and sample budgets. Under identical PCA and sample-budget conditions, the Quantum Kernel SVM exceeds all matched classical baselines. A qubit width sweep, together with per-layer gradient variance measurements, provides empirical evidence of barren plateaus where the VQC performance gets worse as width increases, while the kernel SVM improves with the richer representation. We also test noise robustness using consistent train/test splits and evaluate the quantum model across three flights. Overall, the results are presented as an preliminary/exploratory benchmark, with cross-flight generalization remaining the main open challenge.
This paper compares classical and hybrid quantum-classical machine learning methods for classifying the severity of UAV engine failures from telemetry data. Using 23 engine failure flights from the ALFA dataset, we create a severity label from per-flight z-scored latent variables and validate it against ground-truth fault onset timestamps. Classical models are tested with leave-one-flight-out (LOFO) cross-validation. The results show that strong within-flight F1 scores overestimate performance on unseen flights by 0.19-0.37 points for complex models. We also run a quantum pilot study on an identified flight, comparing a Variational Quantum Classifier (VQC) and a Quantum Kernel SVM with classical baselines using the same features and sample budgets. Under identical PCA and sample-budget conditions, the Quantum Kernel SVM exceeds all matched classical baselines. A qubit width sweep, together with per-layer gradient variance measurements, provides empirical evidence of barren plateaus where the VQC performance gets worse as width increases, while the kernel SVM improves with the richer representation. We also test noise robustness using consistent train/test splits and evaluate the quantum model across three flights. Overall, the results are presented as an preliminary/exploratory benchmark, with cross-flight generalization remaining the main open challenge.
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.
This study presents a comparative analysis of classical machine learning (ML) and quantum machine learning (QML) algorithms for industrial equipment fault detection using the AI4I 2020 Predictive Maintenance dataset. A total of nine models were evaluated through 5-fold stratified cross-validation: three classical models - Logistic Regression, Random Forest, and XGBoost - alongside six quantum models, namely Quantum Support Vector Machine (QSVM), Quantum K-Nearest Neighbors (QKNN), Quantum Kernel-based hybrid classifiers (QK+RF, QK+GB), Pegasos Quantum Support Vector Classifier (PegasosQSVC), and Variational Quantum Classifier (VQC). All quantum experiments were conducted using the IBM Qiskit framework and AerSimulator backend. Under a controlled comparison using an identical 300-sample budget and the same 5-fold cross-validation protocol, the best classical model (Random Forest, F1=0.902) outperformed the best quantum kernel method (QKNN, F1=0.820) by approximately 8.2 points. These results indicate that quantum kernel methods do not provide a dataefficiency advantage over classical methods on this dataset, although they achieve reasonably competitive results (F1 ≥0.75 for kernel-based methods) at substantially higher computational cost (quantum: ~124-137 s/fold for kernel methods, up to ~257 s/fold for VQC, vs. classical: 0.01-0.26 s/fold). We analyze the sources of this gap and attribute it primarily to a mismatch between the unitarily-invariant geometry of the fidelity kernel and the axisaligned threshold structure of the AI4I failure modes, rather than to information loss in dimensionality reduction, which the faircomparison design rules out. We further show that this apparent quantum competitiveness stems partly from an unequal-data-volume comparison common in prior QML benchmarking studies, which our fair-comparison protocol corrects.
This study investigates classification performance and trainability of variational quantum classifiers on near-term noisy quantum hardware across circuit depth and qubit count regimes within the context of quantum computing and machine learning, an area of growing scientific importance given its implications for hybrid quantum-classical algorithm design and practical NISQ hardware benchmarking for near-term quantum advantage assessment. Using gradient-based parameter optimization of parameterized quantum circuits with hardware noise modeling via density matrix simulation and physical execution on IBM Eagle processors, we examine expressibility of parameterized circuits enabling nonlinear decision boundaries in feature Hilbert space, with trainability constrained by barren plateau gradients at large qubit counts in 96 circuit architectures (4 qubit counts x 4 depths x 6 ansatz families) evaluated across 5 classification datasets with 20 random initialization seeds each drawn from IBM Quantum Eagle (127-qubit) and Falcon (27-qubit) processors with noise mitigation via zero-noise extrapolation. Results indicate that 10-qubit, 4-layer VQC achieves 84.2% classification accuracy on the best benchmark, within 3.8 percentage points of classical SVM, but gradient variance decays exponentially with qubit count (variance halving per 2 added qubits), confirming barren plateau scaling (p < 0.001), with 84.2% accuracy, 3.8 pp gap to classical SVM baseline as the primary quantitative benchmark. Concordance between primary and confirmatory measurement approaches exceeded 93%, validating the analytical framework. These findings contribute empirically to quantum computing and machine learning and carry actionable implications for the design of programs and policies targeting hybrid quantum-classical algorithm design and practical NISQ hardware benchmarking for near-term quantum advantage assessment.
A potential path forward is Quantum Machine Learning (QML), which aims to leverage quantum computing in conjunction with classical machine learning to enhance computing efficiency and the expressiveness of models. In this paper, two different quantum classifiers - Variational Quantum Classifier (VQC) and Quantum Kernel Support Vector Machine (QSVM) - are compared with three classical classifiers as baseline classifiers - Logistic Regression, Support Vector Machine (SVM), and a Multi-Layer Perceptron (MLP) - on the Breast Cancer Wisconsin dataset. The quantum circuits were created in the PennyLane framework and simulated on a classical backend. However, in terms of accuracy, classical Logistic Regression performed better with an accuracy of 97.8%, classical SVM and QSVM with an accuracy of 95.6% each, although the Quantum VQC achieved a lower accuracy of 88.9% and had a recall of 100% for the benign class, though it correctly identified only 12 of the 17 malignant cases (a malignant-class recall of approximately 70.6%). The drawback of quantum models is the higher training time; however, since the quantum circuit needs to be classically simulated, the quantum SVM took 23.29 seconds compared to less than 0.01 seconds for the classical linear models. These results indicate that for small structured datasets, classifiers based on quantum computing have not yet surpassed well-tuned classical counterparts. In some respects (e.g., benign-class recall), they perform competitively, though not on malignant-class recall, where the VQC in particular performed worse than the classical baselines, which is worth further investigation on real quantum computers.
This study presents a noise-aware evaluation framework for hybrid quantum–classical machine learning models applied to medical binary classification. Using three healthcare datasets—Pima Indians Diabetes, Heart Disease, and Breast Cancer Wisconsin—the performance of a Variational Quantum Classifier (VQC) was analyzed under multiple depolarizing noise levels (0.00–0.10). Classical baselines, Logistic Regression (LR) and Support Vector Machine (SVM), were implemented for comparison. The research investigates the impact of noise on predictive accuracy, F1-score, and training time, highlighting the computational overhead of hybrid quantum–classical models. Zero Noise Extrapolation (ZNE), using linear and Richardson methods, was applied to mitigate noise effects, revealing that while ZNE improves performance under certain conditions, extrapolation instability can occur. Transpiler optimization also contributed to improved VQC stability by reducing circuit complexity. Results show that classical models consistently outperformed the VQC in accuracy, stability, and training efficiency. VQC exhibited fluctuating performance under noise, requiring significantly higher training time, and increasing SPSA iterations did not always yield stable accuracy improvements. These findings underscore the challenges of noise robustness, optimization instability, and computational cost in the NISQ era, and suggest directions for future work, including alternative optimizers, adaptive ansatz design, advanced error mitigation, and real hardware benchmarking. This research provides a systematic benchmarking framework for evaluating training time versus noise-level trade-offs, contributing to the development of more reliable quantum machine learning models for medical applications. Keywords: Quantum Machine Learning, Variational Quantum Classifier, Depolarizing Noise, Zero Noise Extrapolation, Medical Classification, Hybrid Quantum–Classical Models, Training Time Analysis
Satellite image classification is a crucial task in remote sensing for applications such as land cover mapping, environmental monitoring, and resource management. While classical machine learning models such as SVMs achieve strong accuracy, they are often sensitive to noise, parameter-heavy, and less efficient when training data is scarce. In this work, we propose a hybrid quantum–classical pipeline for binary land cover classification on the EuroSAT dataset, combining a convolutional autoencoder for feature extraction with a Variational Quantum Classifier (VQC) inspired by quantum convolutional neural networks. The proposed QCNN–VQC achieves 90.0% accuracy, but more importantly outperforms baselines on F1-score (0.9428 after threshold tuning), AUROC (0.9819), and AUPRC (0.9812), while requiring fewer parameters. The model also demonstrates superior robustness to label noise and attains exceptionally high recall for the SeaLake class (97.8%), ensuring reliable detection of water bodies. These results highlight the promise of quantum machine learning for practical remote sensing tasks, especially in noisy or low-data regimes.