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

研究成果: Conference contribution

6 引用 (Scopus)

抜粋

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.

元の言語English
ホスト出版物のタイトルAlgorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings
ページ268-278
ページ数11
DOI
出版物ステータスPublished - 2001 12 1
外部発表Yes
イベント12th International Symposium on Algorithms and Computation, ISAAC 2001 - Christchurch, New Zealand
継続期間: 2001 12 192001 12 21

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
2223 LNCS
ISSN(印刷物)0302-9743
ISSN(電子版)1611-3349

Other

Other12th International Symposium on Algorithms and Computation, ISAAC 2001
New Zealand
Christchurch
期間01/12/1901/12/21

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント Polynomial-time algorithms for the equivalence for one-way quantum finite automata' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Koshiba, T. (2001). Polynomial-time algorithms for the equivalence for one-way quantum finite automata. : Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings (pp. 268-278). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 2223 LNCS). https://doi.org/10.1007/3-540-45678-3_24