带垃圾带的量子下推自动机
Quantum Pushdown Automata with a Garbage Tape
摘要：
人们提出了几种量子下推自动机模型，并对它们的计算能力进行了深入的研究。然而，对于一些量子下推自动机模型，量子模型是否至少与经典模型一样强大还不清楚。这是由于可逆性限制。在本文中，我们引入了一个新的量子下推自动机模型，它具有一个垃圾带。该模型利用垃圾带存储弹出符号，克服了可逆性限制。我们表明，该模型可以模拟任何量子下推自动机与经典堆栈以及任何概率下推自动机。我们还表明，我们的模型可以解决一定的承诺问题，而确定性下推自动机不能。这些结果表明，我们的模型是严格更强大的设置中的精确，单侧误差和非确定性计算比经典的同行。
英文摘要：
Several kinds of quantum pushdown automaton models have been proposed, and their computational power is investigated intensively. However, for some quantum pushdown automaton models, it is not known whether quantum models are at least as powerful as classical counterparts or not. This is due to the reversibility restriction. In this paper, we introduce a new quantum pushdown automaton model that has a garbage tape. This model can overcome the reversibility restriction by exploiting the garbage tape to store popped symbols. We show that the proposed model can simulate any quantum pushdown automaton with a classical stack as well as any probabilistic pushdown automaton. We also show that our model can solve a certain promise problem exactly while deterministic pushdown automata cannot. These results imply that our model is strictly more powerful than classical counterparts in the setting of exact, one-sided error and non-deterministic computation.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
