Los puntos clave no están disponibles para este artículo en este momento.
A novel evolutionary computing method-quantum inspired genetic algorithms-is introduced, where concepts and principles of quantum mechanics are used to inform and inspire more efficient evolutionary computing methods. The basic terminology of quantum mechanics is introduced before a comparison is made between a classical genetic algorithm and a quantum inspired method for the travelling salesperson problem. It is informally shown that the quantum inspired genetic algorithm performs better than the classical counterpart for a small domain. The paper concludes with some speculative comments concerning the relationship between quantum inspired genetic algorithms and various complexity classes.
Narayanan et al. (Tue,) studied this question.