Skip to main content
SpringerLink
Log in

Revisiting the Power and Equivalence of One-Way Quantum Finite Automata

  • Conference paper
Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence (ICIC 2010)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6216))

Included in the following conference series:

  • 2177 Accesses

Abstract

We give a new proof for the fact that measure-many one-way quantum finite automata (MM-1QFA) recognize only regular languages with bounded error. Our proof, different from the one in the literature, gives another insight to the recognition power of MM-1QFA. Moreover, we generalize the proof to a broader class of automata that include probabilistic automata and some kinds of quantum finite automata. In addition, we briefly discuss the equivalence problem of some quantum computing models in a uniform framework.

This work is supported in part by the National Natural Science Foundation (Nos. 60573006, 60873055), the Program for New Century Excellent Talents in University (NCET) of China, the Fundamental Research Funds for the Central Universities (No. 10lgzd12) and by the project of SQIG at IT, funded by FCT and EU FEDER projects Quantlog POCI/MAT/55796/2004 and QSec PTDC/EIA/67661/2006, IT Project QuantTel, NoE Euro-NF, and the SQIG LAP initiative. Li is partly supported by the China Postdoctoral Science Foundation funded project(20090460808).

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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., Freivalds, R.: One-way quantum finite automata: strengths, weaknesses and generalizations. In: Proc. 39th FOCS, pp. 332–341 (1998)

    Google Scholar 

  2. Ablayev, F., Gainutdinova, A.: On the Lower Bounds for One-Way Quantum Automata. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol. 1893, pp. 132–140. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  3. Bertoni, A., Carpentieri, M.: Regular Languages Accepted by Quantum Automata. Inform. and Comput. 165, 174–182 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  4. 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 

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

    Article  MATH  MathSciNet  Google Scholar 

  6. Brodsky, A., Pippenger, N.: Characterizations of 1-way quantum Finite Automata. SIAM J. Comput. 31, 1456–1478 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  7. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addision-Wesley, New York (1979)

    MATH  Google Scholar 

  8. Kondacs, A., Watrous, J.: On the Power of Finite State Automata. In: Proc. FOCS’97, pp. 66–75 (1997)

    Google Scholar 

  9. Koshiba, T.: Polynomial-Time Algorithms for the Equivalence for One-way Quantum Finite Automata. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol. 2223, pp. 268–278. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  10. Li, L.Z., Qiu, D.W.: Determination of equivalence between quantum sequential machines. Theoret. Comput. Sci. 358, 65–74 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  11. Li, L.Z., Qiu, D.W.: Determining the equivalence for one-way quantum finite automata. Theoret. Comput. Sci. 403, 42–51 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  12. Li, L.Z., Qiu, D.W.: A Note on Quantum Sequential Machines. Theoret. Comput. Sci. 410, 2529–2535 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  13. Moore, C., Crutchfield, J.P.: Quantum Automata and Quantum Grammars. Theoret. Comput. Sci. 237, 275–306 (2000); Also quant-ph/9707031 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  14. Yakaryilmaz, A., Cem Say, A.C.: Languages Recognized with Unbounded Error by Quantum Finite Automata. arXiv:0809.0073v1 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Sun Yat-sen University, Guangzhou, 510275, People’s Republic of China

    Lvzhou Li & Daowen Qiu

  2. SQIG–Instituto de Telecomunicações, IST, TULisbon, Av. Rovisco Pais, 1049-001, Lisbon, Portugal

    Daowen Qiu

  3. The State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, 100080, People’s Republic of China

    Daowen Qiu

Authors
  1. Lvzhou Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daowen Qiu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Chinese Academy of Sciences, Intelligent Computing Laboratory, P.O. Box 1130, 230031, Hefei, Anhui, China

    De-Shuang Huang

  2. Department of Chemistry, University of Louisville, 2320 South Brook Street, 40292, Louisville, KY, USA

    Xiang Zhang

  3. Department of Computational Sciences, National Institute of Astrophysics Optics and Electronics, Luis E. Erro #1, 72840, Tonantzintla, Puebla, Mexico

    Carlos Alberto Reyes García

  4. Department of Computing, The Hong Kong Polytechnic University, Hong Kong, China

    Lei Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Li, L., Qiu, D. (2010). Revisiting the Power and Equivalence of One-Way Quantum Finite Automata. In: Huang, DS., Zhang, X., Reyes García, C.A., Zhang, L. (eds) Advanced Intelligent Computing Theories and Applications. With Aspects of Artificial Intelligence. ICIC 2010. Lecture Notes in Computer Science(), vol 6216. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14932-0_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14932-0_1

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14931-3

  • Online ISBN: 978-3-642-14932-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation