11 citations · 11 across the 1 of their papers we have counts for
1 paper
Stephen Z. D. Plachta, Markus Hiekkamäki, Abuzer Yakaryılmaz +1
Quantum finite automata (QFA) are basic computational devices that make binary decisions using quantum operations. They are known to be exponentially memory efficient compared to t…