Quantum Pushdown Automata
<|reference_start|>Quantum Pushdown Automata: 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.<|reference_end|>
@article{golovkins2001quantum,
    title={Quantum Pushdown Automata},
    author={Marats Golovkins},
    journal={LNCS, 2000, vol. 1963, pp. 336-346},
    year={2001},
    archivePrefix={arXiv},
    eprint={quant-ph/0102054},
    primaryClass={quant-ph cs.CC cs.FL}
}