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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Following an early work of Dwork and Stockmeyer on interactive proof systems whose verifiers are two-way probabilistic finite… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
  • table 4
Is this relevant?
2014
2014
We present five examples where quantum finite automata (QFAs) outperform their classical counterparts. This may be useful as a… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2010
2010
The nondeterministic quantum finite automaton (NQFA) is the only known case where a one-way quantum finite automaton (QFA) model… (More)
Is this relevant?
2006
2006
Bertoni et al. introduced in Lect. Notes Comput. Sci. 2710 (2003) 1–20 a new model of 1-way quantum finite automaton (1qfa… (More)
Is this relevant?
2005
2005
Quantum finite automata derive their strength by exploiting interference in complex valued probability amplitudes. Of particular… (More)
  • figure 1
Is this relevant?
Highly Cited
2002
Highly Cited
2002
The 2-way quantum finite automaton introduced by Kondacs and Watrous[KW97] can accept non-regular languages with bounded error in… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We consider the possibility of encoding m classical bits into many fewer n quantum bits (qubits) so that an arbitrary bit from… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We introduce 2-way finite automata with quantum and classical states (2qcfa's). This is a variant on the 2-way quantum finite… (More)
  • figure 1
Is this relevant?
1999
1999
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… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We consider 1-way quantum finite automata (QFAs). First, we compare them with their classical counterparts. We show that, if an… (More)
Is this relevant?