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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

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 languageEnglish
Title of host publicationAlgorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings
Pages268-278
Number of pages11
Volume2223 LNCS
DOIs
Publication statusPublished - 2001
Externally publishedYes
Event12th International Symposium on Algorithms and Computation, ISAAC 2001 - Christchurch, New Zealand
Duration: 2001 Dec 192001 Dec 21

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2223 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other12th International Symposium on Algorithms and Computation, ISAAC 2001
CountryNew Zealand
CityChristchurch
Period01/12/1901/12/21

    Fingerprint

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Koshiba, T. (2001). Polynomial-time algorithms for the equivalence for one-way quantum finite automata. In 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