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

Original language | English |
---|---|

Title of host publication | Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings |

Pages | 268-278 |

Number of pages | 11 |

Volume | 2223 LNCS |

DOIs | |

Publication status | Published - 2001 |

Externally published | Yes |

Event | 12th International Symposium on Algorithms and Computation, ISAAC 2001 - Christchurch, New Zealand Duration: 2001 Dec 19 → 2001 Dec 21 |

### Publication series

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

Volume | 2223 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

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

Country | New Zealand |

City | Christchurch |

Period | 01/12/19 → 01/12/21 |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings*(Vol. 2223 LNCS, pp. 268-278). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2223 LNCS). https://doi.org/10.1007/3-540-45678-3_24

**Polynomial-time algorithms for the equivalence for one-way quantum finite automata.** / Koshiba, Takeshi.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings.*vol. 2223 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2223 LNCS, pp. 268-278, 12th International Symposium on Algorithms and Computation, ISAAC 2001, Christchurch, New Zealand, 01/12/19. https://doi.org/10.1007/3-540-45678-3_24

}

TY - GEN

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

AU - Koshiba, Takeshi

PY - 2001

Y1 - 2001

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

SN - 3540429859

SN - 9783540429852

VL - 2223 LNCS

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

ER -