Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
428340 | Information Processing Letters | 2007 | 5 Pages |
Abstract
We consider the problem of determining the period of a sequence over an unknown finite field, given a black-box which returns only a few most significant bits of the sequence elements. 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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics