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

International Conference on Next-Gen Quantum and Advanced Computing: Algorithms, Security, and Beyond (NQComp)

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

Aayush Jari, Sowmya B J, Ganeshayya Ishwarayya Shidaganti

Published Mar 5, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.1109/nqcomp68334.2026.11497767

Related papers

Variational Quantum Classifiers: Comparing Data Encoding Strategies Under Noise

Shaurya Gera

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.

Oxford Journal of Student Scholarship•Oct 1, 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

Performance Analysis of Variational Quantum Classifier and Quantum Kernel SVM under NISQ Noise Models Using Qiskit Aer

Mahadevaswamy, Bhavaling Alias Pratima Khot, S. S. Ittannavar

The rapid advancement of Noisy Intermediate-Scale Quantum (NISQ) devices necessitates a systematic evaluation of quantum machine learning (QML) algorithms to determine their feasibility for near-term applications. This study aims to benchmark the Variational Quantum Classifier (VQC)and the Quantum Kernel Support Vector Machine (QSVM) under realistic noise conditions modeled using Qiskit Aer. The primary objective is to investigate the impact of depolarizing and amplitude damping noise on the classification performance of these algorithms. Using the Iris binary classification task, we simulated four noise levels (0, 0.01, 0.05, 0.1) and evaluated accuracy across 1024 measurement shots. Results show that QSVM achieves superior accuracy (70%) under ideal and lownoise conditions, while VQC exhibits higher resilience at moderate noise (50% at 0.05 noise level) due to its adaptive Variational parameters. At higher noise levels (0.1), both models converge to ~35–40% accuracy, indicating significant degradation. These findings provide actionable insights for algorithm selection on NISQ hardware, with VQC favored for moderately noisy devices and QSVM preferable for low-noise or error-mitigated systems. The study concludes by highlighting the need for noise-aware ansatz design and error mitigation techniques to enhance QML performance in NISQ regimes.

E3S Web of Conferences•Jan 1, 2026•0 citations

A Systematic Study of Noise Effects in Hybrid Quantum-Classical Machine Learning

Bhavna Bose, Muhammad Faryad

Near-term quantum machine learning (QML) models operate in environments wherein noise is unavoidable, arising from both imperfect classical data acquisition and the limitations of noisy intermediate-scale quantum (NISQ) hardware. Although most existing studies have focused primarily on quantum circuit noise in isolation, the combined influence of corrupted classical inputs and quantum hardware noise has received comparatively little attention. In this work, we present a systematic experimental study of the robustness of a variational quantum classifier under realistic multi-level noise conditions. Using the Titanic dataset as a benchmark, a range of dataset-level noise models-including speckle noise, impulse noise, quantization noise, and feature dropout are applied to classical features prior to quantum encoding using a ZZ feature map. In parallel, hardware-inspired quantum noise channels such as depolarizing noise, amplitude damping, phase damping, Pauli errors, and readout errors are incorporated at the circuit level using the Qiskit Aer simulator. The experimental results indicate that noise in classical input data can significantly intensify the effects of quantum decoherence, resulting in less stable training and noticeably lower classification accuracy. Together, these observations emphasize the importance of designing and evaluating quantum machine learning pipelines with noise in mind, and highlight the need to consider classical and quantum noise simultaneously when assessing QML performance in the NISQ era

quant-pharXiv:2604.11541•Apr 14, 2026•2 citations

Feature Encoding in Quantum Machine Learning: A Survey and Practical Guidelines

Vincenzo Sammartino

The encoding of classical data into quantum states constitutes the primary performance bottleneck in Quantum Machine Learning (qml) on Noisy Intermediate-Scale Quantum (nisq) devices. No existing framework jointly characterises resource cost, expressivity, and noise robustness, nor provides actionable selection guidelines for practitioners. This survey addresses that gap through a systematic review of 66 primary works (2017-2026) assembled via a PRISMA-adapted protocol across five academic databases. Four principal contributions are made. First, a three-axis cost-expressivity-robustness taxonomy classifies all major encoding families - basis, angle, dense-angle, amplitude, data re-uploading, and IQP - along independently measurable axes. Second, closed-form depth-fidelity bounds under nisq decoherence channels identify the critical gate-error rate p* ~ 10^-3 below which amplitude encoding is viable. Third, a unified treatment of Fourier expressivity, barren-plateau onset, and quantum kernel concentration as functions of the encoding circuit provides the first joint trainability analysis. Fourth, a five-regime decision framework maps (D, n, p, tau) - feature dimension, qubit budget, error rate, and task type - to a hardware-grounded encoding recommendation. The central finding is that for p >= 10^-3, shallow angle-based encodings consistently outperform amplitude encoding in practice, despite the latter's exponential qubit advantage.

quant-pharXiv:2606.05387•Jun 5, 2026•3 citations

Quantum Data Encoding and Variational Algorithms: A Framework for Hybrid Quantum Classical Machine Learning

Bhavna Bose, Saurav Verma

The development of quantum computers has been the stimulus that enables the realization of Quantum Machine Learning (QML), an area that integrates the calculational framework of quantum mechanics with the adaptive properties of classical machine learning. This article suggests a broad architecture that allows the connection between classical data pipelines and quantum algorithms, hybrid quantum-classical models emerge as a promising route to scalable and near-term quantum benefit. At the core of this paradigm lies the Classical-Quantum (CQ) paradigm, in which the qubit states of high-dimensional classical data are encoded using sophisticated classical encoding strategies which encode the data in terms of amplitude and angle of rotation, along with superposition mapping. These techniques allow compression of information exponentially into Hilbert space representations, which, together with reduced sample complexity, allows greater feature expressivity. We also examine variational quantum circuits, quantum gates expressed as trainable variables that run with classical optimizers to overcome decoherence, noise, and gate-depth constraints of the existing Noisy Intermediate-Scale Quantum (NISQ) devices. Experimental comparisons with a Quantum Naive Bayes classifier prove that even small quantum circuits can approximate probabilistic inference with competitive accuracy compared to classical benchmarks, and have much better robustness to noisy data distributionsThis model does not only explain the algorithmic and architectural design of QML, it also offers a roadmap to the implementation of quantum kernels, variational algorithms, and hybrid feedback loops into practice, including optimization, computer vision, and medical diagnostics. The results support the idea that hybrid architectures with strong data encoding and adaptive error protection are key to moving QML out of theory to practice.

arXiv:2502.11951•Feb 17, 2025•7 citations
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.
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) 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.
The rapid advancement of Noisy Intermediate-Scale Quantum (NISQ) devices necessitates a systematic evaluation of quantum machine learning (QML) algorithms to determine their feasibility for near-term applications. This study aims to benchmark the Variational Quantum Classifier (VQC)and the Quantum Kernel Support Vector Machine (QSVM) under realistic noise conditions modeled using Qiskit Aer. The primary objective is to investigate the impact of depolarizing and amplitude damping noise on the classification performance of these algorithms. Using the Iris binary classification task, we simulated four noise levels (0, 0.01, 0.05, 0.1) and evaluated accuracy across 1024 measurement shots. Results show that QSVM achieves superior accuracy (70%) under ideal and lownoise conditions, while VQC exhibits higher resilience at moderate noise (50% at 0.05 noise level) due to its adaptive Variational parameters. At higher noise levels (0.1), both models converge to ~35–40% accuracy, indicating significant degradation. These findings provide actionable insights for algorithm selection on NISQ hardware, with VQC favored for moderately noisy devices and QSVM preferable for low-noise or error-mitigated systems. The study concludes by highlighting the need for noise-aware ansatz design and error mitigation techniques to enhance QML performance in NISQ regimes.
Near-term quantum machine learning (QML) models operate in environments wherein noise is unavoidable, arising from both imperfect classical data acquisition and the limitations of noisy intermediate-scale quantum (NISQ) hardware. Although most existing studies have focused primarily on quantum circuit noise in isolation, the combined influence of corrupted classical inputs and quantum hardware noise has received comparatively little attention. In this work, we present a systematic experimental study of the robustness of a variational quantum classifier under realistic multi-level noise conditions. Using the Titanic dataset as a benchmark, a range of dataset-level noise models-including speckle noise, impulse noise, quantization noise, and feature dropout are applied to classical features prior to quantum encoding using a ZZ feature map. In parallel, hardware-inspired quantum noise channels such as depolarizing noise, amplitude damping, phase damping, Pauli errors, and readout errors are incorporated at the circuit level using the Qiskit Aer simulator. The experimental results indicate that noise in classical input data can significantly intensify the effects of quantum decoherence, resulting in less stable training and noticeably lower classification accuracy. Together, these observations emphasize the importance of designing and evaluating quantum machine learning pipelines with noise in mind, and highlight the need to consider classical and quantum noise simultaneously when assessing QML performance in the NISQ era
The encoding of classical data into quantum states constitutes the primary performance bottleneck in Quantum Machine Learning (qml) on Noisy Intermediate-Scale Quantum (nisq) devices. No existing framework jointly characterises resource cost, expressivity, and noise robustness, nor provides actionable selection guidelines for practitioners. This survey addresses that gap through a systematic review of 66 primary works (2017-2026) assembled via a PRISMA-adapted protocol across five academic databases. Four principal contributions are made. First, a three-axis cost-expressivity-robustness taxonomy classifies all major encoding families - basis, angle, dense-angle, amplitude, data re-uploading, and IQP - along independently measurable axes. Second, closed-form depth-fidelity bounds under nisq decoherence channels identify the critical gate-error rate p* ~ 10^-3 below which amplitude encoding is viable. Third, a unified treatment of Fourier expressivity, barren-plateau onset, and quantum kernel concentration as functions of the encoding circuit provides the first joint trainability analysis. Fourth, a five-regime decision framework maps (D, n, p, tau) - feature dimension, qubit budget, error rate, and task type - to a hardware-grounded encoding recommendation. The central finding is that for p >= 10^-3, shallow angle-based encodings consistently outperform amplitude encoding in practice, despite the latter's exponential qubit advantage.
The development of quantum computers has been the stimulus that enables the realization of Quantum Machine Learning (QML), an area that integrates the calculational framework of quantum mechanics with the adaptive properties of classical machine learning. This article suggests a broad architecture that allows the connection between classical data pipelines and quantum algorithms, hybrid quantum-classical models emerge as a promising route to scalable and near-term quantum benefit. At the core of this paradigm lies the Classical-Quantum (CQ) paradigm, in which the qubit states of high-dimensional classical data are encoded using sophisticated classical encoding strategies which encode the data in terms of amplitude and angle of rotation, along with superposition mapping. These techniques allow compression of information exponentially into Hilbert space representations, which, together with reduced sample complexity, allows greater feature expressivity. We also examine variational quantum circuits, quantum gates expressed as trainable variables that run with classical optimizers to overcome decoherence, noise, and gate-depth constraints of the existing Noisy Intermediate-Scale Quantum (NISQ) devices. Experimental comparisons with a Quantum Naive Bayes classifier prove that even small quantum circuits can approximate probabilistic inference with competitive accuracy compared to classical benchmarks, and have much better robustness to noisy data distributionsThis model does not only explain the algorithmic and architectural design of QML, it also offers a roadmap to the implementation of quantum kernels, variational algorithms, and hybrid feedback loops into practice, including optimization, computer vision, and medical diagnostics. The results support the idea that hybrid architectures with strong data encoding and adaptive error protection are key to moving QML out of theory to practice.