 Quantum finite automaton

A Quantum Finite Automaton (QFA) is a theoretical model of computation that extends the concept of classical finite automata by incorporating principles of quantum mechanics. Just as classical finite automata are used to recognize regular languages, quantum finite automata can be used to recognize certain types of languages, often with different computational properties and capabilities.