Quantum-Inspired Evolutionary Algorithms for Feature Subset Selection: A Comprehensive Survey

• URL: http://arxiv.org/abs/2407.17946v1
• Date: Thu, 25 Jul 2024 11:07:19 GMT
• Title: Quantum-Inspired Evolutionary Algorithms for Feature Subset Selection: A Comprehensive Survey
• Abstract summary: Quantum-inspired evolutionary algorithms (QIEAs) employ quantum bits to adopt a probabilistic representation of the state of a feature in a given solution. We conducted a comprehensive survey across various publishers and gathered 56 papers.
• Score: 4.829719151294255
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: The clever hybridization of quantum computing concepts and evolutionary algorithms (EAs) resulted in a new field called quantum-inspired evolutionary algorithms (QIEAs). Unlike traditional EAs, QIEAs employ quantum bits to adopt a probabilistic representation of the state of a feature in a given solution. This unprecedented feature enables them to achieve better diversity and perform global search, effectively yielding a tradeoff between exploration and exploitation. We conducted a comprehensive survey across various publishers and gathered 56 papers. We thoroughly analyzed these publications, focusing on the novelty elements and types of heuristics employed by the extant quantum-inspired evolutionary algorithms (QIEAs) proposed to solve the feature subset selection (FSS) problem. Importantly, we provided a detailed analysis of the different types of objective functions and popular quantum gates, i.e., rotation gates, employed throughout the literature. Additionally, we suggested several open research problems to attract the attention of the researchers.

Related papers

• Recent Advances in Quantum Architecture Search [7.473388435484934]
  Variational quantum algorithms (VQAs) constitute a prominent framework for exploring the capabilities of near-term quantum computers.<n>Quantum Architecture Search (QAS) has emerged as a critical research area to automate the discovery of high-performing circuit structures.
  arXiv  Detail & Related papers  (2026-04-29T04:34:22Z)
• Quantum Agents for Algorithmic Discovery [0.42970700836450476]
  We introduce quantum agents trained by episodic, reward-based reinforcement learning to autonomously rediscover several seminal quantum algorithms and protocols.<n>In particular, our agents learn: efficient logarithmic-depth quantum circuits for the Quantum Fourier Transform; Grover's search algorithm; optimal cheating strategies for strong coin flipping.
  arXiv  Detail & Related papers  (2025-10-09T12:38:53Z)
• Artificial intelligence for representing and characterizing quantum systems [49.29080693498154]
  Efficient characterization of large-scale quantum systems is a central challenge in quantum science.<n>Recent advances in artificial intelligence (AI) have emerged as a powerful tool to address this challenge.<n>This review discusses how each of these AI paradigms contributes to two core tasks in quantum systems characterization.
  arXiv  Detail & Related papers  (2025-09-05T08:41:24Z)
• RhoDARTS: Differentiable Quantum Architecture Search with Density Matrix Simulations [48.670876200492415]
  Variational Quantum Algorithms (VQAs) are a promising approach for leveraging powerful Noisy Intermediate-Scale Quantum (NISQ) computers.<n>We propose $rho$DARTS, a differentiable Quantum Architecture Search (QAS) algorithm that models the search process as the evolution of a quantum mixed state.
  arXiv  Detail & Related papers  (2025-06-04T08:30:35Z)
• Evolving Hard Maximum Cut Instances for Quantum Approximate Optimization Algorithms [11.930061411630442]
  Variational quantum algorithms, such as the Recursive Quantum Approximate Optimization Algorithm (RQAOA), have become increasingly popular. In this study, we utilize an evolutionary algorithm equipped with a unique fitness function. This approach targets hard maximum cut instances within the latent space of a Graph Autoencoder.
  arXiv  Detail & Related papers  (2025-01-30T14:32:06Z)
• A quantum information theoretic analysis of reinforcement learning-assisted quantum architecture search [0.0]
  This study investigates RL-QAS for crafting ansatz tailored to variational quantum state diagonalisation problem. We leverage these insights to devise an entanglement-guided admissible ansatz in QAS to diagonalise random quantum states using optimal resources.
  arXiv  Detail & Related papers  (2024-04-09T09:54:59Z)
• 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)
• Quantum Complexity vs Classical Complexity: A Survey [2.4302813010040714]
  Adapting problem-solving strategies is crucial to harness the full potential of quantum computing. This paper concentrates on aggregating prior research efforts dedicated to solving intricate classical computational problems through quantum computing.
  arXiv  Detail & Related papers  (2023-12-16T16:02:21Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [90.05272647148196]
  The anticipated applications of quantum computers span across science and industry. We present a survey of several potential application areas of quantum algorithms. We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• A Review on Quantum Approximate Optimization Algorithm and its Variants [47.89542334125886]
  The Quantum Approximate Optimization Algorithm (QAOA) is a highly promising variational quantum algorithm that aims to solve intractable optimization problems. This comprehensive review offers an overview of the current state of QAOA, encompassing its performance analysis in diverse scenarios. We conduct a comparative study of selected QAOA extensions and variants, while exploring future prospects and directions for the algorithm.
  arXiv  Detail & Related papers  (2023-06-15T15:28:12Z)
• QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
  We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks. Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture. We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
  arXiv  Detail & Related papers  (2023-04-14T08:03:20Z)
• An introduction to variational quantum algorithms for combinatorial optimization problems [0.0]
  This tutorial provides a mathematical description of the class of Variational Quantum Algorithms. We introduce precisely the key aspects of these hybrid algorithms on the quantum side and the classical side. We devote a particular attention to QAOA, detailing the quantum circuits involved in that algorithm, as well as the properties satisfied by its possible guiding functions.
  arXiv  Detail & Related papers  (2022-12-22T14:27:52Z)
• ORQVIZ: Visualizing High-Dimensional Landscapes in Variational Quantum Algorithms [51.02972483763309]
  Variational Quantum Algorithms (VQAs) are promising candidates for finding practical applications of quantum computers. This work is accompanied by the release of the open-source Python package $textitorqviz$, which provides code to compute and flexibly plot 1D and 2D scans.
  arXiv  Detail & Related papers  (2021-11-08T18:17:59Z)
• Advantages and Bottlenecks of Quantum Machine Learning for Remote Sensing [63.69764116066747]
  This concept paper aims to provide a brief outline of quantum computers, explore existing methods of quantum image classification techniques, and discuss the bottlenecks of performing these algorithms on currently available open source platforms. Next steps include expanding the size of the quantum hidden layer and increasing the variety of output image options.
  arXiv  Detail & Related papers  (2021-01-26T09:31:46Z)
• Hybrid Quantum Computing -- Tabu Search Algorithm for Partitioning Problems: preliminary study on the Traveling Salesman Problem [0.8434687648198277]
  We introduce a novel solving scheme coined as hybrid Quantum Computing - Tabu Search Algorithm. Main pillars of operation of the proposed method are a greater control over the access to quantum resources, and a considerable reduction of non-profitable accesses.
  arXiv  Detail & Related papers  (2020-12-09T11:21:50Z)

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.