A quantum genetic algorithm with quantum crossover and mutation operations

TL;DR

This paper introduces a quantum genetic algorithm with quantum crossover and mutation operations, achieving quadratic speedup over classical algorithms by performing crossovers among all chromosomes in parallel.

Contribution

The paper presents a novel quantum genetic algorithm that incorporates quantum crossover and mutation, enabling parallel processing of crossovers and improved computational efficiency.

Findings

Achieves quadratic speedup over classical genetic algorithms.

Introduces quantum crossover operation for all chromosomes in parallel.

Demonstrates potential for more efficient evolutionary quantum computing.

Abstract

In the context of evolutionary quantum computing in the literal meaning, a quantum crossover operation has not been introduced so far. Here, we introduce a novel quantum genetic algorithm which has a quantum crossover procedure performing crossovers among all chromosomes in parallel for each generation. A complexity analysis shows that a quadratic speedup is achieved over its classical counterpart in the dominant factor of the run time to handle each generation.