Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata
| Authors | |
|---|---|
| Year of publication | 2015 |
| Type | Article in Periodical |
| Magazine / Source | Information and computation |
| MU Faculty or unit | |
| Citation | |
| web | http://www.sciencedirect.com/science/article/pii/S0890540115000140 |
| Doi | http://dx.doi.org/10.1016/j.ic.2015.02.003 |
| Field | Informatics |
| Keywords | Quantum computing; Quantum finite automata; Quantum Arthur–Merlin proof systems; Two-way finite automata with quantum and classical states |
| Description | Interactive proof systems (IP) are very powerful - languages they can accept form exactly PSPACE. They represent also one of the very fundamental concepts of theoretical computing and a model of computation by interactions. One of the key players in IP is verifier. In the original model of IP whose power is that of PSPACE, the only restriction on verifiers is that they work in randomized polynomial time. Because of such key importance of IP, it is of large interest to find out how powerful will IP be when verifiers are more restricted. So far this was explored for the case that verifiers are two-way probabilistic finite automata (Dwork and Stockmeyer, 1990) and one-way quantum finite automata as well as two-way quantum finite automata (Nishimura and Yamakami, 2009). IP in which verifiers use public randomization is called Arthur-Merlin proof systems (AM). AM with verifiers modeled by Turing Machines augmented with a fixed-size quantum register (qAM) were studied also by Yakaryilmaz (2012). He proved, for example, that an NP-complete language LknapsackLknapsack, representing the 0–1 knapsack problem, can be recognized by a qAM whose verifier is a two-way finite automaton working on quantum mixed states using superoperators. In this paper we explore the power of AM for the case that verifiers are two-way finite automata with quantum and classical states (2QCFA) – introduced by Ambainis and Watrous in 2002 – and the communications are classical. It is of interest to consider AM with such “semi-quantum” verifiers because they use only limited quantum resources. Our main result is that such Quantum Arthur–Merlin proof systems (QAM(2QCFA)) with polynomial expected running time are more powerful than the models in which the verifiers are two-way probabilistic finite automata (AM(2PFA)) with polynomial expected running time. Moreover, we prove that there is a language which can be recognized by an exponential expected running time QAM(2QCFA), but cannot be recognized by any AM(2PFA), and that the NP-complete language LknapsackLknapsack can also be recognized by a QAM(2QCFA) working only on quantum pure states using unitary operators. |
| Related projects: |