Skip to main content
SpringerLink
Log in

On the Power of One-Way Automata with Quantum and Classical States

  • Conference paper
Implementation and Application of Automata (CIAA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8587))

Included in the following conference series:

Abstract

We consider the model of one-way automata with quantum and classical states (qcfas) introduced in [23]. We show, by a direct approach, that qcfas with isolated cut-point accept regular languages only, thus characterizing their computational power. Moreover, we give a size lower bound for qcfas accepting regular languages, and we explicitly build qcfas accepting the word quotients and inverse homomorphic images of languages accepted by given qcfas with isolated cut-point, maintaining the same cut-point, isolation, and polynomially increasing the size.

Partially supported by MIUR under the project “PRIN: Automi e Linguaggi Formali: Aspetti Matematici e Applicativi.”

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ambainis, A., Beaudry, M., Golovkins, M., Kikusts, A., Mercer, M., Thérien, D.: Algebraic results on quantum automata. Theory of Comp. Sys. 39, 165–188 (2006)

    Article  MATH  Google Scholar 

  2. Ambainis, A., Watrous, J.: Two-way finite automata with quantum and classical states. Theoretical Computer Science 287, 299–311 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  3. 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)

    Chapter  Google Scholar 

  4. Bertoni, A., Mereghetti, C., Palano, B.: Small size quantum automata recognizing some regular languages. Theoretical Computer Science 340, 394–407 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bertoni, A., Mereghetti, C., Palano, B.: Some formal tools for analyzing quantum automata. Theoretical Computer Science 356, 14–25 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  6. Bertoni, A., Mereghetti, C., Palano, B.: Trace monoids with idempotent generators and measure-only quantum automata. Natural Computing 9, 383–395 (2010)

    Article  MATH  MathSciNet  Google Scholar 

  7. Bianchi, M.P., Mereghetti, C., Palano, B.: Size Lower Bounds for Quantum Automata. In: Mauri, G., Dennunzio, A., Manzoni, L., Porreca, A.E. (eds.) UCNC 2013. LNCS, vol. 7956, pp. 19–30. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  8. Bianchi, M.P., Palano, B.: Behaviours of unary quantum automata. Fundamenta Informaticae 104, 1–15 (2010)

    MATH  MathSciNet  Google Scholar 

  9. Brodsky, A., Pippenger, N.: Characterizations of 1-way quantum finite automata. SIAM J. Computing 5, 1456–1478 (2002)

    Article  MathSciNet  Google Scholar 

  10. Golovkins, M., Kravtsev, M.: Probabilistic reversible automata and quantum automata. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol. 2387, pp. 574–583. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  11. Hirvensalo, M.: Quantum automata with open time evolution. Int. J. Natural Computing Research 1, 70–85 (2010)

    Article  Google Scholar 

  12. Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (2001)

    MATH  Google Scholar 

  13. Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: Proc. 38th Symposium on Foundations of Computer Science (FOCS 1997), pp. 66–75 (1997)

    Google Scholar 

  14. Li, L., Qiu, D., Zou, X., Li, L., Wu, L., Mateus, P.: Characterizations of one-way general quantum finite automata. Theoretical Computer Science 419, 73–91 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  15. Mercer, M.: Lower bounds for generalized quantum finite automata. In: Martín-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 373–384. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  16. Moore, C., Crutchfield, J.: Quantum automata and quantum grammars. Theoretical Computer Science 237, 275–306 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  17. Mereghetti, C., Palano, B.: Quantum finite automata with control language. Theoretical Informatics and Applications 40, 315–332 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  18. Mereghetti, C., Palano, B.: Quantum automata for some multiperiodic languages. Theoretical Computer Science 387, 177–186 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  19. Nayak, A.: Optimal lower bounds for quantum automata and random access codes. In: Proc. 40th Symp. Found. Comp. Sci (FOCS 1999), pp. 369–376 (1999)

    Google Scholar 

  20. Salomaa, A., Soittola, M.: Automata theoretic aspects of formal power series. In: Texts and Monographs in Computer Science. Springer (1978)

    Google Scholar 

  21. Schützenberger, M.P.: On the definition of a family of automata. Information and Control 4, 245–270 (1961)

    Article  MATH  MathSciNet  Google Scholar 

  22. Shilov, G.: Linear Algebra. Prentice Hall (1971); Reprinted by Dover (1977)

    Google Scholar 

  23. Zheng, S., Qiu, D., Li, L., Gruska, J.: One-Way finite automata with quantum and classical states. In: Bordihn, H., Kutrib, M., Truthe, B. (eds.) Dassow Festschrift 2012. LNCS, vol. 7300, pp. 273–290. Springer, Heidelberg (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Università degli Studi di Milano, via Comelico 39, 20135, Milano, Italy

    Maria Paola Bianchi, Carlo Mereghetti & Beatrice Palano

Authors
  1. Maria Paola Bianchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Carlo Mereghetti
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Beatrice Palano
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität Giessen, Arndtstrasse 2, 35392, Giessen, Germany

    Markus Holzer  & Martin Kutrib  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Bianchi, M.P., Mereghetti, C., Palano, B. (2014). On the Power of One-Way Automata with Quantum and Classical States. In: Holzer, M., Kutrib, M. (eds) Implementation and Application of Automata. CIAA 2014. Lecture Notes in Computer Science, vol 8587. Springer, Cham. https://doi.org/10.1007/978-3-319-08846-4_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-08846-4_6

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-08845-7

  • Online ISBN: 978-3-319-08846-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation