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

Finite Automata
Finite automata
Polynomial-time Algorithm
Equivalence
Polynomials
Automata
Strings

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

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

Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings. Vol. 2223 LNCS 2001. p. 268-278 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2223 LNCS).

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

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, 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
Koshiba T. 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. 2001. p. 268-278. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-45678-3_24
Koshiba, Takeshi. / Polynomial-time algorithms for the equivalence for one-way quantum finite automata. Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings. Vol. 2223 LNCS 2001. pp. 268-278 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{9025f0a1ab9b4bd4bfd3d77875fefd73,
title = "Polynomial-time algorithms for the equivalence for one-way quantum finite automata",
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.",
author = "Takeshi Koshiba",
year = "2001",
doi = "10.1007/3-540-45678-3_24",
language = "English",
isbn = "3540429859",
volume = "2223 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "268--278",
booktitle = "Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings",

}

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

AN - SCOPUS:71049137371

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 -