An Efficient Binary Harris Hawks Optimization based on Quantum SVM for Cancer Classification Tasks

• URL: http://arxiv.org/abs/2202.11899v1
• Date: Thu, 24 Feb 2022 04:51:05 GMT
• Title: An Efficient Binary Harris Hawks Optimization based on Quantum SVM for Cancer Classification Tasks
• Abstract summary: This work introduces a new hybrid quantum kernel support vector machine (QKSVM) combined with a Binary Harris hawk optimization (BHHO) based gene selection for cancer classification on a quantum simulator. The proposed approach is applied to colon and breast microarray datasets and evaluated with all genes and the selected genes by BHHO.
• Score: 27.169643615242652
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Cancer classification based on gene expression increases early diagnosis and recovery, but high-dimensional genes with a small number of samples are a major challenge. This work introduces a new hybrid quantum kernel support vector machine (QKSVM) combined with a Binary Harris hawk optimization (BHHO) based gene selection for cancer classification on a quantum simulator. This study aims to improve the microarray cancer prediction performance with the quantum kernel estimation based on the informative genes by BHHO. The feature selection is a critical step in large-dimensional features, and BHHO is used to select important features. The BHHO mimics the behavior of the cooperative action of Harris hawks in nature. The principal component analysis (PCA) is applied to reduce the selected genes to match the qubit numbers. After which, the quantum computer is used to estimate the kernel with the training data of the reduced genes and generate the quantum kernel matrix. Moreover, the classical computer is used to draw the support vectors based on the quantum kernel matrix. Also, the prediction stage is performed with the classical device. Finally, the proposed approach is applied to colon and breast microarray datasets and evaluated with all genes and the selected genes by BHHO. The proposed approach is found to enhance the overall performance with two datasets. Also, the proposed approach is evaluated with different quantum feature maps (kernels) and classical kernel (RBF).

Related papers

• Quantum Kernel Estimation for the Discovery of Early Lung Cancer Detection [0.36944296923226316]
  We evaluate quantum-classical hybrid machine learning for lung cancer detection using DNA fragmentomics and DNA methylation.<n>For fragmentomics, several 20-feature configurations improved AUC relative to a classical SVM baseline.<n>For methylation, the classical SVM achieved the highest AUC, although selected quantum models remained competitive and improved specificity in some cases.
  arXiv  Detail & Related papers  (2026-08-19T17:57:25Z)
• Balancing Expressivity and Learnability in Quantum Kernel Bandit Optimization [50.880384999888044]
  We develop misspecified GP bandit algorithms and derive regret bounds that characterize the trade-off between approximation error and information gain.<n>Our methods outperform full quantum kernels in sample efficiency, while substantially reducing computational overhead.
  arXiv  Detail & Related papers  (2026-07-01T15:38:00Z)
• Fermi-Dirac machines as quantizations of neurons [51.809748057605184]
  We reinterpret Fermi-Dirac machines as canonical quantizations of classical neurons.<n>We develop efficient hybrid quantum-classical algorithms for evaluating outputs and gradients of our quantized neurons.<n> Numerical experiments indicate that neurons based on quantum Hamiltonians can learn functions that classical neurons cannot.
  arXiv  Detail & Related papers  (2026-05-23T04:09:03Z)
• Accelerating De Novo Genome Assembly via Quantum-Assisted Graph Optimization with Bitstring Recovery [0.0]
  Genome sequencing is essential to decode genetic information, identify organisms, understand diseases and advance personalized medicine.<n>De novo genome assembly presents significant challenges due to its high computational complexity, affecting both time and accuracy.<n>We propose a hybrid approach utilizing a quantum computing-based optimization algorithm integrated with classical pre-processing to expedite the genome assembly process.
  arXiv  Detail & Related papers  (2026-01-29T19:03:55Z)
• Quantum Network-Based Prediction of Cancer Driver Genes [0.0]
  We introduce a supervised quantum framework that combines mutation scores with network topology via a novel state preparation scheme.<n>QMME encodes low-order statistical moments over the mutation scores of a node's immediate and second-order neighbors, and encodes this information into quantum states.<n> Simulations on an empirical PPI network demonstrate competitive performance, with a 12.6% recall gain over a classical baseline.
  arXiv  Detail & Related papers  (2025-10-14T15:25:30Z)
• Quantum Approximate Optimization Algorithm for MIMO with Quantized b-bit Beamforming [47.98440449939344]
  Multiple-input multiple-output (MIMO) is critical for 6G communication, offering improved spectral efficiency and reliability.<n>This paper explores the use of the Quantum Approximate Optimization Algorithm (QAOA) and alternating optimization to address the problem of b-bit quantized phase shifters both at the transmitter and the receiver.<n>We demonstrate that the structure of this quantized beamforming problem aligns naturally with hybrid-classical methods like QAOA, as the phase shifts used in beamforming can be directly mapped to rotation gates in a quantum circuit.
  arXiv  Detail & Related papers  (2025-10-07T17:53:02Z)
• Q2SAR: A Quantum Multiple Kernel Learning Approach for Drug Discovery [39.58317527488534]
  This research demonstrates the successful application of a Quantum Multiple Kernel Learning framework to enhance QSAR classification.<n>We apply this methodology to a dataset for identifying DYRK1A kinase inhibitors.<n>By benchmarking the QMKL-SVM against a classical Gradient Boosting model, we show that the quantum-enhanced approach achieves a superior AUC score.
  arXiv  Detail & Related papers  (2025-06-17T19:00:47Z)
• Optimal normalization in quantum-classical hybrid models for anti-cancer drug response prediction [0.0]
  Quantum-classical Hybrid Machine Learning (QHML) models are recognized for their robust performance and high generalization ability.<n>We propose a novel strategy that uses a normalization function based on a moderated version of the $tanh$.<n>Our idea was evaluated on a dataset of gene expression and drug response measurements for various cancer cell lines.
  arXiv  Detail & Related papers  (2025-05-15T07:33:41Z)
• Can a Quantum Support Vector Machine algorithm be utilized to identify Key Biomarkers from Multi-Omics data of COVID19 patients? [0.856161839022552]
  We evaluate the applicability of the Quantum Support Vector Machine algorithm for biomarker-based classification of COVID-19. Proteomic and metabolomic biomarkers were ranked by importance using ridge regression and grouped accordingly.
  arXiv  Detail & Related papers  (2025-04-29T16:35:38Z)
• Comparative Analysis of Quantum Support Vector Machines and Variational Quantum Classifiers for B-cell Epitope Prediction in Vaccine Design [0.0]
  This study investigates two quantum machine learning models-the Quantum Support Vector Machine (QSVM) and the Variational Quantum (VQC)-in the context of B-cell prediction.
  arXiv  Detail & Related papers  (2025-04-14T10:19:33Z)
• Evaluating the Impact of Different Quantum Kernels on the Classification Performance of Support Vector Machine Algorithm: A Medical Dataset Application [0.0]
  This study examines the impact of feature mapping techniques on medical data classification outcomes using the QSVM- Kernel algorithm. It shows that the best classification performances were achieved both in terms of classification performance and total execution time. The contributions of this study are that it highlights the significant impact of feature mapping techniques on medical data classification outcomes.
  arXiv  Detail & Related papers  (2024-07-13T15:53:37Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Neutron-nucleus dynamics simulations for quantum computers [49.369935809497214]
  We develop a novel quantum algorithm for neutron-nucleus simulations with general potentials. It provides acceptable bound-state energies even in the presence of noise, through the noise-resilient training method. We introduce a new commutativity scheme called distance-grouped commutativity (DGC) and compare its performance with the well-known qubit-commutativity scheme.
  arXiv  Detail & Related papers  (2024-02-22T16:33:48Z)
• An Efficient High-Dimensional Gene Selection Approach based on Binary Horse Herd Optimization Algorithm for Biological Data Classification [1.1510009152620668]
  The Horse Herd Optimization Algorithm (HOA) is a new meta-heuristic algorithm based on the behaviors of horses at different ages. This paper proposes a binary version of the HOA in order to solve discrete problems and select prominent feature subsets. The proposed hybrid method (MRMR-BHOA) demonstrates superior performance in terms of accuracy and minimum selected features.
  arXiv  Detail & Related papers  (2023-08-18T19:40:59Z)
• Photonic Quantum Computing For Polymer Classification [62.997667081978825]
  Two polymer classes visual (VIS) and near-infrared (NIR) are defined based on the size of the polymer gaps. We present a hybrid classical-quantum approach to the binary classification of polymer structures.
  arXiv  Detail & Related papers  (2022-11-22T11:59:52Z)
• Quantum vs classical genetic algorithms: A numerical comparison shows faster convergence [0.0]
  We show that some quantum variants outperform all classical ones in convergence speed towards a near-to-optimal result. If this advantage holds for larger systems, quantum genetic algorithms would provide a new tool to address optimization problems with quantum computers.
  arXiv  Detail & Related papers  (2022-07-19T13:07:44Z)
• Quantum-Enhanced Selection Operators for Evolutionary Algorithms [0.0]
  We study results obtained from using quantum-enhanced operators within the selection mechanism of a genetic algorithm. We benchmark these quantum-enhanced algorithms against classical algorithms.
  arXiv  Detail & Related papers  (2022-06-21T21:36:39Z)
• Quantum Genetic Algorithm with Individuals in Multiple Registers [0.0]
  We propose a subroutine-based quantum genetic algorithm with individuals codified in independent registers. This distinctive codification allows our proposal to depict all the fundamental elements characterizing genetic algorithms. We study two paradigmatic examples, namely, the biomimetic cloning of quantum observables and the Buv zek-Hillery universal quantum cloning machine.
  arXiv  Detail & Related papers  (2022-03-28T19:05:03Z)
• Lung Cancer Lesion Detection in Histopathology Images Using Graph-Based Sparse PCA Network [93.22587316229954]
  We propose a graph-based sparse principal component analysis (GS-PCA) network, for automated detection of cancerous lesions on histological lung slides stained by hematoxylin and eosin (H&E) We evaluate the performance of the proposed algorithm on H&E slides obtained from an SVM K-rasG12D lung cancer mouse model using precision/recall rates, F-score, Tanimoto coefficient, and area under the curve (AUC) of the receiver operator characteristic (ROC)
  arXiv  Detail & Related papers  (2021-10-27T19:28:36Z)
• Hybrid Random Features [60.116392415715275]
  We propose a new class of random feature methods for linearizing softmax and Gaussian kernels called hybrid random features (HRFs) HRFs automatically adapt the quality of kernel estimation to provide most accurate approximation in the defined regions of interest.
  arXiv  Detail & Related papers  (2021-10-08T20:22:59Z)
• Quantum Approximate Optimization Algorithm Based Maximum Likelihood Detection [80.28858481461418]
  Recent advances in quantum technologies pave the way for noisy intermediate-scale quantum (NISQ) devices. Recent advances in quantum technologies pave the way for noisy intermediate-scale quantum (NISQ) devices.
  arXiv  Detail & Related papers  (2021-07-11T10:56:24Z)
• Preparation of excited states for nuclear dynamics on a quantum computer [117.44028458220427]
  We study two different methods to prepare excited states on a quantum computer. We benchmark these techniques on emulated and real quantum devices. These findings show that quantum techniques designed to achieve good scaling on fault tolerant devices might also provide practical benefits on devices with limited connectivity and gate fidelity.
  arXiv  Detail & Related papers  (2020-09-28T17:21:25Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.