Quantum Genetic Optimization

Authors:
A. Malossini;E. Blanzieri;T. Calarco
Affiliations:
Univ. of Trento, Trento;-;-
Venue:
IEEE Transactions on Evolutionary Computation
Year:
2008

Citing 0
Cited 6

Neurofuzzy networks with nonlinear quantum learning

IEEE Transactions on Fuzzy Systems
Grids-based data parallel computing for learning optimization in a networked learning control systems

LSMS/ICSEE'10 Proceedings of the 2010 international conference on Life system modeling and and intelligent computing, and 2010 international conference on Intelligent computing for sustainable energy and environment: Part I
An adaptive knowledge evolution strategy for finding near-optimal solutions of specific problems

Expert Systems with Applications: An International Journal
Quantum-inspired evolutionary algorithms: a survey and empirical study

Journal of Heuristics
2013 Special Issue: Single-hidden-layer feed-forward quantum neural network based on Grover learning

Neural Networks
A quantum genetic algorithm with quantum crossover and mutation operations

Quantum Information Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

The complexity of the selection procedure of a genetic algorithm that requires reordering, if we restrict the class of the possible fitness functions to varying fitness functions, is , where is the size of the population. The quantum genetic optimization algorithm (QGOA) exploits the power of quantum computation in order to speed up genetic procedures. In QGOA, the classical fitness evaluation and selection procedures are replaced by a single quantum procedure. While the quantum and classical genetic algorithms use the same number of generations, the QGOA requires fewer operations to identify the high-fitness subpopulation at each generation. We show that the complexity of our QGOA is in terms of number of oracle calls in the selection procedure. Such theoretical results are confirmed by the simulations of the algorithm.