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

Takeshi Koshiba

doi:10.1007/3-540-45678-3_24

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

Takeshi Koshiba^*

^*Corresponding author for this work

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

8 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 language	English
Title of host publication	Algorithms and Computation - 12th International Symposium, ISAAC 2001, Proceedings
Pages	268-278
Number of pages	11
DOIs	https://doi.org/10.1007/3-540-45678-3_24
Publication status	Published - 2001 Dec 1
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/Territory	New Zealand
City	Christchurch
Period	01/12/19 → 01/12/21

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/3-540-45678-3_24

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 (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. 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 proceeding › Conference 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. 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

@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",

month = dec,

day = "1",

doi = "10.1007/3-540-45678-3_24",

language = "English",

isbn = "3540429859",

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",

note = "12th International Symposium on Algorithms and Computation, ISAAC 2001 ; Conference date: 19-12-2001 Through 21-12-2001",

}

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 -

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

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this