{'fraction_non_alphanumeric': 0.014204545454545454, 'fraction_numerical': 0.004261363636363636, 'mean_word_length': 4.875, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Quantum Fourier Transform (QFT) over Galois fields

Galois fields are constantly gaining importance in quantum computing due to their wide usage in quantum error correction algorithms, and so it becomes relevant to define the QFT over Galois fields because of its main role in many of the most important quantum algorithms. The present article illustrates how to generalize the QFT so it can be applied over Galois fields and explains several examples of the application of the QFT over the simplest Galois fields. In particular the QFT will be defined for the Galois fields F2, F4 and GF(9), also the application of the QFT and the operations involved will be made using the Maple mathematical software.