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

Journal of Physics Communications

Development of hybrid quantum classifiers for realistic classification tasks

Sara Aminpour, Safura Sharifi, Yaser Mike Banad

Published Feb 1, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.1088/2399-6528/ae4440

Related papers

Boosting Quantum Classifier Efficiency through Data Re-Uploading and Dual Cost Functions

Sara Aminpour, Mike Banad, Safura Sharifi

Abstract Quantum machine learning integrates quantum computing with classical machine learning techniques to enhance computational power and efficiency. A major challenge in Quantum machine learning is developing robust quantum classifiers capable of accurately processing and classifying complex datasets. In this work, we present an advanced approach leveraging data re-uploading, a strategy that cyclically encodes classical data into quantum states to improve classifier performance. We examine two cost functions—fidelity and trace distance—across various quantum classifier configurations, including single-qubit, two-qubit, and entangled two-qubit systems. Additionally, we evaluate four optimization techniques (L-BFGS-B, COBYLA, Nelder-Mead, and SLSQP) to determine their effectiveness in optimizing quantum circuits for both linear and non-linear classification tasks. Our results show that the choice of optimization method significantly impacts classifier performance, with L-BFGS-B and COBYLA often yielding superior accuracy. The two-qubit entangled classifier shows improved accuracy over its non-entangled counterpart, albeit with increased computational cost. Also, the two-qubit entangled classifier are the best option for real word random dataset in order to accuracy and computational cost. Linear classification tasks generally exhibit more stable performance across optimization techniques compared to non-linear tasks. Our findings highlight the potential of data re-uploading in Quantum machine learning outperforming existing quantum classifier models in terms of accuracy and robustness. This work contributes to the growing field of Quantum machine learning by providing a comprehensive comparison of classification strategies and optimization techniques in quantum computing environments, offering a foundation for developing more efficient and accurate quantum classifiers.

•Sep 19, 2025•1 citation

Strategic Data Re-Uploads: A Pathway to Improved Quantum Classification Data Re-Uploading Strategies for Improved Quantum Classifier Performance

Sara Aminpour, Yaser Mike Banad, Safura Sharifi

Quantum machine learning integrates quantum computing with classical machine learning techniques to enhance computational power and efficiency. A major challenge in quantum machine learning is developing robust quantum classifiers capable of accurately processing and classifying complex datasets. In this work, we present an advanced approach leveraging data re-uploading, a strategy that cyclically encodes classical data into quantum states to improve classifier performance. We examine two cost functions, fidelity and trace distance, across various quantum classifier configurations, including single-qubit, two-qubit, and entangled two-qubit systems. Additionally, we evaluate four optimization techniques (L-BFGS-B, COBYLA, Nelder-Mead, and SLSQP) to determine their effectiveness in optimizing quantum circuits for both linear and non-linear classification tasks. Our results show that the choice of optimization method significantly impacts classifier performance, with L-BFGS-B and COBYLA often yielding superior accuracy. The two-qubit entangled classifier shows improved accuracy over its non-entangled counterpart, albeit with increased computational cost. Also, the two-qubit entangled classifier is the best option for real-world random datasets in terms of accuracy and computational cost. Linear classification tasks generally exhibit more stable performance across optimization techniques compared to non-linear tasks. Our findings highlight the potential of data re-uploading in quantum machine learning, outperforming existing quantum classifier models in terms of accuracy and robustness. This work contributes to the growing field of quantum machine learning by providing a comprehensive comparison of classification strategies and optimization techniques in quantum computing environments, offering a foundation for developing more efficient and accurate quantum classifiers.

arXiv:2405.09377•Entropy•May 13, 2026•1 citation

Quantum Machine Learning Performance Analysis: Accuracy and Efficiency Trade-offs in Linear Classification

Sara Aminpour, Yaser Mike Banad, Safura Sharifi

This study introduces the Nelder-Mead minimization method for data reuploading and examines the performance of quantum machine learning algorithms for linear classification using 1-qubit, 2-qubit, and 2-qubit entangled systems. We analyze accuracy and computation time across varying training sample sizes, revealing trade-offs between classification performance and computational efficiency in quantum systems.

Frontiers in Optics•Jan 1, 2024•0 citations

Quantum Machine Learning for Classification Tasks:Variational Quantum Classifiers and Quantum Neural Networks

Dr K N S Lakshmi, Bondalapu Sandhya, Nasari Durga Prasad +2 more

Quantum Machine Learning (QML) has emerged as a compelling research domain that unites quantum computing principles with classical learning theory to address computationally demanding classification problems.This paper investigates two principal QML architectures-Variational Quantum Classifiers (VQC) and Quantum Neural Networks (QNN)-within the context of binary classification.We present an end-to-end hybrid quantum-classical pipeline applied to the UCI Mushroom dataset, comprising 22 categorical attributes, and demonstrate that quantumenhanced models can achieve competitive classification performance under present-day hardware constraints.The pipeline integrates Quantum Random Access Code (QRAC) encoding for dimensionality reduction, ZZFeatureMapbased quantum feature mapping, RealAmplitudes parameterized ansatz, and classical optimizer-driven parameter updates using the COBYLA algorithm.The complete system is deployed through a Flask web interface and containerized with Docker for reproducibility.Experimental results on a quantum simulator indicate a classification accuracy of 87.4%, precision of 0.891, and recall of 0.863, establishing the practical viability of NISQ-era quantum classifiers for structured categorical data.The paper further analyzes convergence behavior, circuit depth effects, and comparative performance against classical baselines, providing insights into the strengths and limitations of current QML architectures for real-world classification deployment.

Journal of Science Engineering Technology and Management Sciences•Mar 1, 2026•0 citations

Quantum Machine Learning and Data Re-Uploading: Evaluation on Benchmark and Laboratory Medicine Data Sets

Thomas J S Durant, Seung Joo (Erin) Lee, Sarah Nixon Dudgeon +5 more

ABSTRACT Background Quantum machine learning is an emerging field that may offer unique advantages over classical machine learning but has not been extensively studied with real-world healthcare data of practical size. This study evaluates the performance of a recently proposed quantum machine learning algorithm—quantum circuits with data re-uploading—compared to classical machine learning and other common quantum algorithms, using both benchmarking data and real-world laboratory medicine data. Methods Four datasets containing between 2 and 30 features were selected for evaluation. The quantum re-uploading algorithm was compared against variational quantum classifiers, quantum neural networks and four, commonly used classical machine learning algorithms. Initial, baseline comparisons of classification performance (F1 score) were conducted using all algorithms across the four datasets. Configuration parameters were then optimized for the quantum data re-uploading algorithm using a previously published dataset of plasma amino acid profiles to determine the impact of optimization on classification performance, followed by a final comparison against classical ML algorithms. Results Baseline comparisons of quantum re-uploading showed superior classification performance on lower-dimensional datasets compared to quantum and linear ML algorithms. However, performance declined significantly as the number of input features increased. While optimization improved classification performance, marked variability was observed. Following optimization, the quantum re- uploading algorithm again performed comparably to linear algorithms but had lower classification performance on the plasma amino acid dataset compared to non-linear classical algorithms. Conclusion This study suggests that quantum data-reuploading algorithms can achieve classification performance comparable to some classical methods on lower-dimensional datasets, presenting opportunities for early research applications in laboratory medicine. However, while optimizing configuration parameters can improve classification performance, further advancements in quantum hardware and algorithm design will likely be necessary for quantum machine learning to become practically viable in laboratory medicine, and biomedical research more broadly.

Clinical Chemistry•Dec 18, 2025•7 citations

Learning with a single qubit: classical training of quantum-inspired classifiers for structured tasks

Sara Aminpour, Yaser Banad, Safura Sharifi

This study investigates a quantum-inspired 1-qubit classifier based on the data re-uploading method, evaluated on two structured classification tasks: the binary “2 Lines” and the multiclass “6 Rectangles”. The model, simulated on classical hardware, is trained using a fidelity-based cost function and optimized with L-BFGS-B, Powell, and TNC minimizers. LBFGS-B achieved the highest accuracy in both tasks (95.2% and 82.9%) with minimal generalization gaps. Powell offered strong performance with fewer samples, while TNC consistently underperformed. Results highlight the importance of selecting minimizers based on task complexity to ensure robust generalization and data efficiency in quantum-inspired models aimed at future real-world applications.

Quantum Computing, Communication, and Simulation•Mar 5, 2026•1 citation
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.
Abstract Quantum machine learning integrates quantum computing with classical machine learning techniques to enhance computational power and efficiency. A major challenge in Quantum machine learning is developing robust quantum classifiers capable of accurately processing and classifying complex datasets. In this work, we present an advanced approach leveraging data re-uploading, a strategy that cyclically encodes classical data into quantum states to improve classifier performance. We examine two cost functions—fidelity and trace distance—across various quantum classifier configurations, including single-qubit, two-qubit, and entangled two-qubit systems. Additionally, we evaluate four optimization techniques (L-BFGS-B, COBYLA, Nelder-Mead, and SLSQP) to determine their effectiveness in optimizing quantum circuits for both linear and non-linear classification tasks. Our results show that the choice of optimization method significantly impacts classifier performance, with L-BFGS-B and COBYLA often yielding superior accuracy. The two-qubit entangled classifier shows improved accuracy over its non-entangled counterpart, albeit with increased computational cost. Also, the two-qubit entangled classifier are the best option for real word random dataset in order to accuracy and computational cost. Linear classification tasks generally exhibit more stable performance across optimization techniques compared to non-linear tasks. Our findings highlight the potential of data re-uploading in Quantum machine learning outperforming existing quantum classifier models in terms of accuracy and robustness. This work contributes to the growing field of Quantum machine learning by providing a comprehensive comparison of classification strategies and optimization techniques in quantum computing environments, offering a foundation for developing more efficient and accurate quantum classifiers.
Quantum machine learning integrates quantum computing with classical machine learning techniques to enhance computational power and efficiency. A major challenge in quantum machine learning is developing robust quantum classifiers capable of accurately processing and classifying complex datasets. In this work, we present an advanced approach leveraging data re-uploading, a strategy that cyclically encodes classical data into quantum states to improve classifier performance. We examine two cost functions, fidelity and trace distance, across various quantum classifier configurations, including single-qubit, two-qubit, and entangled two-qubit systems. Additionally, we evaluate four optimization techniques (L-BFGS-B, COBYLA, Nelder-Mead, and SLSQP) to determine their effectiveness in optimizing quantum circuits for both linear and non-linear classification tasks. Our results show that the choice of optimization method significantly impacts classifier performance, with L-BFGS-B and COBYLA often yielding superior accuracy. The two-qubit entangled classifier shows improved accuracy over its non-entangled counterpart, albeit with increased computational cost. Also, the two-qubit entangled classifier is the best option for real-world random datasets in terms of accuracy and computational cost. Linear classification tasks generally exhibit more stable performance across optimization techniques compared to non-linear tasks. Our findings highlight the potential of data re-uploading in quantum machine learning, outperforming existing quantum classifier models in terms of accuracy and robustness. This work contributes to the growing field of quantum machine learning by providing a comprehensive comparison of classification strategies and optimization techniques in quantum computing environments, offering a foundation for developing more efficient and accurate quantum classifiers.
Quantum Machine Learning (QML) has emerged as a compelling research domain that unites quantum computing principles with classical learning theory to address computationally demanding classification problems.This paper investigates two principal QML architectures-Variational Quantum Classifiers (VQC) and Quantum Neural Networks (QNN)-within the context of binary classification.We present an end-to-end hybrid quantum-classical pipeline applied to the UCI Mushroom dataset, comprising 22 categorical attributes, and demonstrate that quantumenhanced models can achieve competitive classification performance under present-day hardware constraints.The pipeline integrates Quantum Random Access Code (QRAC) encoding for dimensionality reduction, ZZFeatureMapbased quantum feature mapping, RealAmplitudes parameterized ansatz, and classical optimizer-driven parameter updates using the COBYLA algorithm.The complete system is deployed through a Flask web interface and containerized with Docker for reproducibility.Experimental results on a quantum simulator indicate a classification accuracy of 87.4%, precision of 0.891, and recall of 0.863, establishing the practical viability of NISQ-era quantum classifiers for structured categorical data.The paper further analyzes convergence behavior, circuit depth effects, and comparative performance against classical baselines, providing insights into the strengths and limitations of current QML architectures for real-world classification deployment.
ABSTRACT Background Quantum machine learning is an emerging field that may offer unique advantages over classical machine learning but has not been extensively studied with real-world healthcare data of practical size. This study evaluates the performance of a recently proposed quantum machine learning algorithm—quantum circuits with data re-uploading—compared to classical machine learning and other common quantum algorithms, using both benchmarking data and real-world laboratory medicine data. Methods Four datasets containing between 2 and 30 features were selected for evaluation. The quantum re-uploading algorithm was compared against variational quantum classifiers, quantum neural networks and four, commonly used classical machine learning algorithms. Initial, baseline comparisons of classification performance (F1 score) were conducted using all algorithms across the four datasets. Configuration parameters were then optimized for the quantum data re-uploading algorithm using a previously published dataset of plasma amino acid profiles to determine the impact of optimization on classification performance, followed by a final comparison against classical ML algorithms. Results Baseline comparisons of quantum re-uploading showed superior classification performance on lower-dimensional datasets compared to quantum and linear ML algorithms. However, performance declined significantly as the number of input features increased. While optimization improved classification performance, marked variability was observed. Following optimization, the quantum re- uploading algorithm again performed comparably to linear algorithms but had lower classification performance on the plasma amino acid dataset compared to non-linear classical algorithms. Conclusion This study suggests that quantum data-reuploading algorithms can achieve classification performance comparable to some classical methods on lower-dimensional datasets, presenting opportunities for early research applications in laboratory medicine. However, while optimizing configuration parameters can improve classification performance, further advancements in quantum hardware and algorithm design will likely be necessary for quantum machine learning to become practically viable in laboratory medicine, and biomedical research more broadly.
This study investigates a quantum-inspired 1-qubit classifier based on the data re-uploading method, evaluated on two structured classification tasks: the binary “2 Lines” and the multiclass “6 Rectangles”. The model, simulated on classical hardware, is trained using a fidelity-based cost function and optimized with L-BFGS-B, Powell, and TNC minimizers. LBFGS-B achieved the highest accuracy in both tasks (95.2% and 82.9%) with minimal generalization gaps. Powell offered strong performance with fewer samples, while TNC consistently underperformed. Results highlight the importance of selecting minimizers based on task complexity to ensure robust generalization and data efficiency in quantum-inspired models aimed at future real-world applications.