A quantum genetic algorithm with application to cosmological parameters estimation
Giuseppe Sarracino, V. F. Cardone, R. Scaramella, Giuseppe Riccio, Andrea A. Bulgarelli, C. Burigana, Luca Cappelli, S. Cavuoti, Farida Farsian, Irene Graziotti, Massimo Meneghetti, Giuseppe Murante, N. Parmiggiani, Alessandro Rizzo, Francesco Schillirò, V. Testa, T. Trombetti
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.
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.
We propose a gate-based Quantum Genetic Algorithm (QGA) for real-valued global optimization. In this model, individuals are represented by quantum circuits whose measurement outcomes are decoded into real-valued vectors through binary discretization. Evolutionary operators act directly on circuit structures, allowing mutation and crossover to explore the space of gate-based encodings. Both fixed-depth and variable-depth variants are introduced, enabling either uniform circuit complexity or adaptive structural evolution. Fitness is evaluated through quantum sampling, using the mean decoded output of measurement outcomes as the argument of the objective function. To isolate the impact of quantum resources, we compare gate sets with and without the Hadamard gate, showing that superposition consistently improves convergence and robustness across benchmark functions such as the Rastrigin function. Furthermore, we demonstrate that introducing pairwise inter-individual entanglement in the population accelerates early convergence, revealing that quantum correlations among individuals provide an additional optimization advantage. Together, these results show that both superposition and entanglement enhance the search dynamics of evolutionary quantum algorithms, establishing gate-based QGAs as a promising framework for quantum-enhanced global optimization.
This research explores the application of a Quantum-Inspired Genetic Algorithm (QIGA) to optimize complex systems, utilizing a numerical experiment with a focus on the objective function... The QIGA integrates quantum-inspired principles, including crossover, entanglement, and evolution, to strike a balance between exploration and exploitation within the solution space. A 100-generation experiment with a population size of 50 reveals the algorithm's adaptability and gradual convergence towards optimal solutions. The linear combination crossover, guided by quantum principles, enhances diversity, while entanglement and evolution operations introduce correlations between quantum states. The results underscore the algorithm's potential, prompting discussions on parameter tuning, comparisons with classical algorithms, and considerations for transitioning to real quantum hardware. The findings contribute to the understanding of quantum-inspired optimization and pave the way for further research in quantum computing applications for complex system optimization.
Genetic algorithms are highly effective optimization techniques for many computationally challenging problems, including combinatorial optimization tasks like portfolio optimization. Quantum computing has also shown potential in addressing these complex challenges. Combining these approaches, quantum genetic algorithms leverage the principles of superposition and entanglement to enhance the performance of classical genetic algorithms. In this work, we propose a novel quantum genetic algorithm introducing an innovative crossover strategy to generate quantum circuits from a binary solution. We incorporate a heuristic method to encode entanglement patterns from parent solutions into circuits for the next generation. Our algorithm advances quantum genetic algorithms by utilizing a limited number of entanglements, enabling efficient exploration of optimal solutions without significantly increasing circuit depth, making it suitable for near-term applications. We test this approach on a portfolio optimization problem using an IBM 127 qubits Eagle processor (ibm_quebec) and simulators. Compared to state-of-the-art algorithms, our results show that the proposed method improves fitness values by 33.6% over classical genetic algorithm and 37.2% over quantum-inspired genetic algorithm, using the same iteration counts and population sizes with real quantum hardware employing 100 qubits. These findings highlight the potential of current quantum computers to address real-world utility-scale combinatorial optimization problems.
Quantum algorithm (QA) with updating of quantum gates and catastrophe of population is compared with quantum genetic algorithm (QGA) by including crossover and mutation for quantum bits. Furthermore, a framework of hybrid quantum GA is proposed which combines the quantum based search and classic genetic search, and hybrid QGA with binary encoding (BQGA) and hybrid QGA with real encoding (RQGA) are presented. Numerical simulation on typical problems show that the performances of RQGA are the best among all testing algorithms and it is much robust on parameters and initial conditions.
In the literature, there are many Quantum Inspired Evolutionary Algorithms (QIEA) that proved good performance and results when applied to solving a myriad of problems. However, the real quantum representation increases precision for numerical optimisation problems and reduces the memory storage need, alternatively to the binary representation. On the other hand, evolutionary algorithms' performance mainly depends on the crossover and mutation operators, reaching equilibrium between the explorative and exploitative features of evolutionary algorithms. This paper proposes new quantum genetic operators for real quantum representation, instead of the 1/5 rule present in AEIQ-R, to improve the performance of the quantum genetic algorithm with real representation. Three crossover and two mutation operators are proposed and tested to optimise four functions with different dimensions. Friedman's test indicated a significant difference between the combinations, and that combination composed of quantum arithmetic crossover and quantum creep mutation have the best performance.
Large-scale optimization (LSO) problems—those with hundreds to thousands of decision variables—are prevalent in engineering design, logistics, telecommunications, and machine learning hyperparameter search. Classical evolutionary algorithms often struggle in this regime due to premature convergence and prohibitive search costs. This manuscript presents a Quantum-Inspired Genetic Algorithm (QIGA) that transfers three ideas from quantum computation into a purely classical algorithm: (i) Q-bit angle encoding that maintains a compact, uncertainty-aware distribution over decision values, (ii) rotation-gate adaptation that updates search probabilities toward promising regions while preserving exploration, and (iii) quantum observation that draws diverse candidate solutions from the encoded amplitudes at each generation. We further couple the core QIGA with (a) an island-model decomposition for ultra-high dimensionality, (b) surrogate-assisted local refinement for exploitation at low cost, and (c) a feasibility-aware penalty for constraints. We evaluate the approach on five canonical continuous benchmarks in 1,000 dimensions (Sphere, Rosenbrock, Rastrigin, Ackley, Griewank) under a fixed computational budget. Across 30 independent runs per function, QIGA achieves lower final objective values and higher success rates than classical GA, PSO, and DE baselines. A non-parametric Wilcoxon signed-rank test indicates statistically significant improvements for QIGA (adjusted p < 0.01) on all functions. We analyze the algorithm’s scaling behavior, the role of angle-space step control, and the contribution of island-level diversity. The results suggest that quantum-inspired probability evolution provides a robust inductive bias for LSO by decoupling representation capacity from point estimates and by enabling distribution-aware search moves. We conclude with practical guidelines for tuning and discuss extensions to constrained and mixed-variable problems.