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

arXiv:2607.17705

Image Classification on IBM Quantum Computers

Junghoon Justin Park, Jiook Cha, Jun-gyeong Park, Hwidong Yoo, Kwangmin Yu

quant-phSubmitted Jul 20, 2026• Announced Jul 21, 2026• 0 citations
arXivHTMLPDF

Abstract

Quantum machine learning on real noisy intermediate-scale quantum (NISQ) hardware has remained largely confined to binary or few-class tasks, limited by the cost of on-hardware training and the underuse of large devices at inference. We present a unified framework that classifies ten-class MNIST end-to-end on a $127$-qubit IBM Eagle processor, with three central contributions. First, a two-phase protocol decouples a gradient-based classical optimization of the encoder and readout from a gradient-free optimization of the quantum parameters, removing the parameter-shift gradient cost that makes on-hardware training impractical. Second, we introduce Quantum Multi-Programming to a trained quantum classifier for the first time, packing multiple circuit copies onto one device to deliver parallel inference at no mean-accuracy cost while cutting quantum-processor job submissions proportionally. Third, a controlled comparison shows that on-hardware fine-tuning yields no measurable accuracy gain, motivating a practical NISQ workflow: train on a classical simulator and reserve the hardware for inference only. Benchmarked against a matched-capacity classical network, the quantum module shows no per-parameter accuracy advantage at this scale; we therefore frame the work as a feasibility-and-workflow demonstration for multi-class quantum image classification on current hardware.

Related papers

Variational Quantum Machine Learning for Binary Classification on NISQ Hardware: Expressibility, Trainability, and Noise Robustness

Priya S. Mehta, Aleksandr V. Korolev

This study investigates classification performance and trainability of variational quantum classifiers on near-term noisy quantum hardware across circuit depth and qubit count regimes within the context of quantum computing and machine learning, an area of growing scientific importance given its implications for hybrid quantum-classical algorithm design and practical NISQ hardware benchmarking for near-term quantum advantage assessment. Using gradient-based parameter optimization of parameterized quantum circuits with hardware noise modeling via density matrix simulation and physical execution on IBM Eagle processors, we examine expressibility of parameterized circuits enabling nonlinear decision boundaries in feature Hilbert space, with trainability constrained by barren plateau gradients at large qubit counts in 96 circuit architectures (4 qubit counts x 4 depths x 6 ansatz families) evaluated across 5 classification datasets with 20 random initialization seeds each drawn from IBM Quantum Eagle (127-qubit) and Falcon (27-qubit) processors with noise mitigation via zero-noise extrapolation. Results indicate that 10-qubit, 4-layer VQC achieves 84.2% classification accuracy on the best benchmark, within 3.8 percentage points of classical SVM, but gradient variance decays exponentially with qubit count (variance halving per 2 added qubits), confirming barren plateau scaling (p < 0.001), with 84.2% accuracy, 3.8 pp gap to classical SVM baseline as the primary quantitative benchmark. Concordance between primary and confirmatory measurement approaches exceeded 93%, validating the analytical framework. These findings contribute empirically to quantum computing and machine learning and carry actionable implications for the design of programs and policies targeting hybrid quantum-classical algorithm design and practical NISQ hardware benchmarking for near-term quantum advantage assessment.

Princeton Journal of Pre-Collegiate Research•Jan 1, 2021•0 citations

Benchmarking MedMNIST dataset on real quantum hardware

Gurinder Singh, Hongni Jin, Kenneth M. Merz

Quantum machine learning (QML) has emerged as a promising domain to leverage the computational capabilities of quantum systems to solve complex classification tasks. In this work, we present the first comprehensive QML study by benchmarking the MedMNIST-a diverse collection of medical imaging datasets on a 127-qubit real IBM quantum hardware, to evaluate the feasibility and performance of quantum models (without any classical neural networks) in practical applications. This study explores recent advancements in quantum computing such as device-aware quantum circuits, error suppression, and mitigation for medical image classification. Our methodology is comprised of three stages: preprocessing, generation of noise-resilient and hardware-efficient quantum circuits, optimizing/training of quantum circuits on classical hardware, and inference on real IBM quantum hardware. Firstly, we process all input images in the preprocessing stage to reduce the spatial dimension due to quantum hardware limitations. We generate hardware-efficient quantum circuits using backend properties expressible to learn complex patterns for medical image classification. After classical optimization of QML models, we perform inference on real quantum hardware. We also incorporate advanced error suppression and mitigation techniques in our QML workflow, including dynamical decoupling (DD), gate twirling, and matrix-free measurement mitigation (M3) to mitigate the effects of noise and improve classification performance. The experimental results showcase the potential of quantum computing for medical imaging and establish a benchmark for future advancements in QML applied to healthcare.

arXiv:2502.13056•Feb 18, 2025•0 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

Efficient Quantum Convolutional Neural Networks for Image Classification: Overcoming Hardware Constraints

Peter Röseler, Oliver Schaudt, Helmut Berg +2 more

While classical convolutional neural networks (CNNs) have revolutionized imageclassification, the emergence of quantum CNNs (QCNNs) presents new opportunities with high-dimensional transformations that are infeasible for classicalCNNs. However, their implementation on current noisy intermediate-scale quantum (NISQ) devices remains challenging due to hardware limitations. In ourresearch, we address this challenge by introducing fragment encoding that significantly reduces the input dimensionality. We show that accuracy improvesas the number of qubits increases from 1 to 4 to 16, providing evidence offavorable scaling. Motivated by this, we developed a primitive QCNN architecture with 49 qubits which is sufficient to directly process 28 × 28 pixelMNIST images, eliminating the need for classical dimensionality reductionpre-processing. Additionally, we propose an automated framework based onexpressibility, entanglement, and complexity characteristics to identify the building blocks of QCNNs, parameterized quantum circuits (PQCs). Our approachdemonstrates advantages in convergence speed with a similar parameter countcompared to both hybrid QCNNs and classical CNNs. We validated our experiments on IBM’s Heron r2 quantum processor, achieving 96.08% accuracy withapproximately 70% faster convergence relative to classical CNNs under identicaltraining conditions. Our results show that simple image-classification tasks canbe realized on real quantum hardware today.

arXiv:2505.05957•Jan 1, 2025•3 citations

Quantum machine learning for image classification

Arsenii Senokosov, Alexandr Sedykh, Asel Sagingalieva +2 more

Abstract Image classification, a pivotal task in multiple industries, faces computational challenges due to the burgeoning volume of visual data. This research addresses these challenges by introducing two quantum machine learning models that leverage the principles of quantum mechanics for effective computations. Our first model, a hybrid quantum neural network with parallel quantum circuits, enables the execution of computations even in the noisy intermediate-scale quantum era, where circuits with a large number of qubits are currently infeasible. This model demonstrated a record-breaking classification accuracy of 99.21% on the full MNIST dataset, surpassing the performance of known quantum–classical models, while having eight times fewer parameters than its classical counterpart. Also, the results of testing this hybrid model on a Medical MNIST (classification accuracy over 99%), and on CIFAR-10 (classification accuracy over 82%), can serve as evidence of the generalizability of the model and highlights the efficiency of quantum layers in distinguishing common features of input data. Our second model introduces a hybrid quantum neural network with a Quanvolutional layer, reducing image resolution via a convolution process. The model matches the performance of its classical counterpart, having four times fewer trainable parameters, and outperforms a classical model with equal weight parameters. These models represent advancements in quantum machine learning research and illuminate the path towards more accurate image classification systems.

arXiv:2304.09224•Machine Learning Science and Technology•Feb 20, 2024•181 citations

Benchmarking MedMNIST dataset on real quantum hardware

Gurinder Singh, Hongni Jin, Kenneth M. Merz

Quantum machine learning (QML) has emerged as a promising domain to leverage the computational capabilities of quantum systems to solve complex classification tasks. In this work, we present the first comprehensive QML study by benchmarking the MedMNIST-a diverse collection of medical imaging datasets on a 127-qubit real IBM quantum hardware, to evaluate the feasibility and performance of quantum models (without any classical neural networks) in practical applications. This study explores recent advancements in quantum computing such as device-aware quantum circuits, error suppression, and mitigation for medical image classification. The proposed methodology is comprised of three stages: preprocessing, generation of noise-resilient and hardware-efficient quantum circuits, optimizing/training of quantum circuits on classical hardware, and inference on real IBM quantum hardware. Firstly, we process all input images in the preprocessing stage to reduce the spatial dimension due to quantum hardware limitations. We generate hardware-efficient quantum circuits using backend properties expressible to learn complex patterns for medical image classification. After classical optimization of QML models, we perform inference on real quantum hardware. We also incorporate advanced error suppression and mitigation techniques in our QML workflow, including dynamical decoupling (DD), gate twirling (Twir), and matrix-free measurement mitigation (M3) to mitigate the effects of noise and improve classification performance. The experimental results showcase the potential of quantum computing for medical imaging and establish a benchmark for future advancements in QML applied to healthcare.

Scientific Reports•Feb 14, 2026•8 citations
Quantum machine learning on real noisy intermediate-scale quantum (NISQ) hardware has remained largely confined to binary or few-class tasks, limited by the cost of on-hardware training and the underuse of large devices at inference. We present a unified framework that classifies ten-class MNIST end-to-end on a 127127127-qubit IBM Eagle processor, with three central contributions. First, a two-phase protocol decouples a gradient-based classical optimization of the encoder and readout from a gradient-free optimization of the quantum parameters, removing the parameter-shift gradient cost that makes on-hardware training impractical. Second, we introduce Quantum Multi-Programming to a trained quantum classifier for the first time, packing multiple circuit copies onto one device to deliver parallel inference at no mean-accuracy cost while cutting quantum-processor job submissions proportionally. Third, a controlled comparison shows that on-hardware fine-tuning yields no measurable accuracy gain, motivating a practical NISQ workflow: train on a classical simulator and reserve the hardware for inference only. Benchmarked against a matched-capacity classical network, the quantum module shows no per-parameter accuracy advantage at this scale; we therefore frame the work as a feasibility-and-workflow demonstration for multi-class quantum image classification on current hardware.
This study investigates classification performance and trainability of variational quantum classifiers on near-term noisy quantum hardware across circuit depth and qubit count regimes within the context of quantum computing and machine learning, an area of growing scientific importance given its implications for hybrid quantum-classical algorithm design and practical NISQ hardware benchmarking for near-term quantum advantage assessment. Using gradient-based parameter optimization of parameterized quantum circuits with hardware noise modeling via density matrix simulation and physical execution on IBM Eagle processors, we examine expressibility of parameterized circuits enabling nonlinear decision boundaries in feature Hilbert space, with trainability constrained by barren plateau gradients at large qubit counts in 96 circuit architectures (4 qubit counts x 4 depths x 6 ansatz families) evaluated across 5 classification datasets with 20 random initialization seeds each drawn from IBM Quantum Eagle (127-qubit) and Falcon (27-qubit) processors with noise mitigation via zero-noise extrapolation. Results indicate that 10-qubit, 4-layer VQC achieves 84.2% classification accuracy on the best benchmark, within 3.8 percentage points of classical SVM, but gradient variance decays exponentially with qubit count (variance halving per 2 added qubits), confirming barren plateau scaling (p < 0.001), with 84.2% accuracy, 3.8 pp gap to classical SVM baseline as the primary quantitative benchmark. Concordance between primary and confirmatory measurement approaches exceeded 93%, validating the analytical framework. These findings contribute empirically to quantum computing and machine learning and carry actionable implications for the design of programs and policies targeting hybrid quantum-classical algorithm design and practical NISQ hardware benchmarking for near-term quantum advantage assessment.
Quantum machine learning (QML) has emerged as a promising domain to leverage the computational capabilities of quantum systems to solve complex classification tasks. In this work, we present the first comprehensive QML study by benchmarking the MedMNIST-a diverse collection of medical imaging datasets on a 127-qubit real IBM quantum hardware, to evaluate the feasibility and performance of quantum models (without any classical neural networks) in practical applications. This study explores recent advancements in quantum computing such as device-aware quantum circuits, error suppression, and mitigation for medical image classification. Our methodology is comprised of three stages: preprocessing, generation of noise-resilient and hardware-efficient quantum circuits, optimizing/training of quantum circuits on classical hardware, and inference on real IBM quantum hardware. Firstly, we process all input images in the preprocessing stage to reduce the spatial dimension due to quantum hardware limitations. We generate hardware-efficient quantum circuits using backend properties expressible to learn complex patterns for medical image classification. After classical optimization of QML models, we perform inference on real quantum hardware. We also incorporate advanced error suppression and mitigation techniques in our QML workflow, including dynamical decoupling (DD), gate twirling, and matrix-free measurement mitigation (M3) to mitigate the effects of noise and improve classification performance. The experimental results showcase the potential of quantum computing for medical imaging and establish a benchmark for future advancements in QML applied to healthcare.
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.
While classical convolutional neural networks (CNNs) have revolutionized imageclassification, the emergence of quantum CNNs (QCNNs) presents new opportunities with high-dimensional transformations that are infeasible for classicalCNNs. However, their implementation on current noisy intermediate-scale quantum (NISQ) devices remains challenging due to hardware limitations. In ourresearch, we address this challenge by introducing fragment encoding that significantly reduces the input dimensionality. We show that accuracy improvesas the number of qubits increases from 1 to 4 to 16, providing evidence offavorable scaling. Motivated by this, we developed a primitive QCNN architecture with 49 qubits which is sufficient to directly process 28 × 28 pixelMNIST images, eliminating the need for classical dimensionality reductionpre-processing. Additionally, we propose an automated framework based onexpressibility, entanglement, and complexity characteristics to identify the building blocks of QCNNs, parameterized quantum circuits (PQCs). Our approachdemonstrates advantages in convergence speed with a similar parameter countcompared to both hybrid QCNNs and classical CNNs. We validated our experiments on IBM’s Heron r2 quantum processor, achieving 96.08% accuracy withapproximately 70% faster convergence relative to classical CNNs under identicaltraining conditions. Our results show that simple image-classification tasks canbe realized on real quantum hardware today.
Abstract Image classification, a pivotal task in multiple industries, faces computational challenges due to the burgeoning volume of visual data. This research addresses these challenges by introducing two quantum machine learning models that leverage the principles of quantum mechanics for effective computations. Our first model, a hybrid quantum neural network with parallel quantum circuits, enables the execution of computations even in the noisy intermediate-scale quantum era, where circuits with a large number of qubits are currently infeasible. This model demonstrated a record-breaking classification accuracy of 99.21% on the full MNIST dataset, surpassing the performance of known quantum–classical models, while having eight times fewer parameters than its classical counterpart. Also, the results of testing this hybrid model on a Medical MNIST (classification accuracy over 99%), and on CIFAR-10 (classification accuracy over 82%), can serve as evidence of the generalizability of the model and highlights the efficiency of quantum layers in distinguishing common features of input data. Our second model introduces a hybrid quantum neural network with a Quanvolutional layer, reducing image resolution via a convolution process. The model matches the performance of its classical counterpart, having four times fewer trainable parameters, and outperforms a classical model with equal weight parameters. These models represent advancements in quantum machine learning research and illuminate the path towards more accurate image classification systems.
Quantum machine learning (QML) has emerged as a promising domain to leverage the computational capabilities of quantum systems to solve complex classification tasks. In this work, we present the first comprehensive QML study by benchmarking the MedMNIST-a diverse collection of medical imaging datasets on a 127-qubit real IBM quantum hardware, to evaluate the feasibility and performance of quantum models (without any classical neural networks) in practical applications. This study explores recent advancements in quantum computing such as device-aware quantum circuits, error suppression, and mitigation for medical image classification. The proposed methodology is comprised of three stages: preprocessing, generation of noise-resilient and hardware-efficient quantum circuits, optimizing/training of quantum circuits on classical hardware, and inference on real IBM quantum hardware. Firstly, we process all input images in the preprocessing stage to reduce the spatial dimension due to quantum hardware limitations. We generate hardware-efficient quantum circuits using backend properties expressible to learn complex patterns for medical image classification. After classical optimization of QML models, we perform inference on real quantum hardware. We also incorporate advanced error suppression and mitigation techniques in our QML workflow, including dynamical decoupling (DD), gate twirling (Twir), and matrix-free measurement mitigation (M3) to mitigate the effects of noise and improve classification performance. The experimental results showcase the potential of quantum computing for medical imaging and establish a benchmark for future advancements in QML applied to healthcare.