It is possible to effectively study most of engineering optimization problems suitably rephrased in binary via Evolutionary Algorithms. Even so, the fitness function computation, typically dealing with antenna design, may be very time consuming. Therefore, it is very important to speed up the convergency and to improve the performances of these algorithms, and the introduction of quantum computing seems to open new perspectives, where new approaches have to be considered to exploit the specificity of these instruments. In this paper, a novel quantum version of the binary Genetic Algorithm, bGA, has been introduced, bGA-QCO, and tested on a benchmark function and on a thinned array design.
A Novel Quantum Binary Evolutionary Algorithm for em Applications: BGA-QCO
Gabriel Martinez;Niccolai A.;Zich E. L.;Zich Riccardo
2024-01-01
Abstract
It is possible to effectively study most of engineering optimization problems suitably rephrased in binary via Evolutionary Algorithms. Even so, the fitness function computation, typically dealing with antenna design, may be very time consuming. Therefore, it is very important to speed up the convergency and to improve the performances of these algorithms, and the introduction of quantum computing seems to open new perspectives, where new approaches have to be considered to exploit the specificity of these instruments. In this paper, a novel quantum version of the binary Genetic Algorithm, bGA, has been introduced, bGA-QCO, and tested on a benchmark function and on a thinned array design.File | Dimensione | Formato | |
---|---|---|---|
A_Novel_Quantum_Binary_Evolutionary_Algorithm_for_EM_Applications_bGA-QCO.pdf
Accesso riservato
Dimensione
360.11 kB
Formato
Adobe PDF
|
360.11 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.