Quantum Finite State Transducers | SpringerLink
Skip to main content
Springer Nature Link
Log in

Quantum Finite State Transducers

  • 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

We introduce quantum finite state transducers (qfst), and study the class of relations which they compute. It turns out that they share many features with probabilistic finite state transducers, especially regarding undecidability of emptiness (at least for low probability of success). However, like their ‘little brothers’, the quantum finite automata, the power of qfst is incomparable to that of their probabilistic counterpart. This we show by discussing a number of characteristic examples.

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. M. Amano, K. Iwama, “Undecidability on Quantum Finite Automata”, in Proc. 31st STOC, 1999, pp.368–375.

    Google Scholar 

  2. A. Ambainis, R. Freivalds, “1-way quantum finite automata:strengths, weaknesses, and generalizations”, in Proc.39th FOCS, 1998, pp.332–341.

    Google Scholar 

  3. R. Bonner, R. Freivalds, R. Gailis, “Undecidability of 2-tape quantum finite au-tomata”, in Proceedings of Quantum Computation and Learning. Sundbyholms Slott, Sweden, 27–29 May, 2000, R. Bonner and R. Freivalds (eds.), Malardalen University, 2000, pp.93–100.

    Google Scholar 

  4. R. Freivalds, “Language recognition using finite probabilistic multitape and ulti-head automata”, Problems Inform. Transmission, vol.15, no.3, 1979, pp.235–241.

    MATH  MathSciNet  Google Scholar 

  5. R. Freivalds, A. Winter, “Quantum Finite State Transducers”, http://xxx.lanl.gov/ps/quant-ph/0011052

  6. E. Gurari, Introduction to the Theory of Computation, Computer Science Press, 1989.

    Google Scholar 

  7. J.G. Kemeny, J.L. Snell, Finite Markov Chains, Van Nostrand, Princeton, 1960.

    MATH  Google Scholar 

  8. A. Kondacs, J. Watrous, “On the power of quantum finite state automata”, in Proc.38th FOCS, 1997, pp.66–75.

    Google Scholar 

  9. M.O. Rabin, “robabilistic Automata”, Information and Control, vol.6, 1963, pp. 230–245.

    Article  Google Scholar 

  10. D. Scott, “Some definitional suggestions for automata theory”, J. of Comput. and Syst. Science, 1967, pp.187–212.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Bristol, Merchant Venturers Building, Woodland Road, BS8 1UB, Bristol, UK

    Rūsinņš Freivalds

  2. Institute of Mathematics and Computer Science, University of Latvia, Rainņa bulvāris 29, LV -1459, Riga, Latvia

    Andreas Winter

Authors
  1. Rūsinņš Freivalds
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andreas Winter
    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

Freivalds, R., Winter, A. (2001). Quantum Finite State Transducers. 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_20

Download citation

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

  • 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