Applications of Quantum Computation in the Evolution research fields

Understanding Quantum Algorithm uses with applied Natural Selection algorithm in order to enhance genetic investigations related with evolution research.

Jess F. Seijas
Software Architect Madrid, Spain

AbstractIn contrast with classic software algorithms, in which each state is unique, quantum algorithms allows to have superposed states simultaneously that at the measurement moment are collapsed to one real state. That allows new paths for genetic investigation, one of them the Evolution research, because all possible genetic variations can be processed at the same instant and use a Natural Selection implementation algorithm for the decoherence.

know the future rolls, because the mutations (rerolls) are random. Once we understand this simple situation based on a common game, we can extrapolate the problem for a bigger game: n dices. The total possible states at the table then will be 6^n, and the possibilities of the player each iteration are C(n,m). So, for example in a game of 50 dices, we will have 8,0828E38 possible states and 1,1259E15 possible chooses for the player. The DNA possible states and the Natural Selection possible choose are greater than that. II. PROBABILITY BOUND There is easy to fail thinking that this kind of iteration is not possible because of the Universal Probability Bound. According to the Dembskis estimate, this probability bound is 1E150. However, this doesnt apply to evolution neither to our scenario due to the existence not only of the randomness, but also the Natural Selection, and also because one third factor: the mutations has a probability of appearing that can be represented with a Gauss Bell, and that limit the number of random events of each iteration. This means also that in our algorithm design we have to take into account the probability of the number and scope of the mutations before applying them.

I. PLAYING WITH POKER DICES Imagine the poker dices game. A player can throw five dices, select several of them (0 to 5) and after that throw the non selected dices to achieve a poker hand. This action can be repeated several times. In this case the order or the dices is not important, but anyway this example can be extrapolated to understand evolution, so imagine that the dices are ordered in a row. The dices at the table represent the current DNA, the player acts as the Environment Natural Selection, choosing the dices that can be probably give more chances of winning, and the dices rerolled are the mutations. The total possible hands that can be achieved are 6^5, for a total of 7776. With 5 dices, this will be the total of different DNAs that we can achieve. At each iteration the human has a total of 32 possibilities: Reroll all dices (1) Dont reroll at all (1) Reroll 1 dice (5) Reroll 2 dices (10) Reroll 3 dices (10) Reroll 4 dices (5)

III. EVOLUTION ALGORITHM Once we understand the poker dices scenario we can extrapolate it to our quantum algorithm. In order to limit our research, we can choose an initial gene with n bases, at each iteration m bases are mutated in order of a probabilistic engine (remember that in quantum computing real randomness is achieved instead of the classic pseudo-randomness), at finally we can choose one of the bests candidates using a greedy algorithm that will represent the Natural Selection. This

The player use a logic for its decision, but this logic uses a greedy algorithm at brain level, so for the same dice state in the table, the player doesnt always choose the same dices to reroll, there is a question of possibilities. Also, the player doesnt

Natural Selection algorithm can be implemented due to different environment situations. Where can be used the quantum computing here? In a classic system, for each gene state we must build a tree from it with several candidates, and these candidates must be serial built, so at each cycle of the algorithm we can only mutate some nucleotides and test if the new gene pass throw our first filter before being a candidate for the Natural Selection. In a quantum algorithm, all the possible mutations of the gene exists at the same time, the states are superposed in the qubits, represented by a Hilbert vector. Then a valid state is selected using the decoherence based on the Natural Selection algorithm. We do not iterate each possibility spending a time t for the iteration, we have all the possibilities existing at the same time and then decoherence one of them to a real orthonormal state that can be measurable. IV. DARWINIAM SIGNIFICANCE We have to test that our algorithm is compatible with the classic Darwiniam Algorithm: 1. Reproduction/Heredity: hability to make copies and thereby produce descendants. 2. Selection: A process that preferentially selects one trait over another trait, leading to one trait being more numerous after sufficient generations. 3. Variation: differences in heritable traits that affect Fitness or the ability to survive and reproduce leading to differential survival. We test that our quantum algorithm: 1. Is able to make copies of one state and produce descendants (mutations). 2. From all the possible descendants in a quantum state the algorithm decoherence selects those with more potential to survive. 3. Sucessive iterations evolve different populations.