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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
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.
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.
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.
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.
E. Bernstein and U. Vazirani. Quantum complexity theory. SIAM Journal on Computing, 26(5):1411–1473, 1997.
A. Berthiaume. Quantum computation. In L. A. Hemaspaandra and A. L. Selman, editors, Complexity Theory Retrospective II, pages 23–50. Springer, 1997. 269
A. Brodsky and N. Pippenger. Characterizations of 1-way quantum finite automata. Los Alamos Preprint Archive, quant-ph/9903014, 1999.
J. Gruska. Descriptional complexity issues in quantum computing. Journal of Automata, Languages and Combinatorics, 5(3):191–218, 2000.
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.
C. Moore and J. P. Crutchfield. Quantum automata and quantum grammars. Theoretical Computer Science, 237(1–2):275–306, 2000.
M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
A. Paz. Introduction to Probabilistic Autamata. Academic Press, 1971.
M. O. Rabin. Probabilistic automata. Information and Control, 6(3):230–245, 1963.
W. Tzeng. A polynomial-time algorithm for the equivalence of probabilistic automata. SIAM Journal on Computing, 21(2):216–227, 1992.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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