Skip to main content
SpringerLink
Log in

Probabilistic Reversible Automata and Quantum 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

To study relationship between quantum finite automata and probabilistic finite automata, we introduce a notion of probabilistic reversible automata (PRA, or doubly stochastic automata). We find that there is a strong relationship between different possible models of PRA and corresponding models of quantum finite automata. We also propose a classification of reversible finite 1-way automata.

Research partially supported by the Latvian Council of Science, grant No. 01.0354 and grant for Ph.D. students; University of Latvia, K. Morbergs grant; European Commission, contract IST-1999-11234

Research partially supported by the Latvian Council of Science, grant No. 01.0354 and European Commission, contract IST-1999-11234

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. A. Ambainis, R. Bonner, R. Freivalds, A. Ķikusts. Probabilities to Accept Languages by Quantum Finite Automata. COCOON 1999, Lecture Notes in Computer Science, 1999, Vol. 1627, pp. 174–183. http://arxiv.org/abs/quant-ph/9904066

    Google Scholar 

  2. A. Ambainis, R. Freivalds. 1-Way Quantum Finite Automata: Strengths, Weaknesses and Generalizations. Proc. 39th FOCS, 1998, pp. 332–341. http://arxiv.org/abs/quant-ph/9802062

  3. A. Ambainis, A. Ķikusts, M. Valdats. On the Class of Languages Recognizable by 1-Way Quantum Finite Automata. STACS 2001, Lecture Notes in Computer Science, 2001, Vol. 2010, pp. 75–86. http://arxiv.org/abs/quant-ph/0009004

    Chapter  Google Scholar 

  4. A. Brodsky, N. Pippenger. Characterizations of 1-Way Quantum Finite Automata. http://arxiv.org/abs/quant-ph/9903014

  5. J. Hartmanis, R. E. Stearns. Algebraic Structure Theory of Sequential Machines. Prentice Hall, 1966.

    Google Scholar 

  6. J. G. Kemeny and J. L. Snell. Finite Markov Chains. Springer Verlag, 1976.

    Google Scholar 

  7. A. Kondacs, J. Watrous. On The Power of Quantum Finite State Automata. Proc. 38th FOCS, 1997, pp. 66–75.

    Google Scholar 

  8. C. Moore, J. P. Crutchfield. Quantum Automata and Quantum Grammars. Theoretical Computer Science, 2000, Vol. 237(1–2), pp. 275–306. http://arxiv.org/abs/quant-ph/9707031

    Article  MATH  MathSciNet  Google Scholar 

  9. A. Nayak. Optimal Lower Bounds for Quantum Automata and Random Access Codes. Proc. 40th FOCS, 1999, pp. 369–377. http://arxiv.org/abs/quant-ph/9904093

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

    Article  Google Scholar 

  11. G. Thierrin. Permutation Automata. Mathematical Systems Theory, Vol. 2(1), pp. 83–90

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Computer Science, University of Latvia, Raiņa bulv. 29, Riga, Latvia

    Marats Golovkins & Maksim Kravtsev

Authors
  1. Marats Golovkins
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Maksim Kravtsev
    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

Golovkins, M., Kravtsev, M. (2002). Probabilistic Reversible Automata and Quantum 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_61

Download citation

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

  • 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