Quantum versus Probabilistic One-Way Finite Automata with Counter | SpringerLink
Skip to main content
Springer Nature Link
Log in

Quantum versus Probabilistic One-Way Finite Automata with Counter

  • Conference paper
  • First Online:
SOFSEM 2001: Theory and Practice of Informatics (SOFSEM 2001)

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

Abstract

The paper adds the one-counter one-way finite automaton [6] to the list of classical computing devices having quantum counterparts more powerful in some cases. Specifially, two languages are considered, the first is not recognizable by deterministic one-counter one-way finite automata, the second is not recognizable with bounded error by probabilistic one-counter one-way finite automata, but each recognizable with bounded error by a quantum one-counter one-way finite automaton. This result contrasts the case of one-way finite automata without counter, where it is known [5] that the quantum device is actually less powerful than its classical counterpart.

Supported by the ML2000 project sponsored by the Swedish Institute.

Research supported by the Latvian Council of Science, grant 01.0354; European Commission, contract IST-1999-11234; Swedish Institute, project ML2000

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5719
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7149
Price includes VAT (Japan)
  • 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.

Similar content being viewed by others

References

  1. Ambainis, A., and R. Freivalds: 1-way quantum finite automata: strengths, weaknessesand generalizations. Proc. 39 th FOCS (1998) 332–341

    Google Scholar 

  2. Ambainis, A., and J. Watrous: Two-way finite automata with quantum and classicalstates. http://xxx.lanl.gov/abs/cs.CC/9911009

  3. Deutsch, D.: Quantum theory, the Church-Turing principle and the universal quantumcomputer. Proc. Royal Society London, A400 ( 1989) 96–117

    Google Scholar 

  4. Gruska, J.: Quantum Computing, McGraw Hill (1999)

    Google Scholar 

  5. Kondacs, A., and J. Watrous: On the power of quantum finite state automata. Proc.38th FOCS (1997) 66–75

    Google Scholar 

  6. Kravtsev, M.: Quantum Finite One-Counter Automata. In: Proc. 26th SOFSEM(1999), LNCS 1725, Springer-Verlag, 431–440. http://xxx.lanl.gov/abs/quantph/9905092

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Physics, Malardalen University, Vasteras, Sweden

    Richard Bonner

  2. Department of Computer Science, University of Latvia, Raina bulv.19, Riga, Latvia

    Rūsiņš Freivalds & Maksim Kravtsev

Authors
  1. Richard Bonner
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rūsiņš Freivalds
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Maksim Kravtsev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Computer Science, University of Wroclaw, Przesmyckiego 20, 51-151, Wroclaw, Poland

    Leszek Pacholski

  2. Fac. of Mathematics, Physics, and Informatics, Inst. of Informatics, Comenius Univ., Mlynská dolina, 84248, Bratislava, Slovakia

    Peter Ružička

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bonner, R., Freivalds, R., Kravtsev, M. (2001). Quantum versus Probabilistic One-Way Finite Automata with Counter. In: Pacholski, L., Ružička, P. (eds) SOFSEM 2001: Theory and Practice of Informatics. SOFSEM 2001. Lecture Notes in Computer Science, vol 2234. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45627-9_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-45627-9_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42912-8

  • Online ISBN: 978-3-540-45627-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation