Advertisement

Nonuniform Families of Polynomial-Size Quantum Finite Automata and Quantum Logarithmic-Space Computation with Polynomial-Size Advice

  • Tomoyuki YamakamiEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11417)

Abstract

The state complexity of a finite(-state) automaton intuitively measures the size of the description of the automaton. Sakoda and Sipser [STOC 1972, pp. 275–286] were concerned with nonuniform families of finite automata and they discussed the behaviors of nonuniform complexity classes defined by families of such finite automata having polynomial-size state complexity. In a similar fashion, we introduce nonuniform state complexity classes using families of quantum finite automata. Our primarily concern is one-way quantum finite automata empowered by garbage tapes. We show inclusion and separation relationships among nonuniform state complexity classes of various one-way finite automata, including deterministic, nondeterministic, probabilistic, and quantum finite automata of polynomial size. For two-way quantum finite automata equipped with garbage tapes, we discover a close relationship between the nonuniform state complexity of such a polynomial-size quantum finite automata family and the parameterized complexity class induced by quantum logarithmic-space computation assisted by polynomial-size advice.

Keywords

Quantum finite automata State complexity Quantum Turing machine Bounded-error probability Quantum advice 

References

  1. 1.
    Ambainis, A., Yakaryilmaz, A.S.: Automata and quantum computing. manuscript (2015). https://arxiv.org/abs/1507.01988
  2. 2.
    Berman, P., Lingas, A.: On complexity of regular languages in terms of finite automata. Technical Report 304, Institute of Computer Science, Polish Academy of Science, Warsaw (1977)Google Scholar
  3. 3.
    Dwork, C., Stockmeyer, L.: A time-complexity gap for two-way probabilistic finite state automata. SIAM J. Comput. 19, 1011–1023 (1990)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Kapoutsis, C.A.: Size complexity of two-way finite automata. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583, pp. 47–66. Springer, Heidelberg (2009).  https://doi.org/10.1007/978-3-642-02737-6_4CrossRefGoogle Scholar
  5. 5.
    Kapoutsis, C.A.: Minicomplexity. J. Automat. Lang. Combin. 17, 205–224 (2012)MathSciNetzbMATHGoogle Scholar
  6. 6.
    Kapoutsis, C.A.: Two-way automata versus logarithmic space. Theory Comput. Syst. 55, 421–447 (2014)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Kapoutsis, C.A., Pighizzini, G.: Two-way automata characterizations of L/poly versus NL. Theory Comput. Syst. 56, 662–685 (2015)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Nishimura, H., Yamakami, T.: Polynomial time quantum computation with advice. Inf. Process. Lett. 90, 195–204 (2004)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Sakoda, W.J., Sipser, M.: Nondeterminism and the size of two-way finite automata. In: Proceedings of the STOC 1978, pp. 275–286 (1978)Google Scholar
  10. 10.
    Villagra, M., Yamakami, T.: Quantum state complexity of formal languages. In: Shallit, J., Okhotin, A. (eds.) DCFS 2015. LNCS, vol. 9118, pp. 280–291. Springer, Cham (2015).  https://doi.org/10.1007/978-3-319-19225-3_24CrossRefzbMATHGoogle Scholar
  11. 11.
    Yamakami, T.: The roles of advice to one-tape linear-time turing machines and finite automata. Int. J. Found. Comput. Sci. 21, 941–962 (2010)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Yamakami, T.: One-way reversible and quantum finite automata with advice. Inf. Comput. 239, 122–148 (2014)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Yamakami, T.: The 2CNF Boolean formula satsifiability problem and the linear space hypothesis. In: Proceedings of MFCS 2017. LIPIcs, vol. 83, pp. 62:1–62:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017). A complete version is found at arXiv:1709.10453
  14. 14.
    Yamakami, T.: State complexity characterizations of parameterized degree-bounded graph connectivity, sub-linear space computation, and the linear space hypothesis. In: Konstantinidis, S., Pighizzini, G. (eds.) DCFS 2018. LNCS, vol. 10952, pp. 237–249. Springer, Cham (2018).  https://doi.org/10.1007/978-3-319-94631-3_20. A complete and corrected version is found at arXiv:1811.06336CrossRefGoogle Scholar
  15. 15.
    Yamakami, T.: Relativizations of nonuniform quantum finite automata families (2019, manuscript)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Faculty of EngineeringUniversity of FukuiFukuiJapan

Personalised recommendations