6533b7d2fe1ef96bd125e19f

RESEARCH PRODUCT

Quantum Pushdown Automata

Marats Golovkins

subject

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

description

Quantum finite automata, as well as quantum pushdown automata (QPA) were first introduced by C. Moore and J. P. Crutchfield. In this paper we introduce the notion of QPA in a non-equivalent way, including unitarity criteria, by using the definition of quantum finite automata of Kondacs and Watrous. It is established that the unitarity criteria of QPA are not equivalent to the corresponding unitarity criteria of quantum Turing machines. We show that QPA can recognize every regular language. Finally we present some simple languages recognized by QPA, not recognizable by deterministic pushdown automata.

yearjournalcountryeditionlanguage
2001-02-09
http://arxiv.org/abs/quant-ph/0102054