.png){kind=icon}
Return
Quantum genetic optimization
.png){kind=icon}
OA
AI
DOI：10.1109/TEVC.2007.905006.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 O(N log N), where N 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 o(1) in terms of number of oracle calls in the selection procedure. Such theoretical results are confirmed by the simulations of the algorithm.
Keywords:
evolutionary computing and genetic algorithms
quantum computation
Journal
IF:
12
Papers:
1.9K
Citations:
2.4W
Organization
Cited Papers
Evidence for redundancy in cysteine biosynthesis in Rhizobium leguminosarum RL3841: analysis of a cysE gene encoding serine acetyltransferase The GenBank accession number for the sequence reported in this paper is AJ271648..png)
MicrobiologyOAAI
MicrobiologyIF0
OAAIShareSave
ShareSaveShareSaveShareSaveShareSaveShareSave
View more