On the Weakness of One-Way Quantum Pushdown Automata
Masaki Nakanishi · 2010
In general, quantum computation models are expected to be more powerful than classical counterparts. However, sometimes this is not the case.It is known that there exists some regular language which one-way quantum finite automata and one-way quantum counter automata cannot recognize. This is due to the restriction of reversibility which quantum models must satisfy. Thus, it is an interesting question: what kinds of quantum models suffer from/overcome the restriction? To tackle this problem, we focus on (empty-stack acceptance) one-way quantum pushdown automata, and show that there exists a regular language which one-way quantum pushdown automata cannot recognize. This implies adding a stack to one-way finite automata cannot overcome the restriction of reversibility if we adopt empty-stack acceptance as the acceptance mode.