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

Oxford Journal of Student Scholarship

Variational Quantum Classifiers: Comparing Data Encoding Strategies Under Noise

Shaurya Gera

Published Oct 1, 2026• 0 citations
Publisher

Abstract

Variational quantum classifiers (VQCs) are promising near-term quantum machine-learning models whose performance can depend on both the data-encoding method and circuit noise.This study compared angle encoding, amplitude encoding, and data re-uploading under three levels of simulated depolarizing noise using a fixed four-qubit, three-layer VQC.The comparison was repeated across the Iris versicolor-versus-virginica and Banknote Authentication datasets using multiple stratified data splits and parameter initializations, with a classical multilayer perceptron as a baseline.The relative performance of the encoding methods depended on the dataset: angle encoding produced the highest mean accuracy on Iris, while data re-uploading produced the highest mean accuracy on Banknote Authentication.Although statistical tests identified overall encoding differences in several Banknote conditions, no pairwise comparison remained significant after multiple-comparison correction.The classical baseline outperformed all tested quantum conditions.These findings show that encoding choice can affect VQC classifier behavior under simulated noise, but they do not establish a universally superior encoding method or direct robustness of the encoded quantum states.

DOI
10.65161/recsgrs26upinfisp

Related papers

Robustness versus Expressivity: A Comparative Benchmark of Data Encoding Strategies for Variational Quantum Classifiers

Aayush Jari, Sowmya B J, Ganeshayya Ishwarayya Shidaganti

Quantum machine learning (QML) has generated significant excitement as a potential game-changer in artificial intelligence. At the heart of any QML model lies a fundamental challenge: how do we translate classical data into the language of quantum mechanics? This encoding process is crucial because the way we represent information in a quantum system can make or break model performance. While researchers have proposed several encoding strategies over the years, most studies focus on idealized conditions, leaving a significant gap in our understanding of how these methods actually behave under the noisy, imperfect conditions of real quantum hardware. In this work, we address this gap through a systematic, simulation-based comparison of three widely used encoding strategies—Angle Encoding, Amplitude Encoding, and the entangling ZZFeatureMap—within a variational quantum classification framework. We evaluate these approaches on standard benchmark datasets under both noiseless and noisy conditions that mimic real quantum devices. To ensure our findings are statistically reliable, each noisy experiment is repeated across 10 independent runs, with results reported using mean accuracy, standard deviation, and 95% confidence intervals. Our results reveal a nuanced but sobering story. While the entangling ZZFeatureMap outperforms simpler methods in ideal noise-free settings, these advantages largely vanish under realistic depolarizing noise. When statistically averaged, all encoding strategies converge to near-random classification accuracy under moderate noise levels. These findings highlight the fragility of quantum advantages on today's noisy intermediate-scale quantum (NISQ) hardware and emphasize the critical need for noise-aware, statistically grounded evaluation protocols when assessing the practical viability of QML models.

International Conference on Next-Gen Quantum and Advanced Computing: Algorithms, Security, and Beyond (NQComp)•Mar 5, 2026•0 citations

Performance Analysis of Variational Quantum Classifiers for Classification Tasks in the NISQ Era

Saghar Kiani, Paria Kamalpour, Sarina Ghafouri +1 more

Quantum Machine Learning (QML) leverages superposition, entanglement, and high-dimensional Hilbert spaces to model complex data structures that can be difficult for classical algorithms to approximate efficiency. In the Noisy Intermediate-Scale Quantum (NISQ) era, limited qubit counts, shallow circuits, and hardware noise constrain practically realizable quantum circuits and motivate the study of variational and hybrid approaches.This work presents a small-scale empirical benchmark of a two-qubit Variational Quantum Classifier (VQC) on the Iris dataset compared with a classical RBF-SVM baseline under noiseless and simulated depolarizing noise conditions. The VQC, implemented in Qiskit Aer with angle encoding and COBYLA optimization, achieves an accuracy of 0.93 ± 0.02 and an F1-score of 0.92 ± 0.03, close to the SVM’s 0.94 ± 0.01 and 0.93 ± 0.02, with a small but statistically detectable advantage for the classical model (p = 0.04, Cohen’s d = 0.48). Under a 2% depolarizing noise channel, the VQC exhibits a smaller relative drop in accuracy than the SVM, suggesting favorable behavior under mild simulated noise. The study serves as an educational, reproducible benchmark rather than a demonstration of quantum advantage.

International Interdisciplinary Conference on Artificial Intelligence: Engineering, Health, Finance and Humanities (IICAI)•May 1, 2026•0 citations

Comparative study of amplitude versus angle encoding in gate-based quantum machine learning

Shashank Kumar, Ashok Kumar

We investigate two fundamental data encoding strategies for gate-based quantum computers: amplitude encoding and angle encoding. In amplitude encoding, a normalized -dimensional classical vector is mapped into the probability amplitudes of a -qubit quantum state, whereas angle encoding uses one or more single-qubit rotation gates per feature to encode data as angles.[1, 2] We construct a toy binary classification dataset with four real-valued features and compare these encoding schemes using a variational quantum classifier (VQC) approach. Our results indicate that angle encoding often yields slightly higher classification accuracy (e.g. 82% vs. 75% in one experiment) at the cost of requiring more qubits, while amplitude encoding compresses features into fewer qubits (2 vs. 4) but demands deeper state-preparation circuits. These findings align with previous studies that report higher accuracy for rotation encodings (e.g. vs. in MNIST experiments [3]) and note that the encoding choice acts as a hyperparameter affecting VQC performance. [4]

International Journal of Physics and Mathematics•Jul 1, 2025•2 citations

Encoding Choice Is Associated with Large Differences in Variational Quantum Classifier Performance on Cancer Data Under a Fixed Training Budget

B RAVI KIRAN PATNAIK, Sridhar Saragadam, Rishika Chowdary

Variational quantum classifiers (VQCs) are often reported to perform poorly on biomedical tabular data, but such conclusions depend on the encoding circuit, the training budget, and the comparison protocol. Methods. We compared 4-qubit VQCs, a quantum-kernel SVM (QSVM), a majority-class control, and tuned classical models (on four PCA features and on all features) on Wisconsin breast cancer (n = 569), Coimbra biomarkers (n = 116), Golub leukemia gene expression (n = 72, 7,129 genes), and SEER breast-cancer registry data (n = 4,024; 15% deaths). All models were evaluated on identical blocks of 5-fold × 5-seed stratified cross-validation with preprocessing fitted on training folds, nested tuning, and Nadeau–Bengio-corrected inference with Holm correction. Trained classifiers were also evaluated on three IBM Quantum devices. Results. On the three small datasets, a VQC with the conventional two-repetition ZZ feature map was close to chance (accuracy 0.688, 0.594, 0.509), whereas a product (Z) feature map reached 0.900, 0.797, and 0.658; at matched repetition counts the Z-minus-ZZ gap was +0.12 to +0.21 and, after Holm correction, significant on Wisconsin only. More evaluations (up to 1,500) and six initializations did not close the ZZ deficit on Wisconsin. With the encoding chosen by inner cross-validation, the VQC exceeded the majority control on Wisconsin and Golub and stayed below classical models on Wisconsin and in several Golub contrasts. No statistically significant difference was detected between the encoding-selected VQC and the classical baselines on Coimbra, or between the Z-map QSVM and PCA-4 classical models; Bayesian equivalence analysis supported practical equivalence only for the QSVM on Wisconsin. On SEER the encoding mattered little: the VQC exceeded the majority control in balanced accuracy (0.548 versus 0.500) but ranked patients worse than logistic regression and random forest (ROC-AUC 0.678 versus 0.745 and 0.733). Full-feature classical models were strongest overall. On hardware (class-balanced test subsets, not natural-prevalence performance), accuracy relative to noise-free simulation changed by −0.071 to +0.048 per run (pooled ibm_fez, Wisconsin: −0.024, 95% CI −0.060 to +0.008), using 5.5 QPU-minutes. Conclusions. Under a fixed training budget, encoding choice was associated with large differences in VQC accuracy on small datasets, so single-encoding negative results should not be generalized; because the Z and ZZ maps also differ in entanglement structure, we do not attribute the gap to encoding alone. No quantum advantage was observed.

•Oct 15, 2026•0 citations

Rigorous Benchmarking of Variational Quantum Classifiers for Cancer Classification: Encoding Bandwidth and a Matched, Tuned Repeated Cross-Validation Study

B RAVI KIRAN PATNAIK

Variational quantum classifiers (VQCs) are often compared with classical models under unequal data partitions, tuning budgets, or statistical treatment. We benchmark a 4-qubit VQC against logistic regression, an RBF-SVM, random forest, a quantum-kernel SVM (QSVM), and a majority-class control on Breast Cancer Wisconsin (n=569), Coimbra (n=116), and Golub leukemia (n=72), using five stratified folds across five seeds (25 paired blocks per dataset), identical training-fold-fitted preprocessing, and Nadeau–Bengio corrected paired tests with Holm correction. A first arm with a frozen configuration and the common [0, π] angle encoding left the VQC at 0.563, 0.515, and 0.576 accuracy (majority 0.617, 0.552, 0.652). In a second arm, in which every model was tuned by the same inner cross-validation and the encoding scale was a tuned hyperparameter, VQC accuracy rose to 0.864, 0.616, and 0.747. On Wisconsin the VQC stayed significantly below every matched classical model (differences 0.079–0.097, Holm p≤0.006) but above the majority class; on Golub it was significantly below only the SVM (Holm p=0.016); on Coimbra no comparison was significant. A QSVM with the same feature map exceeded the VQC numerically on every dataset, and three optimizers reached the same training loss in pilot diagnostics, pointing to the encoding and the variational head rather than the optimizer. The Wisconsin arms also differ in sample size (120 versus 569). Results apply to this low-qubit, PCA-compressed, exactly simulated setting and do not indicate a quantum advantage.

•Oct 1, 2026•0 citations

Evaluating Angle and Amplitude Encoding Strategies for Variational Quantum Machine Learning: Their Impact on Model's Accuracy

Antonio Tudisco, Andrea Marchesin, Maurizio Zamboni +2 more

ABSTRACT Recent advancements in Quantum Computing and Machine Learning have increased attention to Quantum Machine Learning (QML), which aims to develop machine learning models by exploiting the quantum computing paradigm. One of the widely used models in this area is the Variational Quantum Circuit (VQC), a hybrid model where the quantum circuit handles data inference while classical optimization adjusts the parameters of the circuit. The quantum circuit consists of an encoding layer, which loads data into the circuit, and a template circuit, known as the ansatz, responsible for processing the data. This work involves performing an analysis by considering both Amplitude‐ and Angle‐encoding models, and examining how the type of rotational gate applied affects the classification performance of the model. This comparison is carried out by training the different models on two datasets, Wine and Diabetes, and evaluating their performance. The study demonstrates that, under identical model topologies, the difference in accuracy between the best and worst models ranges from 10% to 30%, with differences reaching up to 41%. Moreover, the results highlight how the choice of rotational gates used in encoding can significantly impact the model's classification performance. The findings confirm that the embedding represents a hyperparameter for VQC models.

arXiv:2508.00768•Advanced Quantum Technologies•Apr 1, 2026•12 citations
Variational quantum classifiers (VQCs) are promising near-term quantum machine-learning models whose performance can depend on both the data-encoding method and circuit noise.This study compared angle encoding, amplitude encoding, and data re-uploading under three levels of simulated depolarizing noise using a fixed four-qubit, three-layer VQC.The comparison was repeated across the Iris versicolor-versus-virginica and Banknote Authentication datasets using multiple stratified data splits and parameter initializations, with a classical multilayer perceptron as a baseline.The relative performance of the encoding methods depended on the dataset: angle encoding produced the highest mean accuracy on Iris, while data re-uploading produced the highest mean accuracy on Banknote Authentication.Although statistical tests identified overall encoding differences in several Banknote conditions, no pairwise comparison remained significant after multiple-comparison correction.The classical baseline outperformed all tested quantum conditions.These findings show that encoding choice can affect VQC classifier behavior under simulated noise, but they do not establish a universally superior encoding method or direct robustness of the encoded quantum states.
Quantum machine learning (QML) has generated significant excitement as a potential game-changer in artificial intelligence. At the heart of any QML model lies a fundamental challenge: how do we translate classical data into the language of quantum mechanics? This encoding process is crucial because the way we represent information in a quantum system can make or break model performance. While researchers have proposed several encoding strategies over the years, most studies focus on idealized conditions, leaving a significant gap in our understanding of how these methods actually behave under the noisy, imperfect conditions of real quantum hardware. In this work, we address this gap through a systematic, simulation-based comparison of three widely used encoding strategies—Angle Encoding, Amplitude Encoding, and the entangling ZZFeatureMap—within a variational quantum classification framework. We evaluate these approaches on standard benchmark datasets under both noiseless and noisy conditions that mimic real quantum devices. To ensure our findings are statistically reliable, each noisy experiment is repeated across 10 independent runs, with results reported using mean accuracy, standard deviation, and 95% confidence intervals. Our results reveal a nuanced but sobering story. While the entangling ZZFeatureMap outperforms simpler methods in ideal noise-free settings, these advantages largely vanish under realistic depolarizing noise. When statistically averaged, all encoding strategies converge to near-random classification accuracy under moderate noise levels. These findings highlight the fragility of quantum advantages on today's noisy intermediate-scale quantum (NISQ) hardware and emphasize the critical need for noise-aware, statistically grounded evaluation protocols when assessing the practical viability of QML models.
Quantum Machine Learning (QML) leverages superposition, entanglement, and high-dimensional Hilbert spaces to model complex data structures that can be difficult for classical algorithms to approximate efficiency. In the Noisy Intermediate-Scale Quantum (NISQ) era, limited qubit counts, shallow circuits, and hardware noise constrain practically realizable quantum circuits and motivate the study of variational and hybrid approaches.This work presents a small-scale empirical benchmark of a two-qubit Variational Quantum Classifier (VQC) on the Iris dataset compared with a classical RBF-SVM baseline under noiseless and simulated depolarizing noise conditions. The VQC, implemented in Qiskit Aer with angle encoding and COBYLA optimization, achieves an accuracy of 0.93 ± 0.02 and an F1-score of 0.92 ± 0.03, close to the SVM’s 0.94 ± 0.01 and 0.93 ± 0.02, with a small but statistically detectable advantage for the classical model (p = 0.04, Cohen’s d = 0.48). Under a 2% depolarizing noise channel, the VQC exhibits a smaller relative drop in accuracy than the SVM, suggesting favorable behavior under mild simulated noise. The study serves as an educational, reproducible benchmark rather than a demonstration of quantum advantage.
We investigate two fundamental data encoding strategies for gate-based quantum computers: amplitude encoding and angle encoding. In amplitude encoding, a normalized -dimensional classical vector is mapped into the probability amplitudes of a -qubit quantum state, whereas angle encoding uses one or more single-qubit rotation gates per feature to encode data as angles.[1, 2] We construct a toy binary classification dataset with four real-valued features and compare these encoding schemes using a variational quantum classifier (VQC) approach. Our results indicate that angle encoding often yields slightly higher classification accuracy (e.g. 82% vs. 75% in one experiment) at the cost of requiring more qubits, while amplitude encoding compresses features into fewer qubits (2 vs. 4) but demands deeper state-preparation circuits. These findings align with previous studies that report higher accuracy for rotation encodings (e.g. vs. in MNIST experiments [3]) and note that the encoding choice acts as a hyperparameter affecting VQC performance. [4]
Variational quantum classifiers (VQCs) are often reported to perform poorly on biomedical tabular data, but such conclusions depend on the encoding circuit, the training budget, and the comparison protocol. Methods. We compared 4-qubit VQCs, a quantum-kernel SVM (QSVM), a majority-class control, and tuned classical models (on four PCA features and on all features) on Wisconsin breast cancer (n = 569), Coimbra biomarkers (n = 116), Golub leukemia gene expression (n = 72, 7,129 genes), and SEER breast-cancer registry data (n = 4,024; 15% deaths). All models were evaluated on identical blocks of 5-fold × 5-seed stratified cross-validation with preprocessing fitted on training folds, nested tuning, and Nadeau–Bengio-corrected inference with Holm correction. Trained classifiers were also evaluated on three IBM Quantum devices. Results. On the three small datasets, a VQC with the conventional two-repetition ZZ feature map was close to chance (accuracy 0.688, 0.594, 0.509), whereas a product (Z) feature map reached 0.900, 0.797, and 0.658; at matched repetition counts the Z-minus-ZZ gap was +0.12 to +0.21 and, after Holm correction, significant on Wisconsin only. More evaluations (up to 1,500) and six initializations did not close the ZZ deficit on Wisconsin. With the encoding chosen by inner cross-validation, the VQC exceeded the majority control on Wisconsin and Golub and stayed below classical models on Wisconsin and in several Golub contrasts. No statistically significant difference was detected between the encoding-selected VQC and the classical baselines on Coimbra, or between the Z-map QSVM and PCA-4 classical models; Bayesian equivalence analysis supported practical equivalence only for the QSVM on Wisconsin. On SEER the encoding mattered little: the VQC exceeded the majority control in balanced accuracy (0.548 versus 0.500) but ranked patients worse than logistic regression and random forest (ROC-AUC 0.678 versus 0.745 and 0.733). Full-feature classical models were strongest overall. On hardware (class-balanced test subsets, not natural-prevalence performance), accuracy relative to noise-free simulation changed by −0.071 to +0.048 per run (pooled ibm_fez, Wisconsin: −0.024, 95% CI −0.060 to +0.008), using 5.5 QPU-minutes. Conclusions. Under a fixed training budget, encoding choice was associated with large differences in VQC accuracy on small datasets, so single-encoding negative results should not be generalized; because the Z and ZZ maps also differ in entanglement structure, we do not attribute the gap to encoding alone. No quantum advantage was observed.
Variational quantum classifiers (VQCs) are often compared with classical models under unequal data partitions, tuning budgets, or statistical treatment. We benchmark a 4-qubit VQC against logistic regression, an RBF-SVM, random forest, a quantum-kernel SVM (QSVM), and a majority-class control on Breast Cancer Wisconsin (n=569), Coimbra (n=116), and Golub leukemia (n=72), using five stratified folds across five seeds (25 paired blocks per dataset), identical training-fold-fitted preprocessing, and Nadeau–Bengio corrected paired tests with Holm correction. A first arm with a frozen configuration and the common [0, π] angle encoding left the VQC at 0.563, 0.515, and 0.576 accuracy (majority 0.617, 0.552, 0.652). In a second arm, in which every model was tuned by the same inner cross-validation and the encoding scale was a tuned hyperparameter, VQC accuracy rose to 0.864, 0.616, and 0.747. On Wisconsin the VQC stayed significantly below every matched classical model (differences 0.079–0.097, Holm p≤0.006) but above the majority class; on Golub it was significantly below only the SVM (Holm p=0.016); on Coimbra no comparison was significant. A QSVM with the same feature map exceeded the VQC numerically on every dataset, and three optimizers reached the same training loss in pilot diagnostics, pointing to the encoding and the variational head rather than the optimizer. The Wisconsin arms also differ in sample size (120 versus 569). Results apply to this low-qubit, PCA-compressed, exactly simulated setting and do not indicate a quantum advantage.
ABSTRACT Recent advancements in Quantum Computing and Machine Learning have increased attention to Quantum Machine Learning (QML), which aims to develop machine learning models by exploiting the quantum computing paradigm. One of the widely used models in this area is the Variational Quantum Circuit (VQC), a hybrid model where the quantum circuit handles data inference while classical optimization adjusts the parameters of the circuit. The quantum circuit consists of an encoding layer, which loads data into the circuit, and a template circuit, known as the ansatz, responsible for processing the data. This work involves performing an analysis by considering both Amplitude‐ and Angle‐encoding models, and examining how the type of rotational gate applied affects the classification performance of the model. This comparison is carried out by training the different models on two datasets, Wine and Diabetes, and evaluating their performance. The study demonstrates that, under identical model topologies, the difference in accuracy between the best and worst models ranges from 10% to 30%, with differences reaching up to 41%. Moreover, the results highlight how the choice of rotational gates used in encoding can significantly impact the model's classification performance. The findings confirm that the embedding represents a hyperparameter for VQC models.