Skip to main content
SpringerLink
Log in

Space-Efficient 1.5-Way Quantum Turing Machine

  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 2001)

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

Included in the following conference series:

  • 444 Accesses

Abstract

1.5QTM is a sort of QTM (Quantum Turing Machine) where the head cannot move left (it can stay where it is and move right). For computations is used other - work tape. In this paper will be studied possibilities to economize work tape space more than the same deterministic Turing Machine can do (for some of the languages). As an example language (0i1i|i≥0) is chosen, and is proved that this language could be recognized by deterministic Turing machine using log(i) cells on work tape, and 1.5QTM can recognize it using constant cells quantity.

Research supported by contract IST-1999-11234 (QAIP) from the European Commision, and grant no. 01.0354 from the Latvian Council of Science. This paper was written with financial support from Dati ltd.

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. Masami Amano, Kazuo Iwama. Undecidability on quantum finite automata. Proc. STOC, p. 368–375, 1999.

    Google Scholar 

  2. Jozef Gruska. Quantum computing. McGraw-Hill, London et al, 1999.

    Google Scholar 

  3. P. M. Lewis II, R. E. Stearns, and J. Hartmanis. Memory bounds for recogniton of context-free and context-sensitive languages. Proc. FOCS, p. 191–202, 1965.

    Google Scholar 

  4. Rũsiņš Freivalds. Probabilistic two-way machines. LNCS, v.118, p.33–45, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Computer Science, University of Latvia, Raina bulv. 29, Riga, Latvia

    Andrej Dubrovsky

Authors
  1. Andrej Dubrovsky
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Latvia, Raiņa bulvaris 29, LV-1459, Riga, Latvia

    Rūsiņš Freivalds

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dubrovsky, A. (2001). Space-Efficient 1.5-Way Quantum Turing Machine. In: Freivalds, R. (eds) Fundamentals of Computation Theory. FCT 2001. Lecture Notes in Computer Science, vol 2138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44669-9_37

Download citation

  • DOI: https://doi.org/10.1007/3-540-44669-9_37

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-44669-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation