Abstract
We introduce the concept of quantum alternation as a generalization of quantum nondeterminism. We define the first quantum alternating Turing machine (qATM) by augmenting alternating Turing machine (ATM) with a fixed-size quantum register. We focus on space-bounded computation, and obtain the following surprising result: One-way qATMs with constant-space (one-way alternating quantum finite automata (1AQFAs)) are Turing-equivalent. Then, we introduce strong version of qATM: The qATM that must halt in every computation path. We show that strong qATMs (similar to private ATMs) can simulate deterministic space with exponentially less space. This leads to shifting the deterministic space hierarchy exactly by one level. We also focus on realtime versions of 1AQFAs (rtAQFAs) and obtain many interesting results: (i) any language recognized by a rtAQFA is in quadratic deterministic space, (ii) two-alternation is better than one-alternation, (iii) two-alternation is sufficient to recognize a NP-complete language and so any language in NP can be recognized by a poly-time log-space qATM with two alternations, (iv) three-alternation is sufficient to recognize a language that is complete for the second level of the polynomial hierarchy and so any language in the second level of the polynomial hierarchy can be recognized by a poly-time log-space qATM with three alternations.
This work was partially supported by FP7 FET-Open project QCS. A preliminary report on some contents of this paper was [19].
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
Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press (2009)
Babai, L.: Trading group theory for randomness. In: STOC 1985: Proceedings of the 17th Annual ACM Symposium on Theory of Computing, pp. 421–429 (1985)
Berman, P., Karpinski, M., Larmore, L.L., Plandowski, W., Ryttere, W.: On the complexity of pattern matching for highly compressed two-dimensional texts. Journal of Computer and System Sciences 65(2), 332–350 (2002)
Chandra, A.K., Kozen, D.C., Stockmeyer, L.J.: Alternation. Journal of the ACM 28(1), 114–133 (1981)
Chandra, A.K., Stockmeyer, L.J.: Alternation. In: FOCS 1976: Proceedings of the 17th IEEE Symposium on Foundations of Computer Science, pp. 98–108 (1976)
Condon, A.: Computational Models of Games. MIT Press (1989)
Fenner, S., Green, F., Homer, S., Puim, R.: Quantum NP is hard for PH . In: Sixth Italian Conference on Theoretical Computer Science, pp. 241–252. World Scientific, Singapore (1998)
Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM Journal on Computing 18(1), 186–208 (1989)
Kozen, D.C.: On parallelism in Turing machines. In: FOCS 1976: Proceedings of the 17th IEEE Symposium on Foundations of Computer Science, pp. 89–97 (1976)
Nasu, M., Honda, N.: A context-free language which is not acceptable by a probabilistic automaton. Information and Control 18(3), 233–236 (1971)
Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press (2000)
Papadimitriou, C.H.: Games against nature. Journal of Computer and System Sciences 31(2), 288–301 (1985)
Papadimitriou, C.H.: Computational Complexity. Addison Wesley (1994)
Paz, A.: Introduction to Probabilistic Automata. Academic Press, New York (1971)
Reif, J.H.: The complexity of two-player games of incomplete information. Journal of Computer and System Sciences 29(2), 274–301 (1984)
Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. Journal of Computer and System Sciences 4(2), 177–192 (1970)
Watrous, J.: Space-bounded quantum complexity. Journal of Computer and System Sciences 59(2), 281–326 (1999)
Yakaryılmaz, A.: Public-qubits versus private-coins. Tech. Rep. ECCC:TR12–130 (2012), http://eccc.hpi-web.de/report/2012/130/
Yakaryılmaz, A.: Turing-equivalent automata using a fixed-size quantum memory. Tech. Rep. arXiv:1205.5395v1 (2012)
Yakaryılmaz, A., Say, A.C.C.: Languages recognized by nondeterministic quantum finite automata. Quantum Information and Computation 10(9&10), 747–770 (2010)
Yamakami, T., Yao, A.C.C.: NQP ℂ = co- C=P. Information Processing Letters 71(2), 63–69 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yakaryılmaz, A. (2013). Quantum Alternation. In: Bulatov, A.A., Shur, A.M. (eds) Computer Science – Theory and Applications. CSR 2013. Lecture Notes in Computer Science, vol 7913. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38536-0_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-38536-0_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38535-3
Online ISBN: 978-3-642-38536-0
eBook Packages: Computer ScienceComputer Science (R0)