Generation of Optimised Quantum Oracles using Grammar-Based Genetic Programming

GBGP (Grammar-Based Genetic Programming) is a metaheuristic framework for the automatic synthesis of minimal-depth diagonal quantum oracle circuits. Individuals are represented as derivation trees over a formal grammar that enforces structural validity using Pauli gates (X, Y, Z) and their multi-controlled variants (MCX, MCY, MCZ). The evolutionary engine, built on DEAP, features tournament selection, grammar-safe crossover and mutation, redundant gate elimination, adaptive mutation rates, and entropy-driven population restarts. The repository includes two configurations (fast and standard) and supports six oracle types: less-than, greater-than, multiples-of, primality, SAT, and combined, tested on 2 to 6 qubits. See the included README for detailed documentation on installation, usage, and output format.