Skip to main content
SpringerLink
Log in

On the Class of Languages Recognizable by 1-Way Quantum Finite Automata

  • Conference paper
  • First Online:
STACS 2001 (STACS 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2010))

Included in the following conference series:

Abstract

It is an open problem to characterize the class of languages recognized by quantum finite automata (QFA). We examine some neces- sary and some sufficient conditions for a (regular) language to be recog- nizable by a QFA. For a subclass of regular languages we get a condition which is necessary and sufficient.

Also, we prove that the class of languages recognizable by a QFA is not closed under union or any other binary Boolean operation where both arguments are significant.

Research supported by Berkeley Fellowship for Graduate Studies and, in part, NSF Grant CCR-9800024.

Research supported by Grant No.96.0282 from the Latvian Council of Science and European Commission, contract IST-1999-11234.

For the rest of the paper, we will omit “1-way” because this is the only model of QFAs that we consider in this paper. For other models of QFAs, see [KW 97] and [AW 99].

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. A. Ambainis, R. Bonner, R. Freivalds, A. Ķikusts. Probabilities to accept languages by quantum finite automata. Proc. COCOON’99, Lecture Notes in Computer Science, 1627:174–183. Also quant-ph/99040664.

    Google Scholar 

  2. A. Ambainis, R. Freivalds. 1-way quantum finite automata: strengths, weaknesses and generalizations. Proc. FOCS’98, pp. 332–341. Also quant-ph/9802062.

    Google Scholar 

  3. A. Ambainis, A. Nayak, A. Ta-Shma, U. Vazirani. Dense quantum coding and a lower bound for 1-way quantum automata. Proc. STOC’99, pp. 376–383. Also quant-ph/9804043.

    Google Scholar 

  4. A. Ambainis, J. Watrous. Two-way finite automata with quantum and classical states. cs.CC/9911009. Submitted to Theoretical Computer Science.

    Google Scholar 

  5. E. Bernstein, U. Vazirani, Quantum complexity theory. SIAM Journal on Computing, 26:1411–1473, 1997.

    Article  MATH  MathSciNet  Google Scholar 

  6. A. Brodsky, N. Pippenger. Characterizations of 1-way quantum finite automata. quant-ph/9903014.

    Google Scholar 

  7. J. Gruska. Descriptional complexity issues in quantum computing. Journal of Automata, Languages and Combinatorics, 5:191–218, 2000.

    MATH  MathSciNet  Google Scholar 

  8. J. Kemeny, J. Laurie Snell. Finite Markov Chains. Springer-Verlag, 1976.

    Google Scholar 

  9. A. Ķikusts. A small 1-way quantum finite automaton. quant-ph/9810065.

    Google Scholar 

  10. A. Kondacs, J. Watrous. On the power of quantum finite state automata. Proc. FOCS’97, pp. 66–75.

    Google Scholar 

  11. A. Meyer, C. Thompson. Remarks on algebraic decomposition of automata. Mathematical Systems Theory, 3:110–118, 1969.

    Article  MATH  MathSciNet  Google Scholar 

  12. C. Moore, J. Crutchfield. Quantum automata and quantum grammars. Theoretical Computer Science, 237:275–306, 2000. Also quant-ph/9707031.

    Article  MATH  MathSciNet  Google Scholar 

  13. A. Nayak. Optimal lower bounds for quantum automata and random access codes. Proc. FOCS’99, pp. 369–376. Also quant-ph/9904093.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Division, University of California, 94720, Berkeley, CA, USA

    Andris Ambainis1

  2. Institute of Mathematics and Computer Science, University of Latvia, Rainņa bulv. 29, Rīga, Latvia

    Arnolds KĶikusts & Māris Valdats

Authors
  1. Andris Ambainis1
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Arnolds KĶikusts
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Māris Valdats
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. I3S & INRIA Sophia Antipolis INRIA, CNRS, 2004 Route des Lucioles, 06902, Sophia-Antipolis, France

    Afonso Ferreira

  2. Institut für Theoretische Informatik, Fakultät Informatik, TU Dresden, 01062, Dresden, Germany

    Horst Reichel

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ambainis1, A., KĶikusts, A., Valdats, M. (2001). On the Class of Languages Recognizable by 1-Way Quantum Finite Automata. In: Ferreira, A., Reichel, H. (eds) STACS 2001. STACS 2001. Lecture Notes in Computer Science, vol 2010. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44693-1_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-44693-1_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41695-1

  • Online ISBN: 978-3-540-44693-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation