Skip to main content
SpringerLink
Log in

Quantum versus Deterministic Counter Automata

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2002)

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

Included in the following conference series:

Abstract

This paper focuses on quantum analogues of various models of counter automata, and almost completely proves the relation between the classes of languages recognizable by bounded error quantum ones and classical deterministic ones in every model of counter automata. It is proved that (i) under some practically reasonable assumption, quantum ones are strictly stronger than deterministic ones in two-way one-counter automata, and (ii) for any fixed k, quantum ones and deterministic ones are incomparable in one-way k-counter automata.

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. R. J. Bonner, R. Freivalds, and M. Kravtsev. Quantum versus probabilistic one-way finite automata with counter. In Proceedings of the 28th Conference on Current Trends in Theory and Practice of Informatics (SOFSEM 2001), volume 2234 of Lecture Notes in Computer Science, pages 181–190, 2001.

    Chapter  Google Scholar 

  2. P. C. Fischer, A. R. Meyer, and A. L. Rosenberg. Counter machines and counter languages. Mathematical Systems Theory, 2(3):265–283, 1968.

    Article  MATH  MathSciNet  Google Scholar 

  3. E. M. Gurari and O. H. Ibarra. Two-way counter machines and Diophantine equations. Journal of the ACM, 29(3):863–873, 1982.

    Article  MATH  MathSciNet  Google Scholar 

  4. A. Kondacs and J. Watrous. On the power of quantum finite state automata. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pages 66–75, 1997.

    Google Scholar 

  5. M. Kravtsev. Quantum finite one-counter automata. In Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics (SOFSEM’ 99), volume 1725 of Lecture Notes in Computer Science, pages 431–440, 1999.

    Google Scholar 

  6. K.-J. Lange, P. McKenzie, and A. Tapp. Reversible space equals deterministic space. Journal of Computer and System Sciences, 60(2):354–367, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  7. M. L. Minsky. Recursive unsolvability of Post’s problem of ‘tag’ and other topics in the theory of Turing machines. Annals of Mathematics, 74(3):437–455, 1961.

    Article  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  9. K. Morita. Universality of a reversible two-counter machine. Theoretical Computer Science, 168(2):303–320, 1996.

    Article  MATH  MathSciNet  Google Scholar 

  10. A. Nayak. Optimal lower bounds for quantum automata and random access codes. In Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pages 369–376, 1999.

    Google Scholar 

  11. T. Yamasaki, H. Kobayashi, Y. Tokunaga, and H. Imai. One-way probabilistic reversible and quantum one-counter automata. Theoretical Computer Science, in press. Preliminary version appeared in Proceedings of the 6th Annual International Computing and Combinatorics Conference, volume 1858 of Lecture Notes in Computer Science, pages 436–446, 2000.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Information Science, The University of Tokyo, 7-3-1 Hongo, Bunkyo-ku, Tokyo, 113-0033, Japan

    Tomohiro Yamasaki, Hirotada Kobayashi & Hiroshi Imai

  2. ERATO, JST, Quantum Computation and Information Project, 5-28-3 Hongo, Bunkyo-ku, Tokyo, 113-0033, Japan

    Hirotada Kobayashi & Hiroshi Imai

Authors
  1. Tomohiro Yamasaki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hirotada Kobayashi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hiroshi Imai
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of California, Santa Barbara, California, 93106, USA

    Oscar H. Ibarra

  2. Department of Mathematics, National University of Singapore, Singapore, Singapore, 117543

    Louxin Zhang

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yamasaki, T., Kobayashi, H., Imai, H. (2002). Quantum versus Deterministic Counter Automata. In: Ibarra, O.H., Zhang, L. (eds) Computing and Combinatorics. COCOON 2002. Lecture Notes in Computer Science, vol 2387. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45655-4_62

Download citation

  • DOI: https://doi.org/10.1007/3-540-45655-4_62

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43996-7

  • Online ISBN: 978-3-540-45655-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation