2009 First International Conference on Networked Digital Technologies 2009
DOI: 10.1109/ndt.2009.5272212
|View full text |Cite
|
Sign up to set email alerts
|

Evolving cellular automata by parallel quantum genetic algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
19
0

Year Published

2013
2013
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(19 citation statements)
references
References 10 publications
0
19
0
Order By: Relevance
“…The QGA is distinguished by its simultaneous capacity for quick convergence and global search. Quantum computing concepts and principles like qubits and a linear superposition of states form the basis of the QGA [ 22 , 23 ]. One way to express the status of a qubit is as follows: The probabilities of the qubit being in the ‘0’ and ‘1’ states are specified by the expressions and , respectively, where and are complex numbers describing the probability amplitudes of the two states.…”
Section: Preliminariesmentioning
confidence: 99%
“…The QGA is distinguished by its simultaneous capacity for quick convergence and global search. Quantum computing concepts and principles like qubits and a linear superposition of states form the basis of the QGA [ 22 , 23 ]. One way to express the status of a qubit is as follows: The probabilities of the qubit being in the ‘0’ and ‘1’ states are specified by the expressions and , respectively, where and are complex numbers describing the probability amplitudes of the two states.…”
Section: Preliminariesmentioning
confidence: 99%
“…The essence of the algorithm lies in quantum evolution and the group search method, so it has powerful global search ability and high operational efficiency. Compared with the traditional GA, QGA is superior, but QGA still has shortcomings such as more iterations when optimizing complex functions and falling into local extremes [34,35].…”
Section: Principle Of Quantum Genetic Algorithmmentioning
confidence: 99%
“…For example, QGA was used to solve the knapsack problem in search optimization [13]. It is also used to solve the binary decision diagram ordering problem [14] and density classification problem [15].…”
Section: Quantum Genetic Algorithmmentioning
confidence: 99%