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

Authors:
Takeshi Koshiba
Affiliations:
-
Venue:
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Year:
2001

Citing 12
Cited 0

A polynomial-time algorithm for the equivalence of probabilistic automata

SIAM Journal on Computing
Quantum Complexity Theory

SIAM Journal on Computing
Quantum circuits with mixed states

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Quantum computation

Complexity theory retrospective II
Undecidability on quantum finite automata

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Descriptional complexity issues in quantum computing

Journal of Automata, Languages and Combinatorics
Quantum automata and quantum grammars

Theoretical Computer Science
Quantum computation and quantum information

Quantum computation and quantum information
On the power of quantum finite state automata

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
1-way quantum finite automata: strengths, weaknesses and generalizations

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
On Quantum and Classical Space-Bounded Processes with Algebraic Transition Amplitudes

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Introduction to probabilistic automata (Computer science and applied mathematics)

Introduction to probabilistic automata (Computer science and applied mathematics)

Quantified Score

Hi-index	0.00

Visualization

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.