Skip to main content
SpringerLink
Log in

Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata

  • Conference paper
  • First Online:
Algorithms and Computation (ISAAC 2001)

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

Included in the following conference series:

Abstract

Two quantum finite automata are equivalent if for any string x the two automata accept x with equal probability. This paper gives a polynomial-time algorithm for determining whether two measure-once one-way quantum finite automata are equivalent. The paper also gives a polynomial-time algorithm for determining whether two measure-many one-way quantum finite automata are equivalent.

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. D. Aharonov, A. Kitaev, and N. Nisan. Quantum circuits with mixed states. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing, pages 20–30. ACM Press, 1998.

    Google Scholar 

  2. M. Amano and K. Iwama. Undecidability on quantum finite automata. In Proceedings of the 31st Annual ACM Symposium on Theory of Computing, pages 368–375. ACM Press, 1999.

    Google Scholar 

  3. A. Ambainis and R. Freivalds. 1-way quantum finite automata: Strengths, weaknesses and generalizations. In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, pages 332–341. IEEE Computer Society Press, 1998.

    Google Scholar 

  4. A. Ambainis, A. Kikusts, and M. Valdats. On the class of languages recognizable by 1-way quantum finite automata. In A. Ferreira and H. Reichel, editors, Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science (STACS 2001), volume 2010 of Lecture Notes in Computer Science, pages 75–86. Springer-Verlag, 2001.

    Google Scholar 

  5. E. Bernstein and U. Vazirani. Quantum complexity theory. SIAM Journal on Computing, 26(5):1411–1473, 1997.

    Article  MathSciNet  MATH  Google Scholar 

  6. A. Berthiaume. Quantum computation. In L. A. Hemaspaandra and A. L. Selman, editors, Complexity Theory Retrospective II, pages 23–50. Springer, 1997. 269

    Google Scholar 

  7. A. Brodsky and N. Pippenger. Characterizations of 1-way quantum finite automata. Los Alamos Preprint Archive, quant-ph/9903014, 1999.

    Google Scholar 

  8. J. Gruska. Descriptional complexity issues in quantum computing. Journal of Automata, Languages and Combinatorics, 5(3):191–218, 2000.

    MathSciNet  MATH  Google Scholar 

  9. A. Kondacs and J. Watrous. On the power of quantum finite state automata. In Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, pages 66–75. IEEE Computer Society Press, 1997.

    Google Scholar 

  10. C. Moore and J. P. Crutchfield. Quantum automata and quantum grammars. Theoretical Computer Science, 237(1–2):275–306, 2000.

    Article  MathSciNet  MATH  Google Scholar 

  11. M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.

    Google Scholar 

  12. A. Paz. Introduction to Probabilistic Autamata. Academic Press, 1971.

    Google Scholar 

  13. M. O. Rabin. Probabilistic automata. Information and Control, 6(3):230–245, 1963.

    Article  MathSciNet  MATH  Google Scholar 

  14. W. Tzeng. A polynomial-time algorithm for the equivalence of probabilistic automata. SIAM Journal on Computing, 21(2):216–227, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  15. J. Watrous. On quantum and classical space-bounded processes with algebraic transition amplitudes. In Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pages 341–351. IEEE Computer Society Press, 1999.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Secure Computing Lab., Fujitsu Laboratories Ltd., 4-1-1 Kamikodanaka, Nakahara-ku, 211-8588, Kawasaki, Japan

    Takeshi Koshiba

Authors
  1. Takeshi Koshiba
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Basser Department of Computer Science, University of Sydney, Madsen Building F09, 2006, Sydney, NSW, Australia

    Peter Eades

  2. Department of Computer Science, University of Canterbury, Private Bag 4800, Christchurch, New Zealand

    Tadao Takaoka

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Koshiba, T. (2001). Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata. In: Eades, P., Takaoka, T. (eds) Algorithms and Computation. ISAAC 2001. Lecture Notes in Computer Science, vol 2223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45678-3_24

Download citation

  • DOI: https://doi.org/10.1007/3-540-45678-3_24

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42985-2

  • Online ISBN: 978-3-540-45678-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation