Characterizations of one-way general quantum finite automata

  • Authors:

  • Lvzhou Li;Daowen Qiu;Xiangfu Zou;Lvjun Li;Lihua Wu;Paulo Mateus

  • Affiliations:

  • Department of Computer Science, Sun Yat-sen University, Guangzhou 510006, China;Department of Computer Science, Sun Yat-sen University, Guangzhou 510006, China and SQIGInstituto de Telecomunicações, Departamento de Matemática, Instituto Superior Técnico, U ...;Department of Computer Science, Sun Yat-sen University, Guangzhou 510006, China;Department of Computer Science, Sun Yat-sen University, Guangzhou 510006, China;Department of Computer Science, Sun Yat-sen University, Guangzhou 510006, China;SQIGInstituto de Telecomunicações, Departamento de Matemática, Instituto Superior Técnico, Universidade Técnica de Lisboa, Av. Rovisco Pais 1049-001, Lisbon, Portugal

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2012

Quantified Score

Hi-index 5.23

Visualization

Abstract

Generally, unitary transformations limit the computational power of quantum finite automata (QFA). In this paper, we study a generalized model named one-way general quantum finite automata (1gQFA), in which each symbol in the input alphabet induces a trace-preserving quantum operation, instead of a unitary transformation. Two different kinds of 1gQFA will be studied: measure-once one-way general quantum finite automata (MO-1gQFA) where a measurement deciding to accept or reject is performed at the end of a computation, and measure-many one-way general quantum finite automata (MM-1gQFA) where a similar measurement is performed after each trace-preserving quantum operation on reading each input symbol. We characterize the measure-once model from three aspects: the closure property, the language recognition power, and the equivalence problem. We prove that MO-1gQFA recognize, with bounded error, precisely the set of all regular languages. Our results imply that some models of quantum finite automata proposed in the literature, which were expected to be more powerful, still cannot recognize non-regular languages. We prove that MM-1gQFA also recognize only regular languages with bounded error. Thus, MM-1gQFA and MO-1gQFA have the same language recognition power, in sharp contrast with traditional MO-1QFA and MM-1QFA, the former being strictly less powerful than the latter. Finally, we present a necessary and sufficient condition for two MM-1gQFA to be equivalent.