TY - GEN

T1 - Polynomial-time algorithms for the equivalence for one-way quantum finite automata

AU - Koshiba, Takeshi

PY - 2001/12/1

Y1 - 2001/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=71049137371&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=71049137371&partnerID=8YFLogxK

U2 - 10.1007/3-540-45678-3_24

DO - 10.1007/3-540-45678-3_24

M3 - Conference contribution

AN - SCOPUS:71049137371

SN - 3540429859

SN - 9783540429852

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 268

EP - 278

BT - Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings

T2 - 12th International Symposium on Algorithms and Computation, ISAAC 2001

Y2 - 19 December 2001 through 21 December 2001

ER -