Abstract
We model constant-space quantum computation as measure-many two-way quantum finite automata and evaluate their language recognition power by analyzing their behaviors and explore their properties. In particular, when the automata halt “in finite steps,” they must terminate in worst-case liner time. Even if all computation paths of bounded-error automata do not terminate, it suffices to focus only on computation paths that terminate after exponentially many steps. We present a classical simulation of those automata on multi-head probabilistic finite automata with cut points. Moreover, we discuss how the power of the automata varies as the automata’s acceptance criteria change to error free, one-sided error, bounded error, and unbounded error.
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
Adleman, L.M., DeMarrais, J., Huang, M.A.: Quantum computability. SIAM J. Comput. 26, 1524–1540 (1997)
Ambainis, A., Freivalds, R.: 1-way quantum finite automata: strengths, weaknesses and generalizations. In: FOCS 1998, pp. 332–341 (1998)
Dwork, C., Stockmeyer, L.: Finite state verifier I: the power of interaction. J. ACM 39, 800–828 (1992)
Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: FOCS 1997, pp. 66–75 (1997)
Macarie, I.: Closure properties of stochastic languages. Technical Report No.441, Computer Science Department, University of Rochester (1993)
Macarie, I.I.: Multihead two-way probabilistic finite automata. Theory Comput. Syst. 30, 91–109 (1997)
Mahajan, M., Vinay, V.: Determinant: combinatorics, algorithms, and complexity. Chicago J. Theoret. Comput. Sci. 1997, Article no. 1997–5 (1997)
Moore, C., Crutchfield, J.: Quantum automata and quantum grammar. Theor. Comput. Sci. 237, 275–306 (2000)
Nishimura, H., Yamakami, T.: An application of quantum finite automata to interactive proof systems. J. Comput. System Sci. 75, 255–269 (2009)
Rabin, M.O.: Probabilistic automata. Inform. Control 6, 230–244 (1963)
Stolarsky, K.B.: Algebraic Numbers and Diophantine Approximations. Marcel Dekker (1974)
Watrous, J.: On the complexity of simulating space-bounded quantum computations. Computational Complexity 12, 48–84 (2003)
Yakaryilmaz, A., Say, A.C.C.: Unbounded-error quantum computation with small space bounds. Inf. Comput. 209, 873–892 (2011)
Yamakami, T.: Analysis of quantum functions. Internat. J. Found. Comput. Sci. 14, 815–852 (2003)
Yamakami, T., Yao, A.C.: NQP\(_{\mathbb{C}}={\rm co}\text{-C}_{=}{\rm P}\). Inf. Process. Lett. 71, 63–69 (1999)
Yao, A.C.: Class Note. Unpublished. Princeton University (1998)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Yamakami, T. (2015). Complexity Bounds of Constant-Space Quantum Computation. In: Potapov, I. (eds) Developments in Language Theory. DLT 2015. Lecture Notes in Computer Science(), vol 9168. Springer, Cham. https://doi.org/10.1007/978-3-319-21500-6_34
Download citation
DOI: https://doi.org/10.1007/978-3-319-21500-6_34
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-21499-3
Online ISBN: 978-3-319-21500-6
eBook Packages: Computer ScienceComputer Science (R0)