Simon's Algorithm - Problem Description and Algorithm

Problem Description and Algorithm

The input to the problem is a function (implemented by a black box), promised to satisfy the property that for some we have for all, if and only if or . Note that the case of is allowed, and corresponds to being a permutation. The problem then is to find s.

The set of n-bit strings is a vector space under bitwise XOR. Given the promise, the preimage of f is either empty, or forms cosets with n-1 dimensions. Using quantum algorithms, we can, with arbitrarily high probability determine the basis vectors spanning this n-1 subspace since s is a vector orthogonal to all of the basis vectors.

Consider the Hilbert space consisting of the tensor product of the Hilbert space of input strings, and output strings. Using Hadamard operations, we can prepare the initial state

and then call the oracle to transform this state to

Hadamard transforms convert this state to

We perform a simultaneous measurement of both registers. If, we have destructive interference. So, only the subspace is picked out. Given enough samples of y, we can figure out the n-1 basis vectors, and compute s.