Quantum Mechanics and Quantum Computation6.pdfVIP

Chapter 6 Period Finding and Factoring Let’s say we are given a black box for computing a periodic function, i.e. a function where f(x) = f(y) if and only if x ≡ y (mod r) The goal of a period finding algorithm is to find r. The algorithm for period finding is very similar to Simon’s algorithm, in fact we can think of it as a generalization of Simon’s algorithm. The steps we follow are very similar. Classically, we could solve this problem by querying our function with subsequent inputs until the function repeats. This takes O(r) = O(2n) queries to the function. There are other ways to solve t