Postselection finite quantum automata

  • Authors:

  • Oksana Scegulnaja-Dubrovska;Lelde Lāce;Rūsiņš Freivalds

  • Affiliations:

  • Department of Computer Science, University of Latvia, Riga, Latvia;Department of Computer Science, University of Latvia, Riga, Latvia;Department of Computer Science, University of Latvia, Riga, Latvia

  • Venue:
  • UC'10 Proceedings of the 9th international conference on Unconventional computation
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Postselection for quantum computing devices was introduced by S. Aaronson[2] as an excitingly efficient tool to solve long standing problems of computational complexity related to classical computing devices only. This was a surprising usage of notions of quantum computation. We introduce Aaronson's type postselection in quantum finite automata. There are several nonequivalent definitions of quantumfinite automata. Nearly all of them recognize only regular languages but not all regular languages. We prove that PALINDROMES can be recognized by MM-quantum finite automata with postselection. At first we prove by a direct construction that the complement of this language can be recognized this way. This result distinguishes quantum automata from probabilistic automata because probabilistic finite automata with non-isolated cut-point 0 can recognize only regular languages but PALINDROMES is not a regular language.