Skip to search formSkip to main contentSkip to account menu

Quantum finite automata

Known as: Metric automaton, Metric automata, Topological automata 
In quantum computing, quantum finite automata (QFA) or quantum state machines are a quantum analog of probabilistic automata or a Markov decision… 
Wikipedia (opens in a new tab)

Related topics

Related topics

31 relations
Adjacency matrixBra–ket notationDe Bruijn graphDe Rham curve

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2011
2011
Quantum Finite Automata
Quantum finite automata (QFAs) are quantum counterparts of the usual finite automata. 1way QFAs recognize the same languages as… 
Highly Cited
2009
Highly Cited
2009
Languages recognized by nondeterministic quantum finite automata
The nondeterministic quantum finite automaton (NQFA) is the only known case where a one-way quantum finite automaton (QFA) model… 
2009
2009
Language Recognition by Generalized Quantum Finite Automata with Unbounded Error
In this note, we generalize the results of arXiv:0901.2703v1 We show that all one-way quantum finite automaton (QFA) models that… 
2008
2008
Languages Recognized with Unbounded Error by Quantum Finite Automata
We prove the following facts about the language recognition power of Kondacs-Watrous quantum finite automata in the unbounded… 
Highly Cited
2003
Highly Cited
2003
Quantum Computing: 1-Way Quantum Automata
In this paper we analyze several models of 1-way quantum finite automata, in the light of formal power series theory. In this… 
Highly Cited
1999
Highly Cited
1999
Undecidability on quantum finite automata
Our model in this paper is a 1.5.way quantum finite automaton which can move its head 0 or +1 position but not -1 position. It is… 
1999
1999
Probabilities to Accept Languages by Quantum Finite Automata
We construct a hierarchy of regular languages such that the current language in the hierarchy can be accepted by 1-way quantum… 
1991
1991
QRT FIFO Automata, Breath-First Grammars and Their Relations
1985
1985
Compilation of automata from morphological two-level rules
The t w o l e v e l m o d e l is a f r am ew or k for de s c r i b i n g word inflection. The model consists of a lexicon system… 
Highly Cited
1973
Highly Cited
1973
On Two-way Multihead Automata
  • O. Ibarra
  • Journal of computer and system sciences (Print)
  • 1973
  • Corpus ID: 13131778
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)