Paper 3, Section II, D

Quantum Information and Computation | Part II, 2019

Let Hd\mathcal{H}_{d} denote a dd-dimensional state space with orthonormal basis {y:yZd}\left\{|y\rangle: y \in \mathbb{Z}_{d}\right\}. For any f:ZmZnf: \mathbb{Z}_{m} \rightarrow \mathbb{Z}_{n} let UfU_{f} be the operator on HmHn\mathcal{H}_{m} \otimes \mathcal{H}_{n} defined by

Ufxy=xy+f(x)modnU_{f}|x\rangle|y\rangle=|x\rangle|y+f(x) \bmod n\rangle

for all xZmx \in \mathbb{Z}_{m} and yZny \in \mathbb{Z}_{n}.

(a) Define QFTQ F T, the quantum Fourier transform modd\bmod d (for any chosen d)d).

(b) Let SS on Hd\mathcal{H}_{d} (for any chosen dd ) denote the operator defined by

Sy=y+1moddS|y\rangle=|y+1 \bmod d\rangle

for yZdy \in \mathbb{Z}_{d}. Show that the Fourier basis states ξx=QFTx\left|\xi_{x}\right\rangle=Q F T|x\rangle for xZdx \in \mathbb{Z}_{d} are eigenstates of SS. By expressing UfU_{f} in terms of SS find a basis of eigenstates of UfU_{f} and determine the corresponding eigenvalues.

(c) Consider the following oracle promise problem:

Input: an oracle for a function f:Z3Z3f: \mathbb{Z}_{3} \rightarrow \mathbb{Z}_{3}.

Promise: ff has the form f(x)=sx+tf(x)=s x+t where ss and tt are unknown coefficients (and with all arithmetic being mod3)\bmod 3).

Problem: Determine ss with certainty.

Can this problem be solved by a single query to a classical oracle for ff (and possible further processing independent of f)f) ? Give a reason for your answer.

Using the results of part (b) or otherwise, give a quantum algorithm for this problem that makes just one query to the quantum oracle UfU_{f} for ff.

(d) For any f:Z3Z3f: \mathbb{Z}_{3} \rightarrow \mathbb{Z}_{3}, let f1(x)=f(x+1)f_{1}(x)=f(x+1) and f2(x)=f(x)f_{2}(x)=-f(x) (all arithmetic being mod3\bmod 3 ). Show how Uf1U_{f_{1}} and Uf2U_{f_{2}} can each be implemented with one use of UfU_{f} together with other unitary gates that are independent of ff.

(e) Consider now the oracle problem of the form in part (c) except that now ff is a quadratic function f(x)=ax2+bx+cf(x)=a x^{2}+b x+c with unknown coefficients a,b,ca, b, c (and all arithmetic being mod 3), and the problem is to determine the coefficient aa with certainty. Using the results of part (d) or otherwise, give a quantum algorithm for this problem that makes just two queries to the quantum oracle for ff.

Typos? Please submit corrections to this page on GitHub.