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

ICEENG International Conference for Innovations in Intelligent Computing and Cybersecurity (IICC)

Cancer Classification from Gene Expression Data using Quantum K-Nearest Neighbors Classifier

Ahmed Rashed, Ahmed Selim, Sara El‐Metwally

Published May 11, 2026• 0 citations
Publisher

Abstract

Quantum Machine Learning (QML) offers the potential for significant computational speed-ups and enhanced pattern recognition over classical machine learning approaches. In this study, we propose a novel hybrid quantum-classical framework leveraging a Quantum K-Nearest Neighbors (QKNN) classifier for cancer classification via gene expression data. We integrate the classical Fisher Score feature selection algorithm to address the high dimensionality inherent in genomic datasets, and we also integrate SMOTE oversampling techniques to address class imbalance in some datasets. We evaluated our proposed framework on three benchmark gene expression datasets, and our results demonstrate that the QKNN-based approach consistently outperforms classical classifiers. To our knowledge, this is the first application of QKNN for effective cancer classification from gene expression data, highlighting the viability of hybrid quantum workflows in bioinformatics.

DOI
10.1109/iicc69623.2026.11581952

Related papers

A comparative evaluation of quantum machine learning architectures for breast cancer classification using clinical and genomic data

Saartak Allena, Smrithy Girijakumari Sreekantan Nair, Balaji Chandrasekaran

Introduction: In recent years, high-dimensional clinical and genomic data have gained significant importance for prognosis and personalized medicine in breast cancer. But the use of quantum machine learning (QML) on such data is limited by the availability of few qubits, the computation time of quantum simulation, and dimensionality reduction. This work systematically compares several QML architectures for breast cancer classification in the presence of realistic and simulator constraints. Methods: The experiments were performed on a dataset of METABRIC breast cancer patients (2,509 patients). After handling missing values and one-hot encoding, there were 63 features in the processed data set. The feature space was reduced by Principal Component Analysis (PCA) to 12, 4 and 2 components for the implementations of quantum computers, respectively, with 56.10 ± 0.14%, 26.78 ± 0.57% and 16.23 ± 0.33% of the variance retained. Three QML models were tested: Quantum Neural Networks (QNN), Quantum K-Nearest Neighbors (QKNN), and Quantum Support Vector Machines (QSVM), with the models being simulated. Seven classical classification models were tested: Logistic Regression, SVM with RBF kernel, K-Nearest Neighbors, Random Forest, XGBoost, LightGBM and Multilayer Perceptron, both with PCA-matched and full 63-feature representation. All primary results are reported with 5-fold cross validation. Results: Among the evaluated QML architectures, QKNN using 12 principal components achieved the strongest performance, attaining an accuracy of **75.11% ± 3.76%**, an F1-score of **0.7088 ± 0.0433**, and a ROC-AUC of **0.8148 ± 0.0394**. Even though all of the QML models performed significantly poorly in comparison to classical models trained on the entire 63-feature data set, the latter models were able to achieve about **94% accuracy** with XGBoost, Random Forest, and Logistic Regression. The comparison also showed the effect of information loss due to PCA is significant in predictive performance in both classical and quantum models. Discussion: The results show that for high dimensional breast cancer data, currently available simulator-based QML models can learn meaningful patterns with limited quantum resources, but are not as effective as powerful classical machine learning models when complete feature representations are available. The study does not report any sort of quantum advantage or clinical use, but rather a benchmark of current QML architectures that has been rigorously calculated and repeated, with a focus on the impact of dimensionality reduction, validation approaches, and simulator limitations, as well as outlining challenges that need to be overcome prior to practical implementation on real quantum hardware.

Frontiers in Artificial Intelligence•Jul 29, 2026•1 citation

Quantum Machine Learning Algorithms for Genome Disease Diagnosis

Al KhaN, Elnura Usupova

The rapid advancements in genomics and the availability of large-scale genetic datasets have revolutionized our understanding of genetic diseases. However, the complexity and high dimensionality of genomic data pose significant computational challenges for classical machine learning (ML) algorithms. Quantum machine learning (QML), an emerging interdisciplinary field that combines quantum computing with ML techniques, offers a promising solution to address these challenges. This paper explores the application of QML algorithms for diagnosing genetic diseases by leveraging the unique properties of quantum computing, such as superposition, entanglement, and quantum parallelism. A novel hybrid quantum-classical approach is proposed to enhance the accuracy and efficiency of disease diagnosis using genomic datasets. The methodology involves encoding genetic data into quantum states, applying quantum-enhanced feature selection and classification algorithms, and validating the results on publicly available datasets, such as the UK Biobank and the Cancer Genome Atlas (TCGA). Experimental results demonstrate that the proposed QML framework achieves higher classification accuracy and faster computation times compared to classical counterparts. Equations, tables, and charts are used to illustrate the effectiveness of the approach. This research highlights the transformative potential of QML in precision medicine and lays the groundwork for future investigations into quantum-enabled healthcare solutions.

International Symposium on Applied Informatics and Related Areas (AIS)•Nov 13, 2025•2 citations

Comparative Analysis of Quantum Encoding Techniques for Biomarker Classification

Aicha Eutamene, Islam Djemmal, Hacene Belhadef +1 more

Biomarker classification represents a significant task in biological, medical diagnostics, and bioinformatics, where high-dimensional datasets represent challenges to classical machine learning models. The study presented in this paper focuses on the impact of data encoding and explores quantum machine learning algorithms for biomarker classification. Three quantum embedding methods; Angle Embedding, Amplitude Embedding, and IQP (Instantaneous Quantum Polynomial) Embedding, were combined with Quantum Support Vector Machines (QSVM) and Quantum k-Nearest Neighbors (QkNN) and compared against classical SVM and KNN baselines. Principal Component Analysis (PCA) was applied as a preprocessing step to reduce dimensionality. Experiments were conducted on the CuMiDa breast cancer dataset using quantum simulators. Results show that IQP embedding and Angle embedding significantly outperform classical models with QSVM, achieving the best performance, where IQP embedding reaching 93.1% accuracy and an F1-score of 0.93 in higher-dimensional settings, outperforming both the other quantum embeddings and the classical SVM. For QkNN, performance depended on dimensionality, with IQP achieving the strongest results in lower dimensions, including a precision of 87.1%, surpassing both the other quantum embeddings and classical KNN. In higher dimensions, Angle embedding yielded the best quantum results, though classical KNN remained superior. Amplitude embedding consistently underperformed in QSVM but was more competitive in QkNN. These findings demonstrate that advanced quantum data encoding, such as IQP and Angle, can enhance biomarker classification performance and highlight the promise of hybrid quantum-classical approaches in biomedical applications.

IEEE Access•Jan 1, 2025•6 citations

Comparative Analysis of Classical and Quantum Machine Learning Algorithms in Breast Cancer Classification

Kelvin Mpofu, Patience T. Mthunzi-Kufa

Abstract This study presents a comparison between classical machine learning (ML) algorithms and their quantum-enhanced counterparts in classifying scikit’s breast cancer dataset. Specifically, the research focused on evaluating the accuracy and time computational efficiency of quantum-enhanced machine learning (QEML) algorithms against traditional or classical machine learning algorithms. The quantum algorithms employed include the quantum support vector machine (qSVM), variational quantum classifier (VQC) and quantum k-nearest neighbor (qkNN). The qSVM and qkNN algorithms discussed here are really kernel-based hybrid classical-quantum algorithms as opposed to fully quantum algorithms and the VQC is a hybrid classical-quantum algorithm. These algorithms were tested against their classical equivalents: support vector machine (SVM), k-nearest neighbor (kNN), and artificial neural network (ANN). The qSVM algorithm demonstrated an 90% accuracy in distinguishing malignant from benign cancer cases (the classical support vector machine algorithm had a 99% accuracy), while qkNN achieved 90% accuracy (the classical kNN algorithm had an accuracy of 97%), and VQC reported 88.77± 0.26% (averaged over 5 runs) (this was compared with an ANN which had an accuracy of 96%). The accuracies of the classical SVM, kNN, and ANN algorithms were recorded, to provide a basis for comparison. The results indicated that while QEML algorithms perform reasonably well in classification tasks, however they do not consistently outperform classical algorithms. Additionally, the study measured the time efficiency of each algorithm. The ANN required 33.8 seconds, kNN required 0.21 seconds, and SVM required 1.98 seconds to perform the classification tasks. In contrast, the quantum algorithms were significantly slower, with the VQC taking 632.53 seconds, qkNN requiring 495.34 seconds, and qSVM requiring 538.05 seconds (This is not fixed per run but give an impression of the time scales to run the algorithms). We emphasize that this simulation runtime does not reflect actual quantum hardware performance, where gate execution and circuit depth constraints differ significantly. To mitigate this ambiguity, we distinguish between simulation runtime and estimated quantum runtime where relevant. This work potentially highlights the cases where it may not offer any advantage to use quantum machine learning algorithms. The Receiver Operating Characteristic (ROC) curve and the Area Under the Curve (AUC) analysis are also considered in this work where the values measured for the SVM, kNN and ANN were 99%, 99% and 99% respectively and for the qSVM, qkNN and VQC were 87%, 86% and 86± 0.2% (averaged over 5 runs) respectively. Overall, this research contributes valuable insights into the comparative performance of classical and quantum ML algorithms in a specific application, underscoring the potential and current limitations of quantum approaches in machine learning tasks. Hyperparameter optimization was done for all the algorithms, both quantum and classical, with Optuna. This was primarily because the QEML algorithms had more parameters and required considerable computational resources to optimize. This could have influenced the performance outcomes and is the basis for future work. The development of key comparison criteria is critical in the development of quantum machine learning, and this work offers some building blocks for this.

•May 12, 2026•0 citations

Bioinformatics Approach to Cancer Prediction using Quantum Clustering Algorithm for Behavioral Similarity in Gene Expression

Shanu Das, Pritam Bhattacharjee, Kunal Das +1 more

This study introduces a Hybrid Quantum K-Means Clustering Algorithm with automatic cluster detection for classifying cancerous and non-cancerous gene expression data. The method employs Quantum Multi-Feature Mapping for state encoding, Swap Test-based quantum distance estimation, and Quantum Gradient-Based Optimization to dynamically identify the optimal number of clusters by minimizing intra-cluster variance. Initial centroids are selected through a probability-proportional distance strategy, improving stability and accuracy. Applied to breast cancer datasets, the approach surpasses the existing quantum K-Means algorithm, achieving a Silhouette Score of 0.641 (compared to 0.601), a Calinski-Harabasz Index of 766.57 (compared to 617.65), and a Davies-Bouldin Index of 0.659 (compared to 0.704). These results indicate superior cluster compactness and separation. Although the proposed algorithm exhibits slightly higher time complexity O (N×Kmax×Mobs) due to iterative optimization, it significantly outperforms predefined-K quantum K-Means in clustering accuracy, error reduction, and practical feasibility. Its efficiency in handling high-dimensional data and resilience to quantum noise highlights its potential for real-world bioinformatics applications, particularly in cancer classification using gene expression profiles.

Journal of Visualized Experiments•Jan 9, 2026•1 citation

Comparative Evaluation Of Classical And Quantum Machine Learning Models For Breast Cancer Diagnosis And Sustainable Healthcare

Matam Santoshi Kumari, M. Sushanth Babu, H. Y. Shrivalli +1 more

Breast cancer is rated as one of the top leading diagnosed and deadliest cancers affecting women worldwide and causing high mortality rate among cancers. With the data-driven applications, hybrid quantum-classical machine learning models have evolved as significant alternatives for handling complex feature spaces with the growing interest in quantum computing. This paper presents a systematic comparative study of classical and quantum machine learning approaches for breast cancer classification using the Wisconsin Breast Cancer Dataset. In this architecture we have preprocessed classical feature vectors using standard normalized techniques and parallelly quantum states are mapped through data embedding techniques which relies on parameterized rotational gates. In this work we have implemented all quantum models using the Pennylane library, resulting in hybrid quantum–classical optimization on near-term quantum simulators. The comparison results in multiple classical and quantum models. In classical we have Support Vector Machine (SVM), K-Nearest Neighbors (KNN) and Convolutional Neural Networks (CNN), which are compared with the quantum-based models such as the Variational Quantum Classifier (VQC), Quantum Support Vector Machine (QSVM) and Quantum Convolutional Neural Network (QCNN). In QSVM, we have performed dimensionality reduction using Principal Component Analysis (PCA) before to quantum embedding, and quantum-generated features are used to train a classical linear SVM. The evaluation metrics results in accuracy, precision, recall, F1-score, ROC curves and confusion matrices. The classical models achieves the accuracy in the range of 94%-96%, whereas competitive performance of quantum models demonstrate depending on the embedding strategy and circuit configuration. In the implemented quantum models, the variational quantum classifier achieved the highest classification accuracy of 96.06%, surpassing other evaluated models. These results demonstrate quantum embedding combined with variational quantum circuits can effectively capture discriminative patterns in medical datasets, indicating the implementation of quantum machine learning models for breast cancer diagnosis with the present quantum simulating platforms.

International Journal of Environmental Sciences•Jan 6, 2026•0 citations
Quantum Machine Learning (QML) offers the potential for significant computational speed-ups and enhanced pattern recognition over classical machine learning approaches. In this study, we propose a novel hybrid quantum-classical framework leveraging a Quantum K-Nearest Neighbors (QKNN) classifier for cancer classification via gene expression data. We integrate the classical Fisher Score feature selection algorithm to address the high dimensionality inherent in genomic datasets, and we also integrate SMOTE oversampling techniques to address class imbalance in some datasets. We evaluated our proposed framework on three benchmark gene expression datasets, and our results demonstrate that the QKNN-based approach consistently outperforms classical classifiers. To our knowledge, this is the first application of QKNN for effective cancer classification from gene expression data, highlighting the viability of hybrid quantum workflows in bioinformatics.
Introduction: In recent years, high-dimensional clinical and genomic data have gained significant importance for prognosis and personalized medicine in breast cancer. But the use of quantum machine learning (QML) on such data is limited by the availability of few qubits, the computation time of quantum simulation, and dimensionality reduction. This work systematically compares several QML architectures for breast cancer classification in the presence of realistic and simulator constraints. Methods: The experiments were performed on a dataset of METABRIC breast cancer patients (2,509 patients). After handling missing values and one-hot encoding, there were 63 features in the processed data set. The feature space was reduced by Principal Component Analysis (PCA) to 12, 4 and 2 components for the implementations of quantum computers, respectively, with 56.10 ± 0.14%, 26.78 ± 0.57% and 16.23 ± 0.33% of the variance retained. Three QML models were tested: Quantum Neural Networks (QNN), Quantum K-Nearest Neighbors (QKNN), and Quantum Support Vector Machines (QSVM), with the models being simulated. Seven classical classification models were tested: Logistic Regression, SVM with RBF kernel, K-Nearest Neighbors, Random Forest, XGBoost, LightGBM and Multilayer Perceptron, both with PCA-matched and full 63-feature representation. All primary results are reported with 5-fold cross validation. Results: Among the evaluated QML architectures, QKNN using 12 principal components achieved the strongest performance, attaining an accuracy of **75.11% ± 3.76%**, an F1-score of **0.7088 ± 0.0433**, and a ROC-AUC of **0.8148 ± 0.0394**. Even though all of the QML models performed significantly poorly in comparison to classical models trained on the entire 63-feature data set, the latter models were able to achieve about **94% accuracy** with XGBoost, Random Forest, and Logistic Regression. The comparison also showed the effect of information loss due to PCA is significant in predictive performance in both classical and quantum models. Discussion: The results show that for high dimensional breast cancer data, currently available simulator-based QML models can learn meaningful patterns with limited quantum resources, but are not as effective as powerful classical machine learning models when complete feature representations are available. The study does not report any sort of quantum advantage or clinical use, but rather a benchmark of current QML architectures that has been rigorously calculated and repeated, with a focus on the impact of dimensionality reduction, validation approaches, and simulator limitations, as well as outlining challenges that need to be overcome prior to practical implementation on real quantum hardware.
The rapid advancements in genomics and the availability of large-scale genetic datasets have revolutionized our understanding of genetic diseases. However, the complexity and high dimensionality of genomic data pose significant computational challenges for classical machine learning (ML) algorithms. Quantum machine learning (QML), an emerging interdisciplinary field that combines quantum computing with ML techniques, offers a promising solution to address these challenges. This paper explores the application of QML algorithms for diagnosing genetic diseases by leveraging the unique properties of quantum computing, such as superposition, entanglement, and quantum parallelism. A novel hybrid quantum-classical approach is proposed to enhance the accuracy and efficiency of disease diagnosis using genomic datasets. The methodology involves encoding genetic data into quantum states, applying quantum-enhanced feature selection and classification algorithms, and validating the results on publicly available datasets, such as the UK Biobank and the Cancer Genome Atlas (TCGA). Experimental results demonstrate that the proposed QML framework achieves higher classification accuracy and faster computation times compared to classical counterparts. Equations, tables, and charts are used to illustrate the effectiveness of the approach. This research highlights the transformative potential of QML in precision medicine and lays the groundwork for future investigations into quantum-enabled healthcare solutions.
Biomarker classification represents a significant task in biological, medical diagnostics, and bioinformatics, where high-dimensional datasets represent challenges to classical machine learning models. The study presented in this paper focuses on the impact of data encoding and explores quantum machine learning algorithms for biomarker classification. Three quantum embedding methods; Angle Embedding, Amplitude Embedding, and IQP (Instantaneous Quantum Polynomial) Embedding, were combined with Quantum Support Vector Machines (QSVM) and Quantum k-Nearest Neighbors (QkNN) and compared against classical SVM and KNN baselines. Principal Component Analysis (PCA) was applied as a preprocessing step to reduce dimensionality. Experiments were conducted on the CuMiDa breast cancer dataset using quantum simulators. Results show that IQP embedding and Angle embedding significantly outperform classical models with QSVM, achieving the best performance, where IQP embedding reaching 93.1% accuracy and an F1-score of 0.93 in higher-dimensional settings, outperforming both the other quantum embeddings and the classical SVM. For QkNN, performance depended on dimensionality, with IQP achieving the strongest results in lower dimensions, including a precision of 87.1%, surpassing both the other quantum embeddings and classical KNN. In higher dimensions, Angle embedding yielded the best quantum results, though classical KNN remained superior. Amplitude embedding consistently underperformed in QSVM but was more competitive in QkNN. These findings demonstrate that advanced quantum data encoding, such as IQP and Angle, can enhance biomarker classification performance and highlight the promise of hybrid quantum-classical approaches in biomedical applications.
Abstract This study presents a comparison between classical machine learning (ML) algorithms and their quantum-enhanced counterparts in classifying scikit’s breast cancer dataset. Specifically, the research focused on evaluating the accuracy and time computational efficiency of quantum-enhanced machine learning (QEML) algorithms against traditional or classical machine learning algorithms. The quantum algorithms employed include the quantum support vector machine (qSVM), variational quantum classifier (VQC) and quantum k-nearest neighbor (qkNN). The qSVM and qkNN algorithms discussed here are really kernel-based hybrid classical-quantum algorithms as opposed to fully quantum algorithms and the VQC is a hybrid classical-quantum algorithm. These algorithms were tested against their classical equivalents: support vector machine (SVM), k-nearest neighbor (kNN), and artificial neural network (ANN). The qSVM algorithm demonstrated an 90% accuracy in distinguishing malignant from benign cancer cases (the classical support vector machine algorithm had a 99% accuracy), while qkNN achieved 90% accuracy (the classical kNN algorithm had an accuracy of 97%), and VQC reported 88.77± 0.26% (averaged over 5 runs) (this was compared with an ANN which had an accuracy of 96%). The accuracies of the classical SVM, kNN, and ANN algorithms were recorded, to provide a basis for comparison. The results indicated that while QEML algorithms perform reasonably well in classification tasks, however they do not consistently outperform classical algorithms. Additionally, the study measured the time efficiency of each algorithm. The ANN required 33.8 seconds, kNN required 0.21 seconds, and SVM required 1.98 seconds to perform the classification tasks. In contrast, the quantum algorithms were significantly slower, with the VQC taking 632.53 seconds, qkNN requiring 495.34 seconds, and qSVM requiring 538.05 seconds (This is not fixed per run but give an impression of the time scales to run the algorithms). We emphasize that this simulation runtime does not reflect actual quantum hardware performance, where gate execution and circuit depth constraints differ significantly. To mitigate this ambiguity, we distinguish between simulation runtime and estimated quantum runtime where relevant. This work potentially highlights the cases where it may not offer any advantage to use quantum machine learning algorithms. The Receiver Operating Characteristic (ROC) curve and the Area Under the Curve (AUC) analysis are also considered in this work where the values measured for the SVM, kNN and ANN were 99%, 99% and 99% respectively and for the qSVM, qkNN and VQC were 87%, 86% and 86± 0.2% (averaged over 5 runs) respectively. Overall, this research contributes valuable insights into the comparative performance of classical and quantum ML algorithms in a specific application, underscoring the potential and current limitations of quantum approaches in machine learning tasks. Hyperparameter optimization was done for all the algorithms, both quantum and classical, with Optuna. This was primarily because the QEML algorithms had more parameters and required considerable computational resources to optimize. This could have influenced the performance outcomes and is the basis for future work. The development of key comparison criteria is critical in the development of quantum machine learning, and this work offers some building blocks for this.
This study introduces a Hybrid Quantum K-Means Clustering Algorithm with automatic cluster detection for classifying cancerous and non-cancerous gene expression data. The method employs Quantum Multi-Feature Mapping for state encoding, Swap Test-based quantum distance estimation, and Quantum Gradient-Based Optimization to dynamically identify the optimal number of clusters by minimizing intra-cluster variance. Initial centroids are selected through a probability-proportional distance strategy, improving stability and accuracy. Applied to breast cancer datasets, the approach surpasses the existing quantum K-Means algorithm, achieving a Silhouette Score of 0.641 (compared to 0.601), a Calinski-Harabasz Index of 766.57 (compared to 617.65), and a Davies-Bouldin Index of 0.659 (compared to 0.704). These results indicate superior cluster compactness and separation. Although the proposed algorithm exhibits slightly higher time complexity O (N×Kmax×Mobs) due to iterative optimization, it significantly outperforms predefined-K quantum K-Means in clustering accuracy, error reduction, and practical feasibility. Its efficiency in handling high-dimensional data and resilience to quantum noise highlights its potential for real-world bioinformatics applications, particularly in cancer classification using gene expression profiles.
Breast cancer is rated as one of the top leading diagnosed and deadliest cancers affecting women worldwide and causing high mortality rate among cancers. With the data-driven applications, hybrid quantum-classical machine learning models have evolved as significant alternatives for handling complex feature spaces with the growing interest in quantum computing. This paper presents a systematic comparative study of classical and quantum machine learning approaches for breast cancer classification using the Wisconsin Breast Cancer Dataset. In this architecture we have preprocessed classical feature vectors using standard normalized techniques and parallelly quantum states are mapped through data embedding techniques which relies on parameterized rotational gates. In this work we have implemented all quantum models using the Pennylane library, resulting in hybrid quantum–classical optimization on near-term quantum simulators. The comparison results in multiple classical and quantum models. In classical we have Support Vector Machine (SVM), K-Nearest Neighbors (KNN) and Convolutional Neural Networks (CNN), which are compared with the quantum-based models such as the Variational Quantum Classifier (VQC), Quantum Support Vector Machine (QSVM) and Quantum Convolutional Neural Network (QCNN). In QSVM, we have performed dimensionality reduction using Principal Component Analysis (PCA) before to quantum embedding, and quantum-generated features are used to train a classical linear SVM. The evaluation metrics results in accuracy, precision, recall, F1-score, ROC curves and confusion matrices. The classical models achieves the accuracy in the range of 94%-96%, whereas competitive performance of quantum models demonstrate depending on the embedding strategy and circuit configuration. In the implemented quantum models, the variational quantum classifier achieved the highest classification accuracy of 96.06%, surpassing other evaluated models. These results demonstrate quantum embedding combined with variational quantum circuits can effectively capture discriminative patterns in medical datasets, indicating the implementation of quantum machine learning models for breast cancer diagnosis with the present quantum simulating platforms.