Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Journal of Advancements in Computing Technology

Parameters and Optimization in Multi-Universe Quantum Genetic Algorithm

Sun Xiang-hua

Published Oct 15, 2012• 0 citations
Publisher
DOI
10.4156/ijact.vol4.issue18.34

Related papers

Hybrid genetic algorithm based on quantum computing for numerical optimization and parameter estimation

Ling Wang, Fang Tang, Hao Wu

Applied Mathematics and Computation•Mar 31, 2005•104 citations

Quantum Gate Optimization in a Meta-Level Genetic Quantum Algorithm

A.-R. Khorsand, Mohammad-R. Akbarzadeh-T

Genetic quantum algorithms (GQA) are population based evolutionary algorithms that imitate quantum physics by introducing quantum bits for a basic probabilistic genotypic representation and hence better population diversity, and quantum gates for evolving the population of solutions. While quantum inspired gates play an important role in the evolutionary process, there is no specific method for their design, i.e. they are mostly developed through ad hoc procedures. Here, we propose a multi-objective meta-level GQA in order to determine parameters of QG which is applicable for a wide variety of optimization problems. Specifically, a two-layer GQA is constructed, in which the lower layer's objective is to optimize the four junction types: Dejong, Peak, Easoms, and Griewank. And the higher layer's objective is to determine optimal parameters for QG that helps the proposed algorithm find best solutions. GQA optimization performance, with optimized parameter of QG is compared with GA on several benchmark problems and the superiority of the proposed method is statistically shown.

Conference proceedings/Conference proceedings - IEEE International Conference on Systems, Man, and Cybernetics•Jan 18, 2006•39 citations

Novel Quantum Genetic Algorithm and Its Applications

Gexiang Zhang, Na Li, Weidong Jin +1 more

Frontiers of Electrical and Electronic Engineering in China•Jan 1, 2006•67 citations

Improvement of quantum genetic algorithm and its application

Zhou Chuan-hua, Feng Qian

Journal of Computer Applications•Feb 20, 2008•8 citations

Multi-Universe Parallel Quantum Genetic Algorithm

Shi Liang

This paper first proposes a novel Multi-Universe Parallel Quantum Genetic Algorithm (MPQGA) and proves its global convergence in theory.In the algorithm,all individuals are divided into some independent sub-colonies,called universes,according to their definite topological structure.Individuals in a universe are represented by multi-state gene qubits.In the individual's updating,the general quantum rotation gate strategy and dynamic adjusting rotation angle mechanism are applied to accelerate convergence.Quantum NOT gate is used to realize quantum mutation to avoid premature convergence.Each universe evolving independently enlarges the search space.Information among the universes is exchanged by adopting the best emigration and the quantum crossover operation for the improvement of search efficiency.Then it puts forward a new Blind Source Separation (BSS) method based on the combination of MPQGA and Independent Component Analysis (ICA).The simulation results show that the efficiency of the new BSS method is obviously higher than that of the Conventional Genetic Algorithm (CGA) and the Quantum Genetic Algorithm (QGA).

Dianzi xuebao•Jan 1, 2004•5 citations

A quantum genetic algorithm with application to cosmological parameters estimation

Giuseppe Sarracino, V. F. Cardone, R. Scaramella +14 more

An Amplitude-Encoded Quantum Genetic Algorithm (AEQGA) has been developed to minimize χ 2 functions of different cosmological probes (Supernovae Type Ia, Baryon Acoustic Oscillations, Cosmic Microwave Background Radiation), to find the best-fit value for two cosmological parameters, namely the Hubble Constant and the density matter content of the Universe today. Our main aim is to pave the way to testing the adoption of quantum optimization in the inference of the cosmological parameters that describe the universe evolution. AEQGA computes the merit function classically, and then uses a quantum circuit to entangle the population and perform crossover and mutation operations. The results show consistency with the isocontours of the objective functions. We then tested the general behavior of AEQGA as a function of its hyperparameters and compared it with a second quantum genetic algorithm found in the literature as well as with classical algorithms, finding consistent results.

arXiv:2602.15459•Astronomy and Computing•Feb 17, 2026•3 citations
Genetic quantum algorithms (GQA) are population based evolutionary algorithms that imitate quantum physics by introducing quantum bits for a basic probabilistic genotypic representation and hence better population diversity, and quantum gates for evolving the population of solutions. While quantum inspired gates play an important role in the evolutionary process, there is no specific method for their design, i.e. they are mostly developed through ad hoc procedures. Here, we propose a multi-objective meta-level GQA in order to determine parameters of QG which is applicable for a wide variety of optimization problems. Specifically, a two-layer GQA is constructed, in which the lower layer's objective is to optimize the four junction types: Dejong, Peak, Easoms, and Griewank. And the higher layer's objective is to determine optimal parameters for QG that helps the proposed algorithm find best solutions. GQA optimization performance, with optimized parameter of QG is compared with GA on several benchmark problems and the superiority of the proposed method is statistically shown.
This paper first proposes a novel Multi-Universe Parallel Quantum Genetic Algorithm (MPQGA) and proves its global convergence in theory.In the algorithm,all individuals are divided into some independent sub-colonies,called universes,according to their definite topological structure.Individuals in a universe are represented by multi-state gene qubits.In the individual's updating,the general quantum rotation gate strategy and dynamic adjusting rotation angle mechanism are applied to accelerate convergence.Quantum NOT gate is used to realize quantum mutation to avoid premature convergence.Each universe evolving independently enlarges the search space.Information among the universes is exchanged by adopting the best emigration and the quantum crossover operation for the improvement of search efficiency.Then it puts forward a new Blind Source Separation (BSS) method based on the combination of MPQGA and Independent Component Analysis (ICA).The simulation results show that the efficiency of the new BSS method is obviously higher than that of the Conventional Genetic Algorithm (CGA) and the Quantum Genetic Algorithm (QGA).
An Amplitude-Encoded Quantum Genetic Algorithm (AEQGA) has been developed to minimize χ 2 functions of different cosmological probes (Supernovae Type Ia, Baryon Acoustic Oscillations, Cosmic Microwave Background Radiation), to find the best-fit value for two cosmological parameters, namely the Hubble Constant and the density matter content of the Universe today. Our main aim is to pave the way to testing the adoption of quantum optimization in the inference of the cosmological parameters that describe the universe evolution. AEQGA computes the merit function classically, and then uses a quantum circuit to entangle the population and perform crossover and mutation operations. The results show consistency with the isocontours of the objective functions. We then tested the general behavior of AEQGA as a function of its hyperparameters and compared it with a second quantum genetic algorithm found in the literature as well as with classical algorithms, finding consistent results.