  We present a framework for the implementation of quantum finite automata
algorithms designed for the language $ MOD_p = \{ a^{i\cdot p } \mid i \geq 0
\}$ on gate-based quantum computers. First, we compile the known theoretical
results from the literature to reduce the number of CNOT gates. Second, we
demonstrate techniques for modifying the algorithms based on the basis gates of
available quantum hardware in order to reduce circuit depth. Lastly, we explore
how the number of CNOT gates may be reduced further if the topology of the
qubits is known.
