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

Clinical Chemistry

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, Elizabeth Knight, Brent G. Nelson, H. Patrick Young, Lucila Ohno-machado A, Wade L. Schulz

Published Dec 18, 2025• 11 citations
Publisher

Abstract

Abstract Background Quantum machine learning (QML) 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 (QC-REUP)—in comparison to classical machine learning and other QML methods. Performance was assessed using both benchmarking data sets and real-world laboratory medicine data. Methods Four data sets containing between 2 and 30 features were selected for evaluation. Initial baseline comparisons of classification performance (F1 score) were conducted using all algorithms—QC-REUP, 2 QML, and 4 classical machine learning (ML) algorithms—across the four data sets. Configuration parameters were then optimized for the QC-REUP algorithm using a previously published data set of plasma amino acid (PAA) profiles to determine the impact of optimization on classification performance, followed by a final comparison against classical ML algorithms. Results Baseline comparisons showed that QC-REUP outperformed quantum and linear classical algorithms on lower-dimensional data sets. However, as input dimensionality increased, QML F -score declined. Following optimization, QC-REUP improved relative to baseline, and again performed comparably to linear algorithms, but ultimately demonstrated lower performance than nonlinear classical ML algorithms on the PAA data set. Conclusion This study suggests that data re-uploading algorithms can perform comparably to classical approaches in specific contexts, particularly with low-dimensional data. While optimization can enhance performance, further improvements in quantum hardware and algorithmic development are likely needed before QML can be effectively applied in laboratory medicine and broader biomedical research.

DOI
10.1093/clinchem/hvaf192

Related papers

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•6 citations

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

On Depth, Robustness and Performance Using the Data Re-Uploading Single-Qubit Classifier

Philip Easom, Ahmed Bouridane, Ammar Belatreche +1 more

Quantum machine learning (QML) is a new field in its infancy, promising performance enhancements over many classical machine learning (ML) algorithms. Data reuploading is a QML algorithm with a focus on utilizing the power of a singular qubit as an individually capable classifier. Recently, there have been studies set out to explore the concept of data re-uploading in a classification setting, however, important aspects are often not considered in experiments, which may hinder our understanding of the methodology’s performance. In this work, we conduct an analysis of the single-qubit data re-uploading methodology, in relation to the effect that system depth has on classification and robustness performances against the influence of environmental noise during training. This is aimed towards bridging together previous works in order to solidify the concepts of the methodology, and provide reasonable insight into how transferable the methodology is when applied to non-synthetic data. To further demonstrate the findings, we also analyse the results of a case study using a subset of MNIST data. From this work, our experimental results support that an increase in system depth can lead to higher classification performances, as well as improved stability during training in noisy environments, with the sharpest performance improvements seemingly occurring between 1–3 uploading layer repetitions. Leading on from our experimental results, we suggest areas for further exploration, to ensure we can maximize classification performance when using the data re-uploading methodology.

IEEE Access•Jan 1, 2021•27 citations

Quantum Machine Learning Algorithms for Optimizing Complex Data Classification Tasks

Ramya Mandava, Gullapalli Lasya Sravanthi

Quantum Machine Learning (QML) has emerged as a paradigm that combines the computational advantages of quantum computing with the predictive capabilities of machine learning to address complex data classification problems. As data dimensionality increases rapidly and classical learning algorithms face scalability constraints, QML leverages quantum parallelism, entanglement, and high-dimensional Hilbert space representations to enhance learning performance. This paper reviews and analyses advanced QML algorithms, including Quantum Support Vector Machines (QSVM), Variational Quantum Circuits (VQC), Quantum Neural Networks (QNN), and Quantum Kernel Estimation, for optimizing both binary and multi-class classification tasks under high-complexity conditions. The proposed QML framework is evaluated on benchmark datasets like MNIST, the Breast Cancer Wisconsin (BCW) dataset, and synthetic nonlinear datasets, and is compared against classical machine learning baselines, including Support Vector Machines (SVM), Random Forests (RF), and Deep Neural Networks (DNN). The results demonstrate notable improvements in classification accuracy (up to 96.8%), decision margins, and computational efficiency in quantum-suitable data regimes, while also highlighting current limitations related to noise, circuit depth, and hardware constraints. Overall, the study presents a unified QML framework, theoretical formulations, and experimental evaluations that illustrate the potential of quantum algorithms for next-generation classification tasks.

Journal of Transactions in Systems Engineering•Jan 5, 2026•4 citations

From Classical to Quantum: Evaluating Machine Learning Enhancements

A. Senthilselvi, S Narendrakumar, G V Madhav Ram Samanvay +3 more

Quantum computing has been a source of hype in the past few years—especially in its application to machine learning (ML) use-cases. This paper compares QML algorithms to traditional ML for a variety of classification problems yielding an overview on potential applications that quantum technologies can either complement or provide superior performance. The paper begins by outlining the fundamental principles of quantum computing required for its application in machine learning. This article will highlight key ideas such as quantum parallelism and the use of quantum interference in n-computing efficiency. The conversation turns to Quantum machine learning Algorithms, in comparison with Classical algorithms without any further ado and specific quantum algorithmic extensions which are available for the problem of machines. These quantum algorithms are analyzed in terms of computational speed and accuracy, leveraging qubits to potentially accelerate learning processes and achieve improved results. Both the prospects and challenges of quantum algorithms for practical ML applications, by combining empirical data with insights from theory. The study also investigates how these limitations of quantum computing today such as qubit coherence, error rates and scalability are likely to impact the practical deployment of QML. In the final sections, the paper discusses next steps and future directions for quantum machine learning with a focus on potential milestones that could lift current obstacles to merge more deeply classical and quantum tools of data analysis. The article provides an in-depth data-driven perspective on the emerging intersection of these two fields with a view towards their potential future impact within quantum machine learning.

International Conference on Advances in Computation, Communication and Information Technology (ICAICCIT)•Nov 28, 2024•11 citations

A didactic approach to quantum machine learning with a single qubit

Elena Peña Tapia, Giannicola Scarpa, Alejandro Pozas-Kerstjens

Abstract This paper presents, via an explicit example with a real-world dataset, a hands-on introduction to the field of quantum machine learning (QML). We focus on the case of learning with a single qubit, using data re-uploading techniques. After a discussion of the relevant background in quantum computing and machine learning we provide a thorough explanation of the data re-uploading models that we consider, and implement the different proposed formulations in toy and real-world datasets using the qiskit quantum computing SDK. We find that, as in the case of classical neural networks, the number of layers is a determining factor in the final accuracy of the models. Moreover, and interestingly, the results show that single-qubit classifiers can achieve a performance that is on-par with classical counterparts under the same set of training conditions. While this cannot be understood as a proof of the advantage of quantum machine learning, it points to a promising research direction, and raises a series of questions that we outline.

arXiv:2211.13191•Physica Scripta•Mar 20, 2023•14 citations
Abstract Background Quantum machine learning (QML) 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 (QC-REUP)—in comparison to classical machine learning and other QML methods. Performance was assessed using both benchmarking data sets and real-world laboratory medicine data. Methods Four data sets containing between 2 and 30 features were selected for evaluation. Initial baseline comparisons of classification performance (F1 score) were conducted using all algorithms—QC-REUP, 2 QML, and 4 classical machine learning (ML) algorithms—across the four data sets. Configuration parameters were then optimized for the QC-REUP algorithm using a previously published data set of plasma amino acid (PAA) profiles to determine the impact of optimization on classification performance, followed by a final comparison against classical ML algorithms. Results Baseline comparisons showed that QC-REUP outperformed quantum and linear classical algorithms on lower-dimensional data sets. However, as input dimensionality increased, QML F -score declined. Following optimization, QC-REUP improved relative to baseline, and again performed comparably to linear algorithms, but ultimately demonstrated lower performance than nonlinear classical ML algorithms on the PAA data set. Conclusion This study suggests that data re-uploading algorithms can perform comparably to classical approaches in specific contexts, particularly with low-dimensional data. While optimization can enhance performance, further improvements in quantum hardware and algorithmic development are likely needed before QML can be effectively applied in laboratory medicine and broader biomedical research.
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.
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 (QML) is a new field in its infancy, promising performance enhancements over many classical machine learning (ML) algorithms. Data reuploading is a QML algorithm with a focus on utilizing the power of a singular qubit as an individually capable classifier. Recently, there have been studies set out to explore the concept of data re-uploading in a classification setting, however, important aspects are often not considered in experiments, which may hinder our understanding of the methodology’s performance. In this work, we conduct an analysis of the single-qubit data re-uploading methodology, in relation to the effect that system depth has on classification and robustness performances against the influence of environmental noise during training. This is aimed towards bridging together previous works in order to solidify the concepts of the methodology, and provide reasonable insight into how transferable the methodology is when applied to non-synthetic data. To further demonstrate the findings, we also analyse the results of a case study using a subset of MNIST data. From this work, our experimental results support that an increase in system depth can lead to higher classification performances, as well as improved stability during training in noisy environments, with the sharpest performance improvements seemingly occurring between 1–3 uploading layer repetitions. Leading on from our experimental results, we suggest areas for further exploration, to ensure we can maximize classification performance when using the data re-uploading methodology.
Quantum Machine Learning (QML) has emerged as a paradigm that combines the computational advantages of quantum computing with the predictive capabilities of machine learning to address complex data classification problems. As data dimensionality increases rapidly and classical learning algorithms face scalability constraints, QML leverages quantum parallelism, entanglement, and high-dimensional Hilbert space representations to enhance learning performance. This paper reviews and analyses advanced QML algorithms, including Quantum Support Vector Machines (QSVM), Variational Quantum Circuits (VQC), Quantum Neural Networks (QNN), and Quantum Kernel Estimation, for optimizing both binary and multi-class classification tasks under high-complexity conditions. The proposed QML framework is evaluated on benchmark datasets like MNIST, the Breast Cancer Wisconsin (BCW) dataset, and synthetic nonlinear datasets, and is compared against classical machine learning baselines, including Support Vector Machines (SVM), Random Forests (RF), and Deep Neural Networks (DNN). The results demonstrate notable improvements in classification accuracy (up to 96.8%), decision margins, and computational efficiency in quantum-suitable data regimes, while also highlighting current limitations related to noise, circuit depth, and hardware constraints. Overall, the study presents a unified QML framework, theoretical formulations, and experimental evaluations that illustrate the potential of quantum algorithms for next-generation classification tasks.
Quantum computing has been a source of hype in the past few years—especially in its application to machine learning (ML) use-cases. This paper compares QML algorithms to traditional ML for a variety of classification problems yielding an overview on potential applications that quantum technologies can either complement or provide superior performance. The paper begins by outlining the fundamental principles of quantum computing required for its application in machine learning. This article will highlight key ideas such as quantum parallelism and the use of quantum interference in n-computing efficiency. The conversation turns to Quantum machine learning Algorithms, in comparison with Classical algorithms without any further ado and specific quantum algorithmic extensions which are available for the problem of machines. These quantum algorithms are analyzed in terms of computational speed and accuracy, leveraging qubits to potentially accelerate learning processes and achieve improved results. Both the prospects and challenges of quantum algorithms for practical ML applications, by combining empirical data with insights from theory. The study also investigates how these limitations of quantum computing today such as qubit coherence, error rates and scalability are likely to impact the practical deployment of QML. In the final sections, the paper discusses next steps and future directions for quantum machine learning with a focus on potential milestones that could lift current obstacles to merge more deeply classical and quantum tools of data analysis. The article provides an in-depth data-driven perspective on the emerging intersection of these two fields with a view towards their potential future impact within quantum machine learning.
Abstract This paper presents, via an explicit example with a real-world dataset, a hands-on introduction to the field of quantum machine learning (QML). We focus on the case of learning with a single qubit, using data re-uploading techniques. After a discussion of the relevant background in quantum computing and machine learning we provide a thorough explanation of the data re-uploading models that we consider, and implement the different proposed formulations in toy and real-world datasets using the qiskit quantum computing SDK. We find that, as in the case of classical neural networks, the number of layers is a determining factor in the final accuracy of the models. Moreover, and interestingly, the results show that single-qubit classifiers can achieve a performance that is on-par with classical counterparts under the same set of training conditions. While this cannot be understood as a proof of the advantage of quantum machine learning, it points to a promising research direction, and raises a series of questions that we outline.