Related papers: The Conquest of Quantum Genetic Algorithms: The Adventure to Cross the Valley of Death

The Conquest of Quantum Genetic Algorithms: The Adventure to Cross the Valley of Death

URL: http://arxiv.org/abs/2401.08631v1
Date: Sun, 10 Dec 2023 17:30:29 GMT
Title: The Conquest of Quantum Genetic Algorithms: The Adventure to Cross the Valley of Death
Authors: Rafael Lahoz-Beltra
Abstract summary: We present a discussion of the difficulties arising when designing a quantum version of an evolutionary algorithm. The paper includes the code in both Python and QISKIT of the quantum version of one of these evolutionary algorithms.
Score: 0.0
License: http://creativecommons.org/licenses/by/4.0/
Abstract: In recent years, the emergence of the first quantum computers at a time when AI is undergoing a fruitful era has led many AI researchers to be tempted into adapting their algorithms to run on a quantum computer. However, in many cases the initial enthusiasm has ended in frustration, since the features and principles underlying quantum computing are very different from traditional computers. In this paper, we present a discussion of the difficulties arising when designing a quantum version of an evolutionary algorithm based on Darwin's evolutionary mechanism, the so-called genetic algorithms. The paper includes the code in both Python and QISKIT of the quantum version of one of these evolutionary algorithms allowing the reader to experience the setbacks arising when translating a classical algorithm to its quantum version. The algorithm studied in this paper, termed RQGA (Reduced Quantum Genetic Algorithm), has been chosen as an example that clearly shows these difficulties, which are common to other AI algorithms.

Related papers

Quantum annealer accelerates the variational quantum eigensolver in a triple-hybrid algorithm [0.0]
A novel triple-hybrid algorithm combines the effective use of a classical computer, a gate-based quantum computer, and a quantum annealer. The solution of a graph coloring problem found using a quantum annealer reduces the resources needed to accelerate VQE.
arXiv Detail & Related papers (2024-07-16T15:07:21Z)
Modified Multiple Sequence Alignment Algorithm on Quantum Annealers (MAQ) [0.0]
We propose a modified MSA algorithm on quantum annealers with applications in areas of bioinformatics and genetic sequencing. We apply progressive alignment techniques to modify algorithms, achieving a linear reduction in spin usage whilst introducing more quantum complexs to the algorithm.
arXiv Detail & Related papers (2024-03-24T01:57:38Z)
Scalable Quantum Algorithms for Noisy Quantum Computers [0.0]
This thesis develops two main techniques to reduce the quantum computational resource requirements. The aim is to scale up application sizes on current quantum processors. While the main focus of application for our algorithms is the simulation of quantum systems, the developed subroutines can further be utilized in the fields of optimization or machine learning.
arXiv Detail & Related papers (2024-03-01T19:36:35Z)
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 Annealing for Single Image Super-Resolution [86.69338893753886]
We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
arXiv Detail & Related papers (2023-04-18T11:57:15Z)
Quantum Clustering with k-Means: a Hybrid Approach [117.4705494502186]
We design, implement, and evaluate three hybrid quantum k-Means algorithms. We exploit quantum phenomena to speed up the computation of distances. We show that our hybrid quantum k-Means algorithms can be more efficient than the classical version.
arXiv Detail & Related papers (2022-12-13T16:04:16Z)
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)
Entanglement and coherence in Bernstein-Vazirani algorithm [58.720142291102135]
Bernstein-Vazirani algorithm allows one to determine a bit string encoded into an oracle. We analyze in detail the quantum resources in the Bernstein-Vazirani algorithm. We show that in the absence of entanglement, the performance of the algorithm is directly related to the amount of quantum coherence in the initial state.
arXiv Detail & Related papers (2022-05-26T20:32:36Z)
Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
arXiv Detail & Related papers (2020-09-02T22:46:47Z)
An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
arXiv Detail & Related papers (2020-05-06T14:18:44Z)

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