Quantum and Reversible Verification of Proofs Using Constant Memory Space

Non-interactive verification of proofs or certificates by deterministic verifiers in polynomial time with mighty provers is used to characterize languages in NP. We initiate the study of the computational complexity of similar non-interactive proof-verification procedures by quantum and reversible verifiers who are permitted to use only a constant amount of memory storage. By modeling those weak verifiers as quantum and reversible finite automata, we investigate fundamental properties of such non-interactive proof systems and demonstrate that languages admitting proof systems in which verifiers must scan the input in real time are exactly regular languages. On the contrary, when we allow verifiers to move their tape heads in all directions, the corresponding proof systems are empowered to recognize non-stochastic, non-context-free, and NP-complete languages.

[1]  Tomoyuki Yamakami,et al.  One-way reversible and quantum finite automata with advice , 2012, Inf. Comput..

[2]  Alex Brodsky,et al.  Characterizations of 1-Way Quantum Finite Automata , 2002, SIAM J. Comput..

[3]  John Watrous,et al.  On the power of quantum finite state automata , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[4]  Jozef Gruska,et al.  Quantum Computing , 2008, Wiley Encyclopedia of Computer Science and Engineering.

[5]  Cynthia Dwork,et al.  Finite state verifiers I: the power of interaction , 1992, JACM.

[6]  Abuzer Yakaryilmaz,et al.  Public-qubits versus private-coins , 2012, Electron. Colloquium Comput. Complex..

[7]  Jozef Gruska,et al.  Quantum Computing Challenges , 2001 .

[8]  Tomoyuki Yamakami,et al.  Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages , 2013, SOFSEM.

[9]  Shenggen Zheng,et al.  Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata , 2013, Inf. Comput..

[10]  James P. Crutchfield,et al.  Quantum automata and quantum grammars , 2000, Theor. Comput. Sci..

[11]  Chris Marriott,et al.  Quantum Arthur–Merlin games , 2004, Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004..

[12]  A Min Tjoa,et al.  SOFSEM 2014: Theory and Practice of Computer Science , 2014, Lecture Notes in Computer Science.

[13]  Harumichi Nishimura,et al.  An Application of Quantum Finite Automata to Interactive Proof Systems , 2004, CIAA.

[14]  Borivoj Melichar,et al.  Finding Common Motifs with Gaps Using Finite Automata , 2006, CIAA.

[15]  Jacques Sakarovitch,et al.  Elements of Automata Theory , 2009 .

[16]  Harumichi Nishimura,et al.  An application of quantum finite automata to interactive proof systems , 2009, J. Comput. Syst. Sci..

[17]  A. C. Cem Say,et al.  Unbounded-error quantum computation with small space bounds , 2010, Inf. Comput..