On a family of linear recurrences

We concern ourselves with the family of linear recurrence relations aj = aj−1+aj−d with the initial conditions a0 = . . . = ad−1 = 1. We discuss the periodicity evaluation of such recurrences for prime powers d, and demonstrate that a key feature of our evaluation method relates to an instance of Shor's algorithm for factoring. As an application, we discuss how efficient quantum circuit designs may be completely recast as a problem relating to linear recurrence relations