Paper 3, Section II, 15D15 \mathrm{D}

Quantum Information and Computation | Part II, 2018

In this question you may assume the following fact about the quantum Fourier transform QFTmodN:Q F T \bmod N: if N=ArN=A r and 0x0<r0 \leqslant x_{0}<r, where A,r,x0ZA, r, x_{0} \in \mathbb{Z}, then

QFT1Ak=0A1x0+kr=1rl=0r1ωx0lAlAQ F T \frac{1}{\sqrt{A}} \sum_{k=0}^{A-1}\left|x_{0}+k r\right\rangle=\frac{1}{\sqrt{r}} \sum_{l=0}^{r-1} \omega^{x_{0} l A}|l A\rangle

where ω=e2πi/N\omega=e^{2 \pi i / N}.

(a) Let ZN\mathbb{Z}_{N} denote the integers modulo NN. Let f:ZNZf: \mathbb{Z}_{N} \rightarrow \mathbb{Z} be a periodic function with period rr and with the property that ff is one-to-one within each period. We have one instance of the quantum state

f=1Nx=0N1xf(x)|f\rangle=\frac{1}{\sqrt{N}} \sum_{x=0}^{N-1}|x\rangle|f(x)\rangle

and the ability to calculate the function ff on at most two xx values of our choice.

Describe a procedure that may be used to determine the period rr with success probability O(1/loglogN)O(1 / \log \log N). As a further requirement, at the end of the procedure we should know if it has been successful, or not, in outputting the correct period value. [You may assume that the number of integers less than NN that are coprime to NN is O(N/loglogN)]O(N / \log \log N)].

(b) Consider the function f:Z12Z10f: \mathbb{Z}_{12} \rightarrow \mathbb{Z}_{10} defined by f(x)=3xmod10f(x)=3^{x} \bmod 10.

(i) Show that ff is periodic and find the period.

(ii) Suppose we are given the state f=112x=011xf(x)|f\rangle=\frac{1}{\sqrt{12}} \sum_{x=0}^{11}|x\rangle|f(x)\rangle and we measure the second register. What are the possible resulting measurement values yy and their probabilities?

(iii) Suppose the measurement result was y=3y=3. Find the resulting state α|\alpha\rangle of the first register after the measurement.

(iv) Suppose we measure the state QFTαQ F T|\alpha\rangle (with α|\alpha\rangle from part (iii)). What is the probability of each outcome 0c110 \leqslant c \leqslant 11 ?

Typos? Please submit corrections to this page on GitHub.