Artificial Intelligence has significantly improved the efficiency of modern recruitment systems. Despite these advances, classical machine learning algorithms often perpetuate bias towards underrepresented groups, particularly in the context of imbalanced datasets. This study investigates whether Quantum Machine Learning (QML), through properties such as superposition and entanglement, can enhance fairness over classical methods. A rigorous system of comparative benchmarking, the Quantum-Fairness Recruitment Engine (Q-FRE), was designed to evaluate six architectures, with three classical (Logistic Regression, SVM, KNN) and three quantum (QSVM, VQC, QNN)-based machine learning algorithms, using real HR data (n=1,470). The results indicate a notable divergence between classical and quantum variational architectures. Classical models were highly accurate (84.7%), but had disastrous fairness errors, where 0% of minority high-performers were identified. This failure was repeated by Quantum SVM. On the other hand, the Variational Quantum Classifier (VQC) and Quantum Neural Network (QNN) were able to identify 29% of minority high-performers with a Disparate Impact Ratio of 0.82, which is legal for fairness. This research demonstrates empirical evidence of a quantifiable Fairness-Accuracy Trade-off: to gain a 29% increase in minority inclusion required a 16% sacrifice of overall accuracy. The results indicate that parameterized quantum circuits provide a possible, though computationally costly, route toward for achieving regulatory compliance in automated hiring.
Artificial Intelligence has significantly improved the efficiency of modern recruitment systems. Despite these advances, classical machine learning algorithms often perpetuate bias towards underrepresented groups, particularly in the context of imbalanced datasets. This study investigates whether Quantum Machine Learning (QML), through properties such as superposition and entanglement, can enhance fairness over classical methods. A rigorous system of comparative benchmarking, the Quantum-Fairness Recruitment Engine (Q-FRE), was designed to evaluate six architectures, with three classical (Logistic Regression, SVM, KNN) and three quantum (QSVM, VQC, QNN)-based machine learning algorithms, using real HR data (n=1,470). The results indicate a notable divergence between classical and quantum variational architectures. Classical models were highly accurate (84.7%), but had disastrous fairness errors, where 0% of minority high-performers were identified. This failure was repeated by Quantum SVM. On the other hand, the Variational Quantum Classifier (VQC) and Quantum Neural Network (QNN) were able to identify 29% of minority high-performers with a Disparate Impact Ratio of 0.82, which is legal for fairness. This research demonstrates empirical evidence of a quantifiable Fairness-Accuracy Trade-off: to gain a 29% increase in minority inclusion required a 16% sacrifice of overall accuracy. The results indicate that parameterized quantum circuits provide a possible, though computationally costly, route toward for achieving regulatory compliance in automated hiring.
A potential path forward is Quantum Machine Learning (QML), which aims to leverage quantum computing in conjunction with classical machine learning to enhance computing efficiency and the expressiveness of models. In this paper, two different quantum classifiers - Variational Quantum Classifier (VQC) and Quantum Kernel Support Vector Machine (QSVM) - are compared with three classical classifiers as baseline classifiers - Logistic Regression, Support Vector Machine (SVM), and a Multi-Layer Perceptron (MLP) - on the Breast Cancer Wisconsin dataset. The quantum circuits were created in the PennyLane framework and simulated on a classical backend. However, in terms of accuracy, classical Logistic Regression performed better with an accuracy of 97.8%, classical SVM and QSVM with an accuracy of 95.6% each, although the Quantum VQC achieved a lower accuracy of 88.9% and had a recall of 100% for the benign class, though it correctly identified only 12 of the 17 malignant cases (a malignant-class recall of approximately 70.6%). The drawback of quantum models is the higher training time; however, since the quantum circuit needs to be classically simulated, the quantum SVM took 23.29 seconds compared to less than 0.01 seconds for the classical linear models. These results indicate that for small structured datasets, classifiers based on quantum computing have not yet surpassed well-tuned classical counterparts. In some respects (e.g., benign-class recall), they perform competitively, though not on malignant-class recall, where the VQC in particular performed worse than the classical baselines, which is worth further investigation on real quantum computers.
Quantum machine learning has emerged as a promising paradigm that leverages quantum computational principles to potentially outperform classical approaches on specific learning tasks. This paper presents a comprehensive empirical investigation comparing Quantum Machine Learning (QML), specifically Quantum Support Vector Machines (QSVM) against Classical Machine Learning (CML) baselines including Logistic Regression, K Nearest Neighbors and classical SVMs. We implement quantum kernel methods using variational quantum circuits with angle embedding, IQP and ZZ feature maps on datasets exhibiting varying structural complexity. Our experiments on synthetic quantum generated datasets (Quantum Parity, Quantum Entanglement, Quantum Interference) demonstrate that QSVM achieves superior classification accuracy with improvements ranging from 2.9 % to 60 % over the best classical baselines achieving a 55.6 % overall win rate. Notably, on the Quantum Parity dataset, QSVM consistently outperformed all classical models across multiple configurations. On real-world benchmark datasets (Breast Cancer, Iris, Wine), QSVM Angle achieved 88% accuracy on Breast Cancer compared to 76% for classical SVM Linear a 15.8 % relative improvement while matching the best classical performance on Iris(100%)and Wine(92%). All experiments were conducted using quantum circuit simulation on classical hardware. These results provide empirical evidence that quantum kernel methods offer meaningful advantages over classical approaches on datasets with complex feature interactions. We discuss the theoretical foundations of these improvements including quantum feature space expressivity and kernel alignment.
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 Machine Learning (QML) has emerged as an interdisciplinary field that harnesses the potential of quantum computing to revolutionize classical machine learning paradigms. This paper presents a benchmarking study focused on four quantum classifier algorithms: Quantum Support Vector Classifier (QSVC), Variational Quantum Circuit (VQC), Quantum Neural Network Classifier (QNNC) and Pegasos Quantum Support Vector Classifier (PegasosQSVC). These quantum classifiers hold promise for unlocking quantum advantages in classification tasks. However, a systematic assessment of their performance across diverse datasets is yet to be fully explored. In this research study, we evaluate and compare the classification performance of quantum machine learning classifiers on various datasets (Breast Cancer, Diabetes, and Titanic) and compare them to a classical model. Our findings revealed that PegasosQSVC consistently maintained high performance across all datasets with the highest average accuracy, recall, and F1-score values of 0.81, 0.72, and 0.71, respectively, followed by VQC, followed by VQC, while QSVC and QNNC perform variably. Nevertheless, QSVC was found to balance performance and training time, achieving an average accuracy of 0.81 and a training time of 177 seconds. Overall, the classical model surpassed QML models as it was up to 10% higher in average accuracy.
In this article, we investigate the applicability of quantum machine learning for classification tasks using two quantum classifiers from the Qiskit Python environment: the variational quantum circuit and the quantum kernel estimator (QKE). We provide a first evaluation on the performance of these classifiers when using a hyperparameter search on six widely known and publicly available benchmark datasets and analyze how their performance varies with the number of samples on two artificially generated test classification datasets. As quantum machine learning is based on unitary transformations, this paper explores data structures and application fields that could be particularly suitable for quantum advantages. Hereby, this paper introduces a novel dataset based on concepts from quantum mechanics using the exponential map of a Lie algebra. This dataset will be made publicly available and contributes a novel contribution to the empirical evaluation of quantum supremacy. We further compared the performance of VQC and QKE on six widely applicable datasets to contextualize our results. Our results demonstrate that the VQC and QKE perform better than basic machine learning algorithms, such as advanced linear regression models (Ridge and Lasso). They do not match the accuracy and runtime performance of sophisticated modern boosting classifiers such as XGBoost, LightGBM, or CatBoost. Therefore, we conclude that while quantum machine learning algorithms have the potential to surpass classical machine learning methods in the future, especially when physical quantum infrastructure becomes widely available, they currently lag behind classical approaches. Our investigations also show that classical machine learning approaches have superior performance classifying datasets based on group structures, compared to quantum approaches that particularly use unitary processes. Furthermore, our findings highlight the significant impact of different quantum simulators, feature maps, and quantum circuits on the performance of the employed quantum estimators. This observation emphasizes the need for researchers to provide detailed explanations of their hyperparameter choices for quantum machine learning algorithms, as this aspect is currently overlooked in many studies within the field. To facilitate further research in this area and ensure the transparency of our study, we have made the complete code available in a linked GitHub repository.
The class imbalance problem presents a critical challenge in real-world applications, particularly in high-stakes domains such as healthcare, finance, disaster management, and fault diagnosis, where accurate anomaly detection is paramount. Class imbalance often disrupts the inherent symmetry of data distributions, resulting in suboptimal performance of traditional machine learning models. Conventional approaches such as undersampling and oversampling are commonly employed to address this issue; however, these methods can introduce additional asymmetries, including information loss and overfitting, which ultimately compromise model efficacy. This study introduces an innovative approach leveraging quantum machine learning (QML), specifically the Variational Quantum Classifier (VQC), to restore and capitalize on the symmetrical properties of data distributions without relying on resampling techniques. By employing quantum circuits optimized to mitigate the asymmetries inherent in imbalanced datasets, the proposed method demonstrates consistently superior performance across diverse datasets, with notable improvements in Recall for minority classes. These findings underscore the potential of quantum machine learning as a robust alternative to classical methods, offering a symmetry-aware solution to class imbalance and advancing QML-driven technologies in fields where equitable representation and symmetry are of critical importance.