One-Way Finite Automata with Quantum and Classical States

  • Shenggen Zheng
  • Daowen Qiu
  • Lvzhou Li
  • Jozef Gruska
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7300)

Abstract

In this paper, we introduce and explore a new model of quantum finite automata (QFA). Namely, one-way finite automata with quantum and classical states (1QCFA), a one way version of two-way finite automata with quantum and classical states (2QCFA) introduced by Ambainis and Watrous in 2002 [3]. First, we prove that coin-tossing one-way probabilistic finite automata (coin-tossing 1PFA) [23] and one-way quantum finite automata with control language (1QFACL) [6] as well as several other models of QFA, can be simulated by 1QCFA. Afterwards, we explore several closure properties for the family of languages accepted by 1QCFA. Finally, the state complexity of 1QCFA is explored and the main succinctness result is derived. Namely, for any prime m and any ε1 > 0, there exists a language L m that cannot be recognized by any measure-many one-way quantum finite automata (MM-1QFA) [12] with bounded error \(\frac{7}{9}+\epsilon_1\), and any 1PFA recognizing it has at last m states, but L m can be recognized by a 1QCFA for any error bound ε > 0 with O(logm) quantum states and 12 classical states.

Keywords

Quantum State Bounded Error Classical State Regular Language Finite Automaton 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ambainis, A., Beaudry, M., Golovkins, M., Kikusts, A., Mercer, M., Thénrien, D.: Algebraic results on quantum automata. Theory Comput. Syst. 39, 165–188 (2006)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Ambainis, A., Freivalds, R.: One-way quantum finite automata: strengths, weaknesses and generalizations. In: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, pp. 332–341. IEEE Computer Society, Palo Alfo (1998)Google Scholar
  3. 3.
    Ambainis, A., Watrous, J.: Two-way finite automata with quantum and classical states. Theoretical Computer Science 287, 299–311 (2002)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Ambainis, A., Nahimovs, N.: Improved constructions of quantum automata. Theoretical Computer Science 410, 1916–1922 (2009)MathSciNetCrossRefMATHGoogle Scholar
  5. 5.
    Ambainis, A., Nayak, A., Ta-Shma, A., Vazirani, U.: Dense quantum coding and quantum automata. Journal of the ACM 49(4), 496–511 (2002)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Bertoni, A., Mereghetti, C., Palano, B.: Quantum Computing: 1-Way Quantum Automata. In: Ésik, Z., Fülöp, Z. (eds.) DLT 2003. LNCS, vol. 2710, pp. 1–20. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  7. 7.
    Bertoni, A., Mereghetti, C., Palano, B.: Small size quantum automata recognizing some regular languages. Theoretical Computer Science 340, 394–407 (2005)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Brodsky, A., Pippenger, N.: Characterizations of 1-way quantum finite automata. SIAM Journal on Computing 31, 1456–1478 (2002)MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Gruska, J.: Quantum Computing. McGraw-Hill, London (1999)MATHGoogle Scholar
  10. 10.
    Gruska, J.: Descriptional complexity issues in quantum computing. J. Automata, Languages Combin. 5, 191–218 (2000)MathSciNetMATHGoogle Scholar
  11. 11.
    Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addision-Wesley, New York (1979)MATHGoogle Scholar
  12. 12.
    Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: Proceedings of the 38th IEEE Annual Symposium on Foundations of Computer Science, pp. 66–75 (1997)Google Scholar
  13. 13.
    Le Gall, F.: Exponential separation of quantum and classical online space complexity. In: Proceedings of SPAA 2006, pp. 67–73 (2006)Google Scholar
  14. 14.
    Li, L.Z., Qiu, D.W.: Determining the equivalence for one-way quantum finite automata. Theoretical Computer Science 403, 42–51 (2008)MathSciNetCrossRefMATHGoogle Scholar
  15. 15.
    Li, L.Z., Qiu, D.W.: A note on quantum sequential machines. Theoretical Computer Science 410, 2529–2535 (2009)MathSciNetCrossRefMATHGoogle Scholar
  16. 16.
    Li, L.Z., Qiu, D.W., Zou, X.F., Li, L.J., Wu, L.H., Mateus, P.: Characterizations of one-way general quantum finite automata. Theoretical Computer Science 419, 73–91 (2012)MathSciNetCrossRefMATHGoogle Scholar
  17. 17.
    Mereghetti, C., Palano, B.: Quantum finite automata with control language. RAIRO- Inf. Theor. Appl. 40, 315–332 (2006)MathSciNetCrossRefMATHGoogle Scholar
  18. 18.
    Mereghetti, C., Palano, B., Pighizzini, G.: Note on the Succinctness of Deterministic, Nondeterministic, Probabilistic and Quantum Finite Automata. RAIRO-Inf. Theor. Appl. 5, 477–490 (2001)MathSciNetCrossRefMATHGoogle Scholar
  19. 19.
    Monras, A., Beige, A., Wiesner, K.: Hidden Quantum Markov Models and non-adaptive read-out of many-body states. ArXiv:1002.2337 (2010)Google Scholar
  20. 20.
    Moore, C., Crutchfield, J.P.: Quantum automata and quantum grammars. Theoretical Computer Science 237, 275–306 (2000)MathSciNetCrossRefMATHGoogle Scholar
  21. 21.
    Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)MATHGoogle Scholar
  22. 22.
    Paschen, K.: Quantum finite automata using ancilla qubits. Technical Report, University of Karlsruhe (2000)Google Scholar
  23. 23.
    Paz, A.: Introduction to Probabilistic Automata. Academic Press, New York (1971)MATHGoogle Scholar
  24. 24.
    Qiu, D.W.: Some Observations on Two-Way Finite Automata with Quantum and Classical States. In: Huang, D.-S., Wunsch II, D.C., Levine, D.S., Jo, K.-H. (eds.) ICIC 2008. LNCS, vol. 5226, pp. 1–8. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  25. 25.
    Qiu, D.W., Li, L.Z., Mateus, P., Gruska, J.: Quantum Finite Automata. In: Wang, J. (ed.) Handbook of Finite State Based Models and Applications, pp. 113–144. CRC Press, Boca Raton (2012)CrossRefGoogle Scholar
  26. 26.
    Qiu, D.W., Mateus, P., Sernadas, A.: One-way quantum finite automata together with classical states. arXiv:0909.1428Google Scholar
  27. 27.
    Qiu, D.W., Yu, S.: Hierarchy and equivalence of multi-letter quantum finite automata. Theoretical Computer Science 410, 3006–3017 (2009)MathSciNetCrossRefMATHGoogle Scholar
  28. 28.
    Yakaryilmaz, A., Cem Say, A.C.: Succinctness of two-way probabilistic and quantum finite automata. Discrete Mathematics and Theoretical Computer Science 12(4), 19–40 (2010)MathSciNetMATHGoogle Scholar
  29. 29.
    Yakaryilmaz, A., Cem Say, A.C.: Unbounded-error quantum computation with small space bounds. Information and Computation 209, 873–892 (2011)MathSciNetCrossRefMATHGoogle Scholar
  30. 30.
    Yakaryilmaz, A., Cem Say, A.C.: Languages recognized by nondeterministic quantum finite automata. Quantum Information and Computation 10(9-10), 747–770 (2010)MathSciNetMATHGoogle Scholar
  31. 31.
    Yu, S.: Regular Languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 41–110. Springer, Heidelberg (1998)Google Scholar
  32. 32.
    Zheng, S.G., Li, L.Z., Qiu, D.W.: Two-Tape Finite Automata with Quantum and Classical States. International Journal of Theoretical Physics 50, 1262–1281 (2011)MathSciNetCrossRefMATHGoogle Scholar
  33. 33.
    Zheng, S.G., Qiu, D.W., Li, L.Z.: Some languages recongnied by two-way finite automata with quantum and classical states. International Journal of Foundation of Computer Science. Also arXiv:1112.2844 (2011) (to appear)Google Scholar
  34. 34.
    Zheng, S.G., Qiu, D.W., Gruska, J., Li, L.Z., Mateus, P.: State succinctness of two-way finite automata with quantum and classical states. ArXiv:1202.2651 (2012)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Shenggen Zheng
    • 1
  • Daowen Qiu
    • 1
    • 3
    • 4
  • Lvzhou Li
    • 1
  • Jozef Gruska
    • 2
  1. 1.Department of Computer ScienceSun Yat-sen UniversityGuangzhouChina
  2. 2.Faculty of InformaticsMasaryk UniversityBrnoCzech Republic
  3. 3.SQIG–Instituto de Telecomunicações, Departamento de Matemática, Instituto Superior TécnicoTULisbonLisbonPortugal
  4. 4.The State Key Laboratory of Computer Science, Institute of SoftwareChinese Academy of SciencesBeijingChina

Personalised recommendations