Revisiting the power and equivalence of one-way quantum finite automata

Authors:
Lvzhou Li;Daowen Qiu
Affiliations:
Department of Computer Science, Sun Yat-sen University, Guangzhou, People's Republic of China;Dept. of Com. Sci., Sun Yat-sen Univ., Guangzhou, People's Republic of China and SQIG, Instituto de Telecom., IST, TU Lisbon, Lisbon, Portugal and The State Key Lab. of Comp. Science, Inst. of Sof ...
Venue:
ICIC'10 Proceedings of the Advanced intelligent computing theories and applications, and 6th international conference on Intelligent computing
Year:
2010

Citing 13
Cited 1

Regular languages accepted by quantum automata

Information and Computation
Quantum automata and quantum grammars

Theoretical Computer Science
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Characterizations of 1-Way Quantum Finite Automata

SIAM Journal on Computing
On the Lower Bounds for One-Way Quantum Automata

MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
On the power of quantum finite state automata

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
1-way quantum finite automata: strengths, weaknesses and generalizations

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Some formal tools for analyzing quantum automata

Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Determination of equivalence between quantum sequential machines

Theoretical Computer Science
Determining the equivalence for one-way quantum finite automata

Theoretical Computer Science
Note: A note on quantum sequential machines

Theoretical Computer Science
Polynomial-Time Algorithms for the Equivalence for One-Way Quantum Finite Automata

ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Quantum computing: 1-way quantum automata

DLT'03 Proceedings of the 7th international conference on Developments in language theory

Another approach to the equivalence of measure-many one-way quantum finite automata and its application

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give a new proof for the fact that measure-many one-way quantum finite automata (MM-1QFA) recognize only regular languages with bounded error. Our proof, different from the one in the literature, gives another insight to the recognition power of MM-1QFA. Moreover, we generalize the proof to a broader class of automata that include probabilistic automata and some kinds of quantum finite automata. In addition, we briefly discuss the equivalence problem of some quantum computing models in a uniform framework.