Paper 3, Section I, 10D10 D

Quantum Information and Computation | Part II, 2019

Let BnB_{n} denote the set of all nn-bit strings and write N=2nN=2^{n}. Let II denote the identity operator on nn qubits and for G={x1,x2,,xk}BnG=\left\{x_{1}, x_{2}, \ldots, x_{k}\right\} \subset B_{n} introduce the nn-qubit operator

Q=HnI0HnIGQ=-H_{n} I_{0} H_{n} I_{G}

where Hn=HHH_{n}=H \otimes \ldots \otimes H is the Hadamard operation on each of the nn qubits, and I0I_{0} and IGI_{G} are given by

I0=I2000000IG=I2xGxxI_{0}=I-2|00 \ldots 0\rangle\left\langle 00 \ldots 0\left|\quad I_{G}=I-2 \sum_{x \in G}\right| x\right\rangle\langle x|

Also introduce the states

ψ0=1NxBnxψG=1kxGxψB=1NkxGx\left|\psi_{0}\right\rangle=\frac{1}{\sqrt{N}} \sum_{x \in B_{n}}|x\rangle \quad\left|\psi_{G}\right\rangle=\frac{1}{\sqrt{k}} \sum_{x \in G}|x\rangle \quad\left|\psi_{B}\right\rangle=\frac{1}{\sqrt{N-k}} \sum_{x \notin G}|x\rangle

Let P\mathcal{P} denote the real span of ψ0\left|\psi_{0}\right\rangle and ψG\left|\psi_{G}\right\rangle.

(a) Show that QQ maps P\mathcal{P} to itself, and derive a geometrical interpretation of the action of QQ on P\mathcal{P}, stating clearly any results from Euclidean geometry that you use.

(b) Let f:BnB1f: B_{n} \rightarrow B_{1} be the Boolean function such that f(x)=1f(x)=1 iff xGx \in G. Suppose that k=N/4k=N / 4. Show that we can obtain an xGx \in G with certainty by using just one application of the standard quantum oracle UfU_{f} for ff (together with other operations that are independent of ff ).

Typos? Please submit corrections to this page on GitHub.