Skip to main content
SpringerLink
Log in
Book cover

International Symposium on Fundamentals of Computation Theory

FCT 2001: Fundamentals of Computation Theory pp 412–415Cite as

Quantum Real - Time Turing Machine

  • Conference paper
  • First Online:

  • 438 Accesses

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

Abstract

The principles of quantum computation differ from the principles of classical computation very much. Quantum analogues to the basic constructions of the classical computation theory, such as Turing machine or finite 1-way and 2-ways automata, do not generalize deterministic ones. Their capabilities are incomparable. The aim of this paper is to introduce a quantum counterpart for real - time Turing machine. The recognition of a special kind of language, that can’t be recognized by a deterministic real - time Turing machine, is shown.

Research supported by contract IST-1999-11234 (QAIP) from the European Commision, and grant no. 01.0354 from the Latvian Council of Science.

This is a preview of subscription content, 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Feynman, R.: Simulating physics with computers. Int. J. Of Theor. Phys. Vol. 21 No. 6/7 (1982) 467–488

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  4. Hennie, F.: On-line Turing machine computation. IEEE Trans. Electr. Comp., EC-15 (1966) 35–44

    Article  Google Scholar 

  5. Hartmanis, J.: Computational complexity of one-tape Turing machine computations. J. Assoc. Comput. Mach. 15 (1968) 325–339

    MATH  MathSciNet  Google Scholar 

  6. Freivalds, R.:Complexity of palindromes recognition by Turing machines with an input. ”Algebra i Logika”, v.4, No. 1 (1965) 47–58 (in Russian)

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Oksana Scegulnaja

Authors
  1. Oksana Scegulnaja
    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

Scegulnaja, O. (2001). Quantum Real - Time 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_45

Download citation

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

  • 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