Canonical quantum algorithms often achieve low execution fidelities on current Noisy Intermediate-Scale Quantum (NISQ) hardware. The standard implementation of Grover's search algorithm, designed for theoretical generality, produces deep, gate-heavy circuits that are susceptible to noise. This paper challenges the "one-size-fits-all" design paradigm by using Grammatical Evolution (GE) to automatically discover hardware-efficient, state-specific quantum circuits. We demonstrate this approach by evolving bespoke circuits for all eight 3-qubit computational basis states and executing them on a 133-qubit IBM Heron quantum processor. To our knowledge, this is the first hardware-validated application of GE for this task. The results indicate significant performance gains: evolved circuits achieve hardware-executed fidelities up to 96.9% (vs. 66.3% baseline) while reducing circuit depth by 82.5–96.6% and gate count by 77.4–94.6% compared to canonical implementations. These findings suggest that automated symbolic search is a viable approach to designing algorithms that can execute on today's NISQ devices.

In this research, we address bearing fault classification by evaluating three neural network models: 1D Convolutional Neural Network (1D-CNN), CNN-Visual Geometry Group (CNN-VGG), and Long Short-Term Memory (LSTM). Utilizing vibration data, our approach incorporates data augmentation to address the limited availability of fault class data. A significant aspect of our methodology is the application of neural architecture search (NAS), which automates the evolution of network architectures, including hyperparameter tuning, significantly enhancing model training. Our use of early stopping strategies effectively prevents overfitting, ensuring robust model generalization. The results highlight the potential of integrating advanced machine learning models with NAS in bearing fault classification and suggest possibilities for further improvements, particularly in model differentiation for specific fault classes.

Bloat, a well-known phenomenon in Evolutionary Computation, often slows down evolution and complicates the task of interpreting the results. We propose Lexi2, a new selection and bloat-control method, which extends the popular lexicase selection method, by including a tie-breaking step which considers attributes related to the size of the individuals. This new step applies lexicographic parsimony pressure during the selection process and is able to reduce the number of random choices performed by lexicase selection (which happen when more than a single individual correctly solve the selected training cases).

Deep learning is a well suited approach to successfully address image processing and there are several Neural Networks architectures proposed on this research field, one interesting example is the U-net architecture and and its variants. This work proposes to automatically find the best architecture combination from a set of the current most relevant U-net architectures by using a genetic algorithm (GA) applied to solve the Retinal Blood Vessel Segmentation (RVS), which it is relevant to diagnose and cure blindness in diabetes patients. Interestingly, the experimental results show that avoiding human-bias in the design, GA finds novel combinations of U-net architectures, which at first sight seems to be complex but it turns out to be smaller, reaching competitive performance than the manually designed architectures and reducing considerably the computational effort to evolve them.

The advent of the Covid-19 pandemic has resulted in a global crisis making the health systems vulnerable, challenging the research community to find novel approaches to facilitate early detection of infections. This open-up a window of opportunity to exploit machine learning and artificial intelligence techniques to address some of the issues related to this disease. In this work, we address the classification of ten SARS-CoV-2 protein sequences related to Covid-19 using k-mer frequency as features and considering two objectives; classification performance and feature selection. The first set of experiments considered the objectives one at the time, four techniques were used for the feature selection and twelve well known machine learning methods, where three are neural network based for the classification. The second set of experiments considered a multi-objective approach where we tested a well known multi-objective approach Non-dominated Sorting Genetic Algorithm II (NSGA-II), and the Multi-dimensional Archive of Phenotypic Elites (MAP-Elites), which considers quality+diversity containers to guide the search through elite solutions. The experimental results shows that ResNet and PCA is the best combination using single objectives. Whereas, for the mulit-classification, NSGA-II outperforms ME with two out of three classifiers, while ME gets competitive results bringing more diverse set of solutions.

Genetic programming techniques allow flexibility in the optimization process, making it possible to use them in different areas of knowledge and providing new ways for specialists to advance in their areas more quickly and more accurately. This work presents a preliminary analysis of a new method using multi-gene genetic programming to multimodal numerical optimization. The new algorithm uses some niching techniques based on the clear procedure to maintain the population diversity, in order to perform a multivariate mapping among initial guesses to optimal parameters for a system. We used a multi-modal benchmark set with different characteristics and difficulty levels to evaluate this new algorithm. Statistical analysis suggested that this new multi-modal method using multi-gene genetic programming can be used for problems that requires more than a single solution.

This paper investigates the potential of evolutionary algorithms, developed by the combination of genetic programming (GP) and automatic differentiation methods (AD), in determining analytic solutions to ordinary and partial differential equations (ODE and PDE). In turn, AD is a set of techniques based on the mechanical application of the chain rule to numerically evaluate the derivative of a function specified by a computer program. The AD method has a fundamental role in this work since it calculates the exact values of the derivatives of a function for a given set of input values while numerical differentiation methods introduce unacceptable round-off errors in the discretization process. With this purpose, and using the Matlab programming environment, we developed several algorithms (namely GPAD) and addressed problems of different kinds of differential equations. The results are promising, with exact solutions obtained for most of the addressed problems, which include equations where not even commercial systems could find a symbolic solution. These results empirically indicate that GPAD can be an efficient and robust methodology to find analytic solutions for ODE and PDE.

Recently, it has been shown that complementarity models are an attracting tool for representing power converters in both open- and closed-loop configuration. A unique dynamical complementarity model captures all the modes of a power converter, without assuming the a priori knowledge of the sequence of modes or of the switching time instants. In this paper, we derive the complementarity model of a single-phase active filter with cascaded multilevel inverter. A combination of the unipolar and the phase-disposition PWM techniques is used with the goal of regulating the dc-link voltage. As benchmark for comparison, the time evolution of inductors currents and capacitors voltages computed with the complementarity procedure is compared with the ones obtained with PSIM software.

One of the most important issues in oil \& gas industry is the lithological identification. Lithology is the macroscopic description of the physical characteristics of a rock. This work proposes a new methodology for lithological discrimination, using GPF-CLASS model (Genetic Programming for Fuzzy Classification) a Genetic Fuzzy System based on Multi-Gene Genetic Programming. The main advantage of our approach is the possibility to identify, through seismic patterns, the rock types in new regions without requiring opening wells. Thus, we seek for a reliable model that provides two flexibilities for the experts: evaluate the membership degree of a seismic pattern to the several rock types and the chance to analyze at linguistic level the model output. Therefore, the final tool must afford knowledge discovery and support to the decision maker. Also, we evaluate other 7 classification models (from statistics and computational intelligence), using a database from a well located in Brazilian coast. The results demonstrate the potentialities of GPF-CLASS model when comparing to other classifiers.

This work presents a Genetic Fuzzy Classification System (GFCS) called Genetic Programming Fuzzy Classification System (GPF-CLASS). This model differs from the traditional approach of GFCS, which uses the metaheuristic as a way to learn “if-then” fuzzy rules. This classical approach needs several changes and constraints on the use of genetic operators, evaluation and selection, which depends primarily on the metaheuristic used. Genetic Programming makes this implementation costly and explores few of its characteristics and potentialities. The GPF-CLASS model seeks for a greater integration with the metaheuristic: Multi-Gene Genetic Programming (MGGP), exploring its potential of terminals selection (input features) and functional form and at the same time aims to provide the user with a comprehension of the classification solution. Tests with 22 benchmarks datasets for classification have been performed and, as well as statistical analysis and comparisons with others Genetic Fuzzy Systems proposed in the literature.

The superior performance of quantum computers in some problems lies in the direct use of quantum mechanics phenomena. This ability has originated the quantum-inspired evolutionary algorithms (QIEAs), which are classical algorithms (for classical computers) that exploit quantum mechanics principles to improve their performance. Several proposed QIEAs are able to outperform their traditional counterparts when applied to different kinds of problems. Aiming to exploit this new paradigm on genetic programming (GP), this paper introduces a novel QIEA model (quantum-inspired linear GP—QuaLiGP), which evolves machine code programs. QuaLiGP is inspired on multi-level quantum systems, and its operation is based on quantum individuals, which represent a superposition of all programs (solutions) of the search space. The tests use symbolic regression and binary classification as knowledge management problems to assess the QuaLiGP performance and compare it with Automatic Induction of Machine Code by Genetic Programming model, which is currently the most efficient GP model to evolve machine code. Results show that QuaLiGP outperforms the reference GP system for all these problems, by achieving better solutions from a smaller number of evaluations and by using fewer parameters and operators. This paper concludes that the quantum-inspired paradigm can be a competitive approach to evolve programs efficiently, encouraging improvements and extensions of QuaLiGP.

Quantum-inspired evolutionary algorithms (QIEAs) exploit principles of quantum mechanics to improve the performance of classical evolutionary algorithms. This paper describes the latest version of a QIEA model (“Quantum-Inspired Linear Genetic Programming” - QILGP) to evolve machine code programs. QILGP is inspired on multilevel quantum systems and its operation is based on quantum individuals, which represent a superposition of all programs of search space (solutions). Symbolic regression problems and the current more efficient model to evolve machine code (AIMGP) are used in comparative tests, which aim to evaluate the performance impact of introducing demes (subpopulations) and a limited migration strategy in this version of QILGP. It outperforms AIMGP by obtaining better solutions with fewer parameters and operators. The performance improvement achieved by this latest version of QILGP encourages its ongoing and future enhancements. Thus, this paper concludes that the quantum inspiration paradigm can be a competitive approach to evolve programs more efficiently.

In this work we present the application of quantum inspired linear genetic programming (QILGP) to the growth of self-assembled quantum dots. Quantum inspired linear genetic programming is a novel model to evolve machine code programs exploiting quantum mechanics principles. Quantum dots are nanostructures that have been widely applied to optoelectronics devices. The method proposed here relies on an existing database of growth parameters with a resulting quantum dot characteristic to be able to later obtain the growth parameters needed to reach a specific value for such a quantum dot characteristic. The computational techniques were used to associate the growth input parameters with the mean height of the deposited quantum dots. Trends of the quantum dot mean height behavior as a function of growth parameters were correctly predicted, improving on the results obtained by artificial neural network and classical genetic programming.

The huge performance superiority of quantum computers for some specific problems lies in their direct use of quantum mechanical phenomena (e.g. superposition of states) to perform computations. This has motivated the creation of quantum-inspired evolutionary algorithms (QIEAs), which successfully use some quantum physics principles to improve the performance of evolutionary algorithms (EAs) for classical computers. This paper proposes a novel QIEA (Quantum-Inspired Linear Genetic Programming - QILGP) for automatic synthesis of machine code (MC) programs and aims to present a preliminary evaluation of applying the quantum-inspiration paradigm to evolve programs by using two symbolic regression problems. QILGP performance is compared to AIMGP model, since it is the most successful genetic programming technique to evolve MC. In the first problem, the hit ratio of QILGP (100%) is greater than the one of AIMGP (77%). In the second problem, QILGP seems to carry on a less greedy search than AIMGP. Since QILGP presents some satisfactory results, this paper shows that the quantum-inspiration paradigm can be a competitive approach to evolve programs more efficiently, which encourages further developments of that first and simplest QILGP model with multiple individuals.