Lower bounds on the size of semi-quantum finite automata

TL;DR

This paper establishes a universal lower bound on the size of semi-quantum automata, demonstrating they can be exponentially more concise than classical automata, and introduces a concise, universal method for this analysis.

Contribution

It provides a new, concise, and universal method to derive lower bounds on semi-quantum automata size, applicable to multiple models.

Findings

Semi-quantum automata can be exponentially more concise than DFA.

The proposed method is more concise than previous approaches.

The method applies universally to three main semi-quantum automata models.

Abstract

In the literature, there exist several interesting hybrid models of finite automata which have both quantum and classical states. We call them semi-quantum automata. In this paper, we compare the descriptional power of these models with that of DFA. Specifically, we present a uniform method that gives a lower bound on the size of the three existing main models of semi-quantum automata, and this bound shows that semi-quantum automata can be at most exponentially more concise than DFA. Compared with a recent work (Bianchi, Mereghetti, Palano, Theoret. Comput. Sci., 551(2014), 102-115), our method shows the following two advantages: (i) our method is much more concise; and (ii) our method is universal, since it is applicable to the three existing main models of semi-quantum automata, instead of only a specific model.