We consider the problem of determining the period of a binary sequence. For sequences with small autocorrelation we prove the existence of a polynomial time quantum algorithm for the above problem based on an algorithm of Hales and Hallgren. We apply this result to several concrete examples for which the autocorrelation can be estimated using known bounds on character sums. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Piroi, F., & Winterhof, A. (2006). Quantum period reconstruction of binary sequences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3857 LNCS, pp. 60–67). https://doi.org/10.1007/11617983_5
Mendeley helps you to discover research relevant for your work.