Quantum automata and periodic events

We study the phenomenon of periodicity on quantum automata from three points of view. First, we provide an efficient algorithm for testing the periodicity of stochastic events induced by measure-once one-way unary quantum automata (1qfa’s). Second, we design an algorithm for the synthesis of succinct unary 1qfa’s inducing periodic events. To evaluate the size of the resulting 1qfa’s, we relate the number of states of a minimal 1qfa inducing a linear approximation of a periodic event p to the harmonic structure of p. Next, we study the complexity of our synthesis algorithm. Third, we apply our synthesis algorithm for building succinct 1qfa’s that accept unary periodic languages. We also prove a lower bound on the size of 1qfa’s accepting unary periodic languages.