Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brodsky, A., Pippenger, N.: Characterizations of 1-way quantum finite automata. SIAM J. Comput. 31(5), 1456–1478 (2002)
Dwork, C., Stockmeyer, L.: Finite state verifiers I: the power of interaction. J. ACM 39(4), 800–828 (1997)
Gruska, J.: Quantum Computing. McGraw-Hill (2000)
Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: Proc. of FOCS 1997, pp. 66–75 (1997)
Marriott, C., Watrous, J.: Quantum Arthur-Merlin games. Computational Complexity 14(2), 122–152 (2005)
Moore, C., Crutchfield, J.P.: Quantum automata and quantum grammars. Theor. Comput. Sci. 237(1–2), 275–306 (2000)
Nishimura, H., Yamakami, T.: An application of quantum finite automata to interactive proof systems (extended abstract). In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol. 3317, pp. 225–236. Springer, Heidelberg (2005)
Nishimura, H., Yamakami, T.: An application of quantum finite automata to interactive proof systems. J. Comput. System Sci. 75(4), 255–269 (2009)
Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press (2000)
Yakaryilmaz, A.: Public-qubits versus private-qubits. Tech. Rep. TR12-130, Electronic Colloquium on Computational Complexity (2012)
Yakaryilmaz, A., Say, A.C.C.: Unbounded-error quantum computation with small space bounds. Inform. Comput. 279(6), 873–892 (2011)
Yamakami, T.: One-way reversible and quantum finite automata with advice. Inf. Comput. (in press, 2014), An extended abstract appeared in: Dediu, A.-H., MartÃn-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 526–537. Springer, Heidelberg (2012)
Yamakami, T.: Oracle pushdown automata, nondeterministic reducibilities, and the hierarchy over the family of context-free languages. In: Geffert, V., Preneel, B., Rovan, B., Štuller, J., Tjoa, A.M. (eds.) SOFSEM 2014. LNCS, vol. 8327, pp. 514–525. Springer, Heidelberg (2014), A complete version appeared at arXiv:1303.1717 (2013)
Zheng, S., Gruska, J., Qiu, D.: Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata, arXiv:1304.387 (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Villagra, M., Yamakami, T. (2014). Quantum and Reversible Verification of Proofs Using Constant Memory Space. In: Dediu, AH., Lozano, M., MartÃn-Vide, C. (eds) Theory and Practice of Natural Computing. TPNC 2014. Lecture Notes in Computer Science, vol 8890. Springer, Cham. https://doi.org/10.1007/978-3-319-13749-0_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-13749-0_13
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13748-3
Online ISBN: 978-3-319-13749-0
eBook Packages: Computer ScienceComputer Science (R0)