Skip to main content
SpringerLink
Log in

The Complexity of Probabilistic versus Quantum Finite Automata

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

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

  • 193 Accesses

Abstract

We present a language L n which is recognizable by a probabilistic finite automaton (PFA) with probability 1 - ε for all ε &gt 0 with O(log 2 n) states, with a deterministic finite automaton (DFA) with O(n) states, but a quantum finite automaton (QFA) needs at least 2Ω (n/ log n) states.

Research supported by Grant No.01.0354 from the Latvian Council of Science, and Contract IST-1999-11234 (QAIP) from the European Commission.

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. A. Kondacs, J. Watrous, On the power of quantum finite state automata, in Proc. 38th FOCS, 1997, pp. 66–75. 273

    Google Scholar 

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

    Google Scholar 

  3. A. Ambainis, A. Nayak, A. Ta-Shma, U. Vazirani: Dense Quantum Coding and a Lower Bound for 1-way Quantum Automata, quant-ph/9804043, 1998. 273, 275, 276

    Google Scholar 

  4. Z. Rasščevskis, The Complexity of Probabilistic versus Deterministic Finite Automata, http://www.ima.mdh.se/personal/rbr/courses/sundbyholmproc/zigmars.ps 273

  5. R. Freivalds, On the growth of the number of states of determinization of probabilistic automata,, Avtomatika i Vychislitelnaja Tehnika (in Russian), 1982, N.3, pp. 39–42. 273, 274

    Google Scholar 

  6. M.O. Rabin, Probabilistic Automata, Information and Control, 6(1963), pp. 230–245. 273

    Article  Google Scholar 

  7. A. Ambainis, The complexity of probabilistic versus deterministic finite automata, Proceedings of ISAAC’96, Lecture Notes in Computer Science, 1178(1996), pp. 233–237. 273

    Google Scholar 

  8. A. Ambainis, A. Ķikusts, Exact results for accepting probabilities of quantum automata, quant-ph/0109136, 2001. 278

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Latvia, Raiņa bulvāris 19, Riga, Latvia

    Gatis Midrijānis

Authors
  1. Gatis Midrijānis
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer and Information Science, University of Michigan - Dearborn, 4901 Evergreen Road, Dearborn, 48128, Michigan, USA

    William I. Grosky

  2. Department of Software Engineering School of Computer Science, Charles University, Malostranské nám. 25, 118 00, Prague, Czech Republic

    František Plášil

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Midrijānis, G. (2002). The Complexity of Probabilistic versus Quantum Finite Automata. In: Grosky, W.I., Plášil, F. (eds) SOFSEM 2002: Theory and Practice of Informatics. SOFSEM 2002. Lecture Notes in Computer Science, vol 2540. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36137-5_21

Download citation

  • DOI: https://doi.org/10.1007/3-540-36137-5_21

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-00145-4

  • Online ISBN: 978-3-540-36137-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation