2008
DOI: 10.1109/tevc.2007.905006
|View full text |Cite
|
Sign up to set email alerts
|

Quantum Genetic Optimization

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 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. While the quantum and classical genetic algorithms use the same number of generations, the QGOA outperforms the classical one in identifying the hig… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
74
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 114 publications
(83 citation statements)
references
References 16 publications
0
74
0
Order By: Relevance
“…In 2008 [63], a similar idea is also applied to other version of a true quantum evolutionary algorithm which was termed as Quantum Genetic Optimization Algorithm (QGOA).…”
Section: Towards True Quantum Evolutionary Algorithmsmentioning
confidence: 99%
See 1 more Smart Citation
“…In 2008 [63], a similar idea is also applied to other version of a true quantum evolutionary algorithm which was termed as Quantum Genetic Optimization Algorithm (QGOA).…”
Section: Towards True Quantum Evolutionary Algorithmsmentioning
confidence: 99%
“…In 2008 [63], a similar idea is also applied to other version of a true quantum evolutionary algorithm which was termed as Quantum Genetic Optimization Algorithm (QGOA). In a second step the algorithm searches for the maximum fitness: In a second step the algorithm searches for the maximum fitness:…”
Section: Towards True Quantum Evolutionary Algorithmsmentioning
confidence: 99%
“…Udrescu et al propose RQGA [62], which provides a mechanism to overcome this problem. Hybrid versions [63] merge QGA with permutation-based GA and [64] merge QGA with real-valued GA. Malossini and Calarco propose QGOA [65] very similar to QGA with special quantum-based selection and fitness evaluation methods.…”
Section: Quantum-mechanics-based Algorithmsmentioning
confidence: 99%
“…Attempts to bring quantum computing power to a greater range of problems are the development of quantum machine-learning algorithms as decision trees [6], evolutionary algorithms [7] and artificial neural networks [8,9,10,11,12,13,14,15,16]. In this paper, we are concerned in the field of quantum weightless neural networks.…”
Section: Introductionmentioning
confidence: 99%