Quantum Pushdown Automata
Marats Golovkins
Abstract
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.
Create a lesson
Related papers
Towards the Geometry of Quantum Optical Measurements: Kraus Trajectories in the Instrumental Weyl-Heisenberg Group Manifold
Tzula B. Propp, Chris S. Jackson
Bell's go theorem: regaining local causality with a new notion of realism
Lorenzo Catani, Nesta van der Schaaf, Rui Soares Barbosa
Quantum state texture of maximal-resource Fourier states under Hawking radiation
Shengyan Ma, Yiding Wang, Xiaofen Huang et al.
Magic-Free Certification of Logical Error Rates in Universal Fault-Tolerant Circuits
Gebrat Porta-San Miguel, Shahram Panahiyan, Dieter Jaksch
QBFF: Deep Quantum Bottleneck for Automatic Speaker Verification Anti-Spoofing
Anton Firc, Nouhaila Innan, Vojtěch Staněk et al.
Entanglement and parametric resonance in coupled oscillator systems
Roxane Thériault, George Zahariade