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

Disentangling encoding, preprocessing, training budget and estimator artefacts in pre-training diagnostics for hybrid quantum-classical machine learning

Ömer Doğan, İlyas Özer

Published Aug 18, 2026• 0 citations
Publisher

Abstract

A preregistered follow-up study testing six hypotheses that disentangle confounds in an earlier exploratory campaign on pre-training diagnostics for hybrid quantum-classical machine learning models. The study isolates the effects of data preprocessing, training budget, learning rate, matched circuit resources, and estimator sample size on the trainability failures previously observed at eight qubits.

DOI
10.17605/osf.io/ncrx6

Related papers

Quantum and Hybrid Quantum - Classical Learning for Brain Tumor MRI Classification

Dilli Vamshi A M, Lohith Sidharth Chavan, Ananth Kumar A C +2 more

A recurring claim in applied quantum machine learning [1],[2],[3]. The second is data scarcity relative to model capacity, which makes over-parameterized classical networks prone to memorizing scanner-specific artifacts rather than tumor morphology [4],[5],[6]. Convolutional and transfer-learning pipelines (ResNet, EfficientNet, VGG) remain the strongest classical baselines when training data is abundant [7], [8]. Quantum machine learning has been proposed as a partial answer to the capacity-versus-data problem [9]. In a variational quantum classifier, classical features are mapped onto qubit rotations or phases, and a parameterized circuit learns a decision boundary in the resulting Hilbert space [10], [11]. Because an n-qubit circuit spans a 2ⁿ-dimensional state space using only O(n) physical qubits and, for fixed depth, O(n) trainable parameters, a compact quantum classifier is argued to generalize more efficiently from small samples than a classical network with far more weights [12],[13]. Data re-uploading strengthens this claim: repeating the encoding block between variational layers turns even a single- qubit circuit into a universal approximator over the frequency spectrum the encoding induces [14],[15]. Whether this holds in practice is separate from whether it is theoretically available [18]. Published quantum medical-imaging classifiers typically report a single circuit, once, at a single qubit count, against classical baselines that are rarely varied over more than one architectural axis [16], [17]. It is therefore difficult to attribute a reported accuracy figure to quantum processing rather than to encoding, classifier family, qubit budget, or a favorable training run [19],[20]. This paper instead treats the quantum stage as an experimental platform, varying qubit count (8 vs. 16), encoding family (angle, phase, IQP/ZZ), entanglement topology (CZ-ring, CNOT-ring), and classifier family (QNN, QSVM, quantum ensemble, QCNN) one at a time against a fixed preprocessing and evaluation protocol [21],[22]. This design attributes an observed accuracy change to the pipeline component that produced it, and it lets us report honestly that a deeper, angle- encoded variational circuit does not converge reliably at the qubit

•Sep 27, 2026•0 citations

A HYBRID QUANTUM-CLASSICAL MACHINE LEARNING FRAMEWORK FOR IMPROVED CLASSIFICATION ACCURACY

Shweta Narayan Bamne, Prof. M.S Shegokar

Quantum computing has emerged as a promising technology for solving complex computational problems by leveraging the principles of quantum mechanics, including superposition and entanglement. Integrating quantum computing with classical machine learning offers a potential approach to improving learning capabilities and classification performance. This research proposes a Hybrid Quantum-Classical Machine Learning Framework that combines classical data preprocessing techniques with parameterized quantum circuits to perform classification tasks. The framework uses classical machine learning components for feature preprocessing and data encoding, while a variational quantum circuit extracts quantum representations of the input data. A classical optimizer updates the quantum circuit parameters iteratively to minimize a predefined classification loss function. The proposed framework is evaluated using benchmark classification datasets and compared with conventional machine learning models, including Support Vector Machines, Logistic Regression, and classical Neural Networks. Performance is assessed using accuracy, precision, recall, F1-score, computational cost, and training time. Experiments also investigate the effects of circuit depth, feature selection, and simulated quantum noise on classification performance. The framework is implemented using the PennyLane quantum simulation library alongside standard machine learning libraries. The study identifies the conditions under which hybrid quantum-classical learning can provide competitive classification performance and determines the practical limitations of current quantum machine learning approaches. The findings contribute to a better understanding of the effectiveness, scalability, and feasibility of hybrid quantum classical models for realworld classification problems.

International Journal of Engineering Applied Sciences and Technology•Oct 1, 2026•0 citations

Experimental evidence of generalization in quantum machine learning in small-data regime

Leena Anthony, Artemiy Burov, Nicolas Piro +2 more

Quantum machine learning is a promising paradigm for learning from limited data, a central bottleneck in domains such as medical imaging, clinical trials, and rare diseases. Quantum convolutional neural networks (QCNNs) are particularly attractive in this setting, combining a hierarchical architecture with strong inductive bias and a parameter count that grows only logarithmically with system size. Their appeal rests on the generalization bounds of Caro et al. (2022), which show that the generalization error of a quantum model scales with the number of trainable parameters rather than with the Hilbert-space dimension, placing QCNNs in a potentially sample-efficient regime. We develop a hardware-compatible QCNN with mid-circuit measurement and classical feed-forward, and show on a binary handwritten-digit task that strong test performance is achievable from as few as 10 training samples, with the generalization error decreasing as the training set grows. At a matched 45-parameter budget the QCNN learns where an equally small classical convolutional network stays at chance, although an unconstrained classical baseline with roughly 25,000 parameters remains strongest when data are plentiful. Transpiling amplitude and angle encoded circuits across image resolutions from 2x2 to 512x512 pixels then exposes the dominant scaling bottleneck: amplitude encoding stays qubit-efficient but grows extremely deep, whereas angle encoding stays shallow but becomes qubit-prohibitive. On the medically motivated BreastMNIST benchmark the QCNN does not surpass the unconstrained classical network, yet it learns consistently above chance using orders of magnitude fewer parameters. Our results indicate that for QCNNs, learning from few samples is attainable in practice, whereas scaling to realistic image data is constrained less by optimization than by data encoding and hardware execution.

quant-pharXiv:2609.24666•Sep 22, 2026•0 citations

From Classical to Hybrid: A Practical Framework for Quantum-Enhanced Learning

Silvie Illésová, Tomáš Bezděk, Vojtěch Novák +3 more

This work addresses the challenge of enabling practitioners without quantum expertise to transition from classical to hybrid quantum-classical machine learning workflows. We propose a three-stage framework: starting with a classical self-training model, then introducing a minimal hybrid quantum variant, and finally applying diagnostic feedback via QMetric to refine the hybrid architecture. In experiments on the Iris dataset, the refined hybrid model improved accuracy from 0.31 in the classical approach to 0.87 in the quantum approach. These results suggest that even modest quantum components, when guided by proper diagnostics, can enhance class separation and representation capacity in hybrid learning, offering a practical pathway for classical machine learning practitioners to leverage quantum-enhanced methods.

quant-pharXiv:2511.08205•Nov 12, 2025•9 citations

Development of hybrid quantum classifiers for realistic classification tasks

Sara Aminpour, Safura Sharifi, Yaser Mike Banad

Abstract Hybrid quantum machine learning combines classical minimization with parameterized quantum circuits, enabling powerful learning models even on near-term quantum hardware. This work presents an evaluation of hybrid quantum machine learning classifiers using the data re-uploading framework across nine binary and multi-class classification tasks with varying geometric complexity. We compare three quantum circuit architectures, single-qubit, two-qubit, and two-qubit entangled, trained with three classical minimizers: COBYLA, Nelder-Mead, and SLSQP. Our experiments span training sizes from 1 to 200 samples and reveal that two-qubit classifiers, when paired with the SLSQP minimizer, achieve the highest overall test accuracy of 99.775% on structured tasks and strong performance (up to 89.78%) on complex multi-class pattern. Among minimizers, SLSQP consistently provides the best generalization, while entanglement improves accuracy in non-linear and fragmented tasks. By analyzing accuracy trends, generalization gaps, and confusion matrices, this study offers practical guidance for designing quantum classifiers that scale effectively and generalize well, providing a foundation for real-world Hybrid quantum machine learning applications.

Journal of Physics Communications•Feb 1, 2026•1 citation

Toward Fair and Budget-Aware Benchmarking in Hybrid Quantum Machine Learning

Rekia Bendouma, Allal Tiberkak, Miloud Bagaa

Empirical comparisons between hybrid quan-tum-classical machine learning (HQML) models and classical baselines are often confounded by mismatched model capacity and training budgets. We propose a fair, budgetaware benchmarking protocol for HQML evaluation on classical quantum simulators. Our proposed framework ensures controlled comparisons by matching the number of trainable parameters and optimization steps under a shared early-stopping policy, while explicitly reporting the wall-clock training cost. Variational HQML models with different circuit depths are evaluated on a binary FashionMNIST task $(N=12000)$ using PCA-reduced inputs mapped to $n=8$ qubits and are compared against parameter-matched classical multilayer perceptrons.The results obtained indicate that shallow HQML models achieve statistically comparable predictive performance under strictly matched computational budgets, albeit at substantially higher computational cost. These findings emphasize the necessity of budget-aware evaluation and provide a reproducible foundation for principled HQML benchmarking.

International Conference on Pattern Analysis and Intelligent Systems (PAIS)•Apr 1, 2026•1 citation
A preregistered follow-up study testing six hypotheses that disentangle confounds in an earlier exploratory campaign on pre-training diagnostics for hybrid quantum-classical machine learning models. The study isolates the effects of data preprocessing, training budget, learning rate, matched circuit resources, and estimator sample size on the trainability failures previously observed at eight qubits.
A recurring claim in applied quantum machine learning [1],[2],[3]. The second is data scarcity relative to model capacity, which makes over-parameterized classical networks prone to memorizing scanner-specific artifacts rather than tumor morphology [4],[5],[6]. Convolutional and transfer-learning pipelines (ResNet, EfficientNet, VGG) remain the strongest classical baselines when training data is abundant [7], [8]. Quantum machine learning has been proposed as a partial answer to the capacity-versus-data problem [9]. In a variational quantum classifier, classical features are mapped onto qubit rotations or phases, and a parameterized circuit learns a decision boundary in the resulting Hilbert space [10], [11]. Because an n-qubit circuit spans a 2ⁿ-dimensional state space using only O(n) physical qubits and, for fixed depth, O(n) trainable parameters, a compact quantum classifier is argued to generalize more efficiently from small samples than a classical network with far more weights [12],[13]. Data re-uploading strengthens this claim: repeating the encoding block between variational layers turns even a single- qubit circuit into a universal approximator over the frequency spectrum the encoding induces [14],[15]. Whether this holds in practice is separate from whether it is theoretically available [18]. Published quantum medical-imaging classifiers typically report a single circuit, once, at a single qubit count, against classical baselines that are rarely varied over more than one architectural axis [16], [17]. It is therefore difficult to attribute a reported accuracy figure to quantum processing rather than to encoding, classifier family, qubit budget, or a favorable training run [19],[20]. This paper instead treats the quantum stage as an experimental platform, varying qubit count (8 vs. 16), encoding family (angle, phase, IQP/ZZ), entanglement topology (CZ-ring, CNOT-ring), and classifier family (QNN, QSVM, quantum ensemble, QCNN) one at a time against a fixed preprocessing and evaluation protocol [21],[22]. This design attributes an observed accuracy change to the pipeline component that produced it, and it lets us report honestly that a deeper, angle- encoded variational circuit does not converge reliably at the qubit
Quantum computing has emerged as a promising technology for solving complex computational problems by leveraging the principles of quantum mechanics, including superposition and entanglement. Integrating quantum computing with classical machine learning offers a potential approach to improving learning capabilities and classification performance. This research proposes a Hybrid Quantum-Classical Machine Learning Framework that combines classical data preprocessing techniques with parameterized quantum circuits to perform classification tasks. The framework uses classical machine learning components for feature preprocessing and data encoding, while a variational quantum circuit extracts quantum representations of the input data. A classical optimizer updates the quantum circuit parameters iteratively to minimize a predefined classification loss function. The proposed framework is evaluated using benchmark classification datasets and compared with conventional machine learning models, including Support Vector Machines, Logistic Regression, and classical Neural Networks. Performance is assessed using accuracy, precision, recall, F1-score, computational cost, and training time. Experiments also investigate the effects of circuit depth, feature selection, and simulated quantum noise on classification performance. The framework is implemented using the PennyLane quantum simulation library alongside standard machine learning libraries. The study identifies the conditions under which hybrid quantum-classical learning can provide competitive classification performance and determines the practical limitations of current quantum machine learning approaches. The findings contribute to a better understanding of the effectiveness, scalability, and feasibility of hybrid quantum classical models for realworld classification problems.
Quantum machine learning is a promising paradigm for learning from limited data, a central bottleneck in domains such as medical imaging, clinical trials, and rare diseases. Quantum convolutional neural networks (QCNNs) are particularly attractive in this setting, combining a hierarchical architecture with strong inductive bias and a parameter count that grows only logarithmically with system size. Their appeal rests on the generalization bounds of Caro et al. (2022), which show that the generalization error of a quantum model scales with the number of trainable parameters rather than with the Hilbert-space dimension, placing QCNNs in a potentially sample-efficient regime. We develop a hardware-compatible QCNN with mid-circuit measurement and classical feed-forward, and show on a binary handwritten-digit task that strong test performance is achievable from as few as 10 training samples, with the generalization error decreasing as the training set grows. At a matched 45-parameter budget the QCNN learns where an equally small classical convolutional network stays at chance, although an unconstrained classical baseline with roughly 25,000 parameters remains strongest when data are plentiful. Transpiling amplitude and angle encoded circuits across image resolutions from 2x2 to 512x512 pixels then exposes the dominant scaling bottleneck: amplitude encoding stays qubit-efficient but grows extremely deep, whereas angle encoding stays shallow but becomes qubit-prohibitive. On the medically motivated BreastMNIST benchmark the QCNN does not surpass the unconstrained classical network, yet it learns consistently above chance using orders of magnitude fewer parameters. Our results indicate that for QCNNs, learning from few samples is attainable in practice, whereas scaling to realistic image data is constrained less by optimization than by data encoding and hardware execution.
This work addresses the challenge of enabling practitioners without quantum expertise to transition from classical to hybrid quantum-classical machine learning workflows. We propose a three-stage framework: starting with a classical self-training model, then introducing a minimal hybrid quantum variant, and finally applying diagnostic feedback via QMetric to refine the hybrid architecture. In experiments on the Iris dataset, the refined hybrid model improved accuracy from 0.31 in the classical approach to 0.87 in the quantum approach. These results suggest that even modest quantum components, when guided by proper diagnostics, can enhance class separation and representation capacity in hybrid learning, offering a practical pathway for classical machine learning practitioners to leverage quantum-enhanced methods.
Abstract Hybrid quantum machine learning combines classical minimization with parameterized quantum circuits, enabling powerful learning models even on near-term quantum hardware. This work presents an evaluation of hybrid quantum machine learning classifiers using the data re-uploading framework across nine binary and multi-class classification tasks with varying geometric complexity. We compare three quantum circuit architectures, single-qubit, two-qubit, and two-qubit entangled, trained with three classical minimizers: COBYLA, Nelder-Mead, and SLSQP. Our experiments span training sizes from 1 to 200 samples and reveal that two-qubit classifiers, when paired with the SLSQP minimizer, achieve the highest overall test accuracy of 99.775% on structured tasks and strong performance (up to 89.78%) on complex multi-class pattern. Among minimizers, SLSQP consistently provides the best generalization, while entanglement improves accuracy in non-linear and fragmented tasks. By analyzing accuracy trends, generalization gaps, and confusion matrices, this study offers practical guidance for designing quantum classifiers that scale effectively and generalize well, providing a foundation for real-world Hybrid quantum machine learning applications.
Empirical comparisons between hybrid quan-tum-classical machine learning (HQML) models and classical baselines are often confounded by mismatched model capacity and training budgets. We propose a fair, budgetaware benchmarking protocol for HQML evaluation on classical quantum simulators. Our proposed framework ensures controlled comparisons by matching the number of trainable parameters and optimization steps under a shared early-stopping policy, while explicitly reporting the wall-clock training cost. Variational HQML models with different circuit depths are evaluated on a binary FashionMNIST task (N=12000)(N=12000)(N=12000) using PCA-reduced inputs mapped to n=8n=8n=8 qubits and are compared against parameter-matched classical multilayer perceptrons.The results obtained indicate that shallow HQML models achieve statistically comparable predictive performance under strictly matched computational budgets, albeit at substantially higher computational cost. These findings emphasize the necessity of budget-aware evaluation and provide a reproducible foundation for principled HQML benchmarking.