# Quantum finite automata

## Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

- Theor. Comput. Sci.
- 2015

Following an early work of Dwork and Stockmeyer on interactive proof systems whose verifiers are two-way probabilistic finiteâ€¦Â (More)

Is this relevant?

2014

2014

- Computing with New Resources
- 2014

We present five examples where quantum finite automata (QFAs) outperform their classical counterparts. This may be useful as aâ€¦Â (More)

Is this relevant?

2010

2010

- Quantum Information & Computation
- 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

- ITA
- 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

- Journal of Automata, Languages and Combinatorics
- 2005

Quantum finite automata derive their strength by exploiting interference in complex valued probability amplitudes. Of particularâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- SIAM J. Comput.
- 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

- J. ACM
- 2002

We consider the possibility of encoding m classical bits into many fewer n quantum bits (qubits) so that an arbitrary bit fromâ€¦Â (More)

Is this relevant?

Highly Cited

2002

Highly Cited

2002

- Theor. Comput. Sci.
- 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)

Is this relevant?

1999

1999

- STOC
- 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)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- FOCS
- 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?