Lower bounds on the size of semi-quantum automata

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.

[1]  Shenggen Zheng,et al.  Generalizations of the distributed Deutsch–Jozsa promise problem , 2014, Mathematical Structures in Computer Science.

[2]  Shenggen Zheng,et al.  On the state complexity of semi-quantum finite automata , 2014, RAIRO Theor. Informatics Appl..

[3]  Alberto Bertoni,et al.  Quantum Computing: 1-Way Quantum Automata , 2003, Developments in Language Theory.

[4]  Andris Ambainis,et al.  Quantum Finite Automata , 2011, NCMA.

[5]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[6]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[7]  Shenggen Zheng,et al.  One-Way Finite Automata with Quantum and Classical States , 2011, Languages Alive.

[8]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[9]  Thierry Paul,et al.  Quantum computation and quantum information , 2007, Mathematical Structures in Computer Science.

[10]  Paulo Mateus,et al.  Exponentially more concise quantum recognition of non-RMM regular languages , 2015, J. Comput. Syst. Sci..

[11]  Yuan Feng,et al.  On hybrid models of quantum finite automata , 2012, J. Comput. Syst. Sci..

[12]  Carlo Mereghetti,et al.  Quantum finite automata with control language , 2006, RAIRO Theor. Informatics Appl..

[13]  Lihua Wu,et al.  Characterizations of one-way general quantum finite automata , 2009, Theor. Comput. Sci..

[14]  Carlo Mereghetti,et al.  On the Power of One-Way Automata with Quantum and Classical States , 2014, Int. J. Found. Comput. Sci..

[15]  AmbainisAndris,et al.  Two-way finite automata with quantum and classical states , 2002 .

[16]  Carlo Mereghetti,et al.  Size Lower Bounds for Quantum Automata , 2013, UCNC.