Skip to main content
Journal Article

Quantum finite automata: A modern introduction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2014) 8808 208-222
DOI: 10.1007/978-3-319-13350-8_16
42Citations
Citations of this article
30Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Say, A. C. C., & Yakaryılmaz, A. (2014). Quantum finite automata: A modern introduction. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8808, 208–222. https://doi.org/10.1007/978-3-319-13350-8_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free