Quantum finite automata: A modern introduction

Abstract

We present five examples where quantum finite automata (QFAs) outperform their classical counterparts. This may be useful as a relatively simple technique to introduce quantum computation concepts to computer scientists. We also describe a modern QFA model involving superoperators that is able to simulate all known QFA and classical finite automaton variants.

arXiv comment15 pages

References in corpus (3)

• Generalizations of the distributed Deutsch-Jozsa promise problem
• Potential of quantum finite automata with exact acceptance
• Implications of quantum automata for contextuality

Cited by in corpus (2)

• Computing with a single qubit faster than the computation quantum speed limit
• Bell's theorem in automata theory