6533b822fe1ef96bd127d91d

RESEARCH PRODUCT

Quantum finite multitape automata

Andris AmbainisRichard BonnerRusins FreivaldsMarats GolovkinsMarek Karpinski

subject

FOS: Computer and information sciencesQuantum PhysicsComputer Science - Computational ComplexityTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESTheoryofComputation_COMPUTATIONBYABSTRACTDEVICESFormal Languages and Automata Theory (cs.FL)FOS: Physical sciencesComputer Science - Formal Languages and Automata TheoryComputational Complexity (cs.CC)Quantum Physics (quant-ph)Nonlinear Sciences::Cellular Automata and Lattice GasesComputer Science::Formal Languages and Automata Theory

description

Quantum finite automata were introduced by C.Moore, J.P. Crutchfield, and by A.Kondacs and J.Watrous. This notion is not a generalization of the deterministic finite automata. Moreover, it was proved that not all regular languages can be recognized by quantum finite automata. A.Ambainis and R.Freivalds proved that for some languages quantum finite automata may be exponentially more concise rather than both deterministic and probabilistic finite automata. In this paper we introduce the notion of quantum finite multitape automata and prove that there is a language recognized by a quantum finite automaton but not by a deterministic or probabilistic finite automata. This is the first result on a problem which can be solved by a quantum computer but not by a deterministic or probabilistic computer. Additionally we discover unexpected probabilistic automata recognizing complicated languages.

yearjournalcountryeditionlanguage
1999-05-07
http://arxiv.org/abs/quant-ph/9905026