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

Quantum machine learning for analyzing astronomical objects : do hybrid quantum machine learning models offer any measurable benefit over comparably built classical models on the hardest fine-grained SDSS spectral classification tasks, and under which conditions of parameter budget, training-set size and simulated noise does such a benefit appear?

Moritz Feuchter, Shpetim Veseli

Published Jun 5, 2026• 0 citations
Publisher

Abstract

Modern astronomical surveys such as the Sloan Digital Sky Survey (SDSS) produce millions of optical spectra. Classical deep learning already solves the coarse star-galaxy-quasar classification with high accuracy. This thesis asks whether quantum machine learning adds anything once the task is pushed to the hard, fine-grained subclasses where classical models begin to struggle. It insists on a fair comparison where every quantum model is matched in trainable parameters and run through an identical pipeline against a classical counterpart built with equal care. We first train a 14-million-parameter convolutional baseline that reaches 84.5% accuracy on a 62-class SDSS problem and reproduces the GaSNet-II benchmark at 92.5% on the same 13-class subset used in that study. This baseline also identifies the hardest class pairs and serves as a frozen feature extractor. We then run five experiments, namely a variational quantum circuit on the hardest binary pair, parameter-matched quantum and classical heads on the frozen extractor, a quantum support vector machine in a few-shot regime, a quanvolutional filter under increasing noise and a fully coherent quantum convolutional network (QCNN) as a negative control. Across all five the result is parity at best and no scalable quantum advantage. Two apparent advantages disappeared on closer inspection, one caused by an under-built classical baseline and one by a dead-ReLU artefact that a single change of activation removed. The only case where a quantum model did better was the QCNN, which held its accuracy when training data was scarce while the equally small classical model failed. This came from its small and rigid design helping it learn from few examples, not from any ability to represent richer functions or scale to larger problems. Because all circuits run on a noiseless statevector simulator, the most favourable setting for the variational methods studied here, the absence of an advantage is a conservative result. The thesis contributes a disciplined fair-comparison methodology and shows that apparent quantum advantages must be treated as hypotheses to be ruled out against carefully built classical controls.

DOI
10.21256/zhaw-37477

Related papers

Brain-inspired quantum machine learning architecture and its benchmarking on astronomical classification

Subhash S. Pandey, Mousam Mondal, Xing Liang +3 more

Automated classification of stars, galaxies, and quasi-stellar objects (QSOs) is essential for large-scale astronomical surveys, where reliable classifiers must remain stable across survey releases, class imbalance, and incomplete observational inputs. In this work, we present a Brain-Inspired Quantum Machine Learning (BIQML) framework for SDSS star–galaxy–QSO classification as a step toward robust source classification for next-generation photometric pipelines. The model combines a spiking Leaky Integrate-and-Fire (LIF) controller with a classically simulated variational quantum circuit (VQC), in which the controller sequentially selects quantum gates using measurement feedback; all circuits are classically simulated, and no hardware-level quantum advantage is claimed. The framework is trained and internally tested on SDSS DR17, with SDSS DR14 used as an external cross-release test set, and is benchmarked against a broad suite of baselines including Random Forest, Extra Trees, HistGradientBoosting, Logistic Regression, Linear Support Vector Machine, and Multilayer Perceptron classifiers under a repeated ten-split protocol with paired statistical significance testing. In the full-feature setting, BIQML is statistically on par with the strongest classical baselines, reaching 97.36 ± 0.05 % accuracy (96.90% balanced) on SDSS DR17 and 98.76 ± 0.09 % accuracy (98.41% balanced) on the external SDSS DR14 test set, where the leading tree ensembles span 97.3–97.8% and 98.8–99.4%, respectively. To probe robustness when key observational channels are unavailable, we introduce a low-sensor ( g , r , i ) no-redshift setting in which spectroscopic redshift, the u - and z -bands, and metadata are removed. Under this reduced-feature condition, BIQML remains among the top-performing models on a single controlled split (0.805 balanced accuracy, versus 0.64–0.80 for the classical baselines), achieving 85.58% accuracy on SDSS DR17 and 93.44% accuracy on SDSS DR14, suggesting that it remains competitive, degrading no more than the strongest ensembles, when discriminative information is scarce. A component-level ablation isolates the contributions of the VQC, the spiking controller, and the measurement-feedback loop, while both an analytic noise screening and a finite-shot, IBM-calibrated device-noise benchmark show that BIQML predictions remain stable under representative depolarizing, amplitude-damping, readout, and realistic NISQ-style noise channels. Together, these results position BIQML as a competitive and robust quantum-inspired architecture for astronomical source classification under cross-release shift and limited observational information.

Astronomy and Computing•Jul 20, 2026•0 citations

Quantum Machine Learning vs Classical Machine Learning: A Comparative Study from Scratch

Juan Pablo Barón Sandoval

This thesis presents a comparative study of quantum machine learning and classical machine learning developed from first principles. It begins by establishing the foundations of the quantum circuit model, observables, and projective measurement, and then revisits the classical learning framework with an emphasis on risk minimisation, task-aligned metrics, and rigorous evaluation protocols. Building on this shared perspective, the thesis examines two central paradigms in quantum machine learning: quantum kernels and variational quantum circuits. A unifying theme is that quantum models must be assessed fairly against strong classical baselines and under realistic hardware constraints. The work therefore explicitly accounts for the limitations of noisy intermediate-scale quantum (NISQ) devices, including noise, restricted connectivity, compilation overhead, and finite-shot estimation. The empirical study instantiates both quantum pipelines on a controlled supervised benchmark adapted from IBM Quantum: classifying small synthetic images containing either a vertical or a horizontal line under bounded noise. Using the same dataset, identical splitting strategies, and matched budgets for shots and optimisation, the thesis compares quantum and classical models under a consistent evaluation protocol. The results show that both quantum kernel and variational approaches achieve meaningful accuracy in this regime, but do not demonstrate a decisive quantum advantage on the selected task. The thesis concludes by outlining limitations and directions for future work, including scaling to richer benchmarks, incorporating error mitigation, and strengthening assumption-explicit methodology for credible claims of quantum-enhanced learning.

•Jan 16, 2026•0 citations

Do We Really Need Quantum Machine Learning?: A Multidimensional Empirical Study

Sudip Vhaduri, Ryan Gammon, Sayanton Dibbo

The rapid growth of computer vision and increasingly complex image recognition tasks has exposed fundamental computational limitations of classical machine learning models, motivating the exploration of quantum computing as an emerging new paradigm. This paper presents a comprehensive benchmarking study of classical and quantum machine learning models for image recognition on the MNIST handwritten digit dataset, evaluating both traditional models, a Classical Support Vector Machine (CSVM) and a Quantum Support Vector Machine (QSVM), and deep neural network models, a Classical Convolutional Neural Network (CCNN) and a Quantum Convolutional Neural Network (QCNN), across four performance dimensions: classification accuracy, computational runtime, parameter count, and memory requirements. Experiments are conducted as functions of both feature dimensionality and sample size, and across CPU and GPU execution environments, providing a controlled, multidimensional comparison to address gaps in prior work. For the SVM-based models, QSVM consistently outperforms CSVM in accuracy, reaching $\sim$ 0.90 versus $\sim$ 0.85 at 1,000 samples, with a higher computational cost. A feature count of 10 qubits and a sample size in the range of 200 -- 500 emerge as practical operating points that balance accuracy and runtime. For the neural network models, CCNN and QCNN achieve comparable classification accuracy, both exceeding 0.96 at 64 features and 60,000 samples, yet QCNN offers superior parameter and memory efficiency at higher feature counts, while incurring higher runtime. Across both model families, quantum models consistently outperform classical models by greater margins in accuracy as feature dimensionality or sample size increases.

cs.CVCross-listedarXiv:2605.27923•May 28, 2026•4 citations

Evaluating Hybrid Quantum-Classical Models for Image Classification in the NISQ Era

Utku Binkanat

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.

•Jan 1, 2026•0 citations

How Quantum Is the Advantage? A Fair, Calibration- and Noise-Aware Benchmark and Attribution Audit of Quantum Machine Learning for Network Intrusion Detection

Syeda Anshrah Gillani, Mirza Samad Ahmed Baig, Shahid Munir Shah +2 more

Quantum machine learning (QML) for network intrusion detection (NIDS) is routinely reported to reach near-perfect accuracy, yet the most rigorous studies find that well-tuned classical models remain competitive, and that apparent quantum gains may be artefacts of classical dimensionality reduction and implicit regularisation rather than genuine quantum effects. We ask not whether a quantum model can post a high accuracy, but how quantum the advantage really is. We present a unified, reproducible QML-IDS benchmark evaluating hybrid variational quantum circuits and quantum-kernel SVMs against five honestly-tuned classical baselines across four standard NIDS datasets (NSL-KDD, UNSW-NB15, CICIDS2017, NF-ToN-IoT-v2) under one leakage-controlled protocol, with an equal-budget feature view, imbalance- and calibration-aware metrics with significance testing, and a simulated NISQ noise sweep. We introduce a quantum-attribution audit (parameter-matched classical controls, a random-feature kernel, and a regularisation sweep) that quantifies how much of any gain is genuinely attributable to the quantum component. Tuned classical models (Random Forest, XGBoost) match or exceed the quantum models on aggregate detection on every dataset, and the audit attributes this to classical preprocessing and regularisation rather than quantum effects. Two advantages survive false-discovery-rate correction: the quantum-kernel SVM out-ranks its direct classical surrogate (a random-feature kernel) on AUPRC and ROC-AUC, and a small four-qubit hybrid out-detects the best classical baseline at the 1% false-positive operating point on the distribution-shifted NSL-KDD task (p = 0.005, BH q = 0.030). Code, seeds, and splits are released; our contribution stands whether quantum wins, ties, or loses.

quant-pharXiv:2608.18155•Aug 14, 2026•5 citations

A Comprehensive Review of Hybrid Quantum–Classical Approaches for Image Classification

Akash Jha, Rahul Bhandari, Raman Chadha

Noisy Intermediate-Scale Quantum (NISQ) devices have led to the creation of hybrid quantum-classical algorithms, which have provided an innovative design to improve classical machine learning. This article focuses on a review of Hybrid Quantum-Classical Neural Networks (H-QCNNs) in image classification, which is an emerging area that attempts to exploit the representational ability of parameterized quantum circuits (PQCs) and the proven feature extraction capabilities of classical deep learning. We empirically examine the current tendencies in architecture, such as quanvolutional networks, sequential models, and variational quantum classifiers, and critically assess their performance on standard and custom data. The literature analysis shows a large performance difference between noiseless simulation and execution on real hardware, indicating the highly problematic aspects of scaling beyond binary tasks, quantum noise, and a lack of standardized benchmarking. Moreover, we mention such innovative contributions as the small H-QNN model that offers comparable accuracy, yet meets strict NISQ requirements. Last but not least, the current review offers a systematic taxonomy of H-QCNN architectures, a comparative study of methodology options, and a clear roadmap to future research to reach a workable quantum advantage in computer vision. It is a resource to the beginners as well as a reference to the professionals working in the field, so the field would be moved to more powerful, scalable, and hardware-conscious ways of implementation.

IEEE Global Conference on Wireless Computing and Networking (GCWCN)•Nov 22, 2025•1 citation
Modern astronomical surveys such as the Sloan Digital Sky Survey (SDSS) produce millions of optical spectra. Classical deep learning already solves the coarse star-galaxy-quasar classification with high accuracy. This thesis asks whether quantum machine learning adds anything once the task is pushed to the hard, fine-grained subclasses where classical models begin to struggle. It insists on a fair comparison where every quantum model is matched in trainable parameters and run through an identical pipeline against a classical counterpart built with equal care. We first train a 14-million-parameter convolutional baseline that reaches 84.5% accuracy on a 62-class SDSS problem and reproduces the GaSNet-II benchmark at 92.5% on the same 13-class subset used in that study. This baseline also identifies the hardest class pairs and serves as a frozen feature extractor. We then run five experiments, namely a variational quantum circuit on the hardest binary pair, parameter-matched quantum and classical heads on the frozen extractor, a quantum support vector machine in a few-shot regime, a quanvolutional filter under increasing noise and a fully coherent quantum convolutional network (QCNN) as a negative control. Across all five the result is parity at best and no scalable quantum advantage. Two apparent advantages disappeared on closer inspection, one caused by an under-built classical baseline and one by a dead-ReLU artefact that a single change of activation removed. The only case where a quantum model did better was the QCNN, which held its accuracy when training data was scarce while the equally small classical model failed. This came from its small and rigid design helping it learn from few examples, not from any ability to represent richer functions or scale to larger problems. Because all circuits run on a noiseless statevector simulator, the most favourable setting for the variational methods studied here, the absence of an advantage is a conservative result. The thesis contributes a disciplined fair-comparison methodology and shows that apparent quantum advantages must be treated as hypotheses to be ruled out against carefully built classical controls.
Automated classification of stars, galaxies, and quasi-stellar objects (QSOs) is essential for large-scale astronomical surveys, where reliable classifiers must remain stable across survey releases, class imbalance, and incomplete observational inputs. In this work, we present a Brain-Inspired Quantum Machine Learning (BIQML) framework for SDSS star–galaxy–QSO classification as a step toward robust source classification for next-generation photometric pipelines. The model combines a spiking Leaky Integrate-and-Fire (LIF) controller with a classically simulated variational quantum circuit (VQC), in which the controller sequentially selects quantum gates using measurement feedback; all circuits are classically simulated, and no hardware-level quantum advantage is claimed. The framework is trained and internally tested on SDSS DR17, with SDSS DR14 used as an external cross-release test set, and is benchmarked against a broad suite of baselines including Random Forest, Extra Trees, HistGradientBoosting, Logistic Regression, Linear Support Vector Machine, and Multilayer Perceptron classifiers under a repeated ten-split protocol with paired statistical significance testing. In the full-feature setting, BIQML is statistically on par with the strongest classical baselines, reaching 97.36 ± 0.05 % accuracy (96.90% balanced) on SDSS DR17 and 98.76 ± 0.09 % accuracy (98.41% balanced) on the external SDSS DR14 test set, where the leading tree ensembles span 97.3–97.8% and 98.8–99.4%, respectively. To probe robustness when key observational channels are unavailable, we introduce a low-sensor ( g , r , i ) no-redshift setting in which spectroscopic redshift, the u - and z -bands, and metadata are removed. Under this reduced-feature condition, BIQML remains among the top-performing models on a single controlled split (0.805 balanced accuracy, versus 0.64–0.80 for the classical baselines), achieving 85.58% accuracy on SDSS DR17 and 93.44% accuracy on SDSS DR14, suggesting that it remains competitive, degrading no more than the strongest ensembles, when discriminative information is scarce. A component-level ablation isolates the contributions of the VQC, the spiking controller, and the measurement-feedback loop, while both an analytic noise screening and a finite-shot, IBM-calibrated device-noise benchmark show that BIQML predictions remain stable under representative depolarizing, amplitude-damping, readout, and realistic NISQ-style noise channels. Together, these results position BIQML as a competitive and robust quantum-inspired architecture for astronomical source classification under cross-release shift and limited observational information.
This thesis presents a comparative study of quantum machine learning and classical machine learning developed from first principles. It begins by establishing the foundations of the quantum circuit model, observables, and projective measurement, and then revisits the classical learning framework with an emphasis on risk minimisation, task-aligned metrics, and rigorous evaluation protocols. Building on this shared perspective, the thesis examines two central paradigms in quantum machine learning: quantum kernels and variational quantum circuits. A unifying theme is that quantum models must be assessed fairly against strong classical baselines and under realistic hardware constraints. The work therefore explicitly accounts for the limitations of noisy intermediate-scale quantum (NISQ) devices, including noise, restricted connectivity, compilation overhead, and finite-shot estimation. The empirical study instantiates both quantum pipelines on a controlled supervised benchmark adapted from IBM Quantum: classifying small synthetic images containing either a vertical or a horizontal line under bounded noise. Using the same dataset, identical splitting strategies, and matched budgets for shots and optimisation, the thesis compares quantum and classical models under a consistent evaluation protocol. The results show that both quantum kernel and variational approaches achieve meaningful accuracy in this regime, but do not demonstrate a decisive quantum advantage on the selected task. The thesis concludes by outlining limitations and directions for future work, including scaling to richer benchmarks, incorporating error mitigation, and strengthening assumption-explicit methodology for credible claims of quantum-enhanced learning.
The rapid growth of computer vision and increasingly complex image recognition tasks has exposed fundamental computational limitations of classical machine learning models, motivating the exploration of quantum computing as an emerging new paradigm. This paper presents a comprehensive benchmarking study of classical and quantum machine learning models for image recognition on the MNIST handwritten digit dataset, evaluating both traditional models, a Classical Support Vector Machine (CSVM) and a Quantum Support Vector Machine (QSVM), and deep neural network models, a Classical Convolutional Neural Network (CCNN) and a Quantum Convolutional Neural Network (QCNN), across four performance dimensions: classification accuracy, computational runtime, parameter count, and memory requirements. Experiments are conducted as functions of both feature dimensionality and sample size, and across CPU and GPU execution environments, providing a controlled, multidimensional comparison to address gaps in prior work. For the SVM-based models, QSVM consistently outperforms CSVM in accuracy, reaching ∼\sim∼ 0.90 versus ∼\sim∼ 0.85 at 1,000 samples, with a higher computational cost. A feature count of 10 qubits and a sample size in the range of 200 -- 500 emerge as practical operating points that balance accuracy and runtime. For the neural network models, CCNN and QCNN achieve comparable classification accuracy, both exceeding 0.96 at 64 features and 60,000 samples, yet QCNN offers superior parameter and memory efficiency at higher feature counts, while incurring higher runtime. Across both model families, quantum models consistently outperform classical models by greater margins in accuracy as feature dimensionality or sample size increases.
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.
Quantum machine learning (QML) for network intrusion detection (NIDS) is routinely reported to reach near-perfect accuracy, yet the most rigorous studies find that well-tuned classical models remain competitive, and that apparent quantum gains may be artefacts of classical dimensionality reduction and implicit regularisation rather than genuine quantum effects. We ask not whether a quantum model can post a high accuracy, but how quantum the advantage really is. We present a unified, reproducible QML-IDS benchmark evaluating hybrid variational quantum circuits and quantum-kernel SVMs against five honestly-tuned classical baselines across four standard NIDS datasets (NSL-KDD, UNSW-NB15, CICIDS2017, NF-ToN-IoT-v2) under one leakage-controlled protocol, with an equal-budget feature view, imbalance- and calibration-aware metrics with significance testing, and a simulated NISQ noise sweep. We introduce a quantum-attribution audit (parameter-matched classical controls, a random-feature kernel, and a regularisation sweep) that quantifies how much of any gain is genuinely attributable to the quantum component. Tuned classical models (Random Forest, XGBoost) match or exceed the quantum models on aggregate detection on every dataset, and the audit attributes this to classical preprocessing and regularisation rather than quantum effects. Two advantages survive false-discovery-rate correction: the quantum-kernel SVM out-ranks its direct classical surrogate (a random-feature kernel) on AUPRC and ROC-AUC, and a small four-qubit hybrid out-detects the best classical baseline at the 1% false-positive operating point on the distribution-shifted NSL-KDD task (p = 0.005, BH q = 0.030). Code, seeds, and splits are released; our contribution stands whether quantum wins, ties, or loses.
Noisy Intermediate-Scale Quantum (NISQ) devices have led to the creation of hybrid quantum-classical algorithms, which have provided an innovative design to improve classical machine learning. This article focuses on a review of Hybrid Quantum-Classical Neural Networks (H-QCNNs) in image classification, which is an emerging area that attempts to exploit the representational ability of parameterized quantum circuits (PQCs) and the proven feature extraction capabilities of classical deep learning. We empirically examine the current tendencies in architecture, such as quanvolutional networks, sequential models, and variational quantum classifiers, and critically assess their performance on standard and custom data. The literature analysis shows a large performance difference between noiseless simulation and execution on real hardware, indicating the highly problematic aspects of scaling beyond binary tasks, quantum noise, and a lack of standardized benchmarking. Moreover, we mention such innovative contributions as the small H-QNN model that offers comparable accuracy, yet meets strict NISQ requirements. Last but not least, the current review offers a systematic taxonomy of H-QCNN architectures, a comparative study of methodology options, and a clear roadmap to future research to reach a workable quantum advantage in computer vision. It is a resource to the beginners as well as a reference to the professionals working in the field, so the field would be moved to more powerful, scalable, and hardware-conscious ways of implementation.