Abstract
Given a function p : N → [0,1] of period n, we study the minimal size (number of states) of a one-way quantum finite automaton (Iqfa) inducing the stochastic event ap + b, for real constants a>0, b≥0, a+b≤1. First of all, we relate the estimation of the minimal size to the problem of finding a minimal difference cover for a suitable subset of Zn. Then, by observing that the cardinality of a difference cover Δ for a set A ⊆ Zn, must satisfy [Formula: see text], we investigate the class of sets A admitting difference covers of cardinality exactly [Formula: see text]. We relate this problem with the efficient construction of Golomb rulers and difference sets. We design an algorithm which outputs each of the Golomb rulers (if any) of a given set in pseudo-polynomial time. As a consequence, we obtain an efficient algorithm that construct minimal difference covers for a non-trivial class of sets. Moreover, by using projective geometry arguments, we give an algorithm that, for any n=q2+q+1 with q prime power, constructs difference sets for Zn in quadratic time.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Foundations of Computer Science
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
