HE 384: Quantum Computation Final Exam Date: 24 June 2020 ‘Total marks: 50 Ne TE: (1) The suggested time for the exam is 4 hours, including scanning and uploading your answers. (2) Calculations in the problems below can be simplified by making specific choices. Clearly describe and justify the choices that you make. 1 . Consider a quantum register where interact (a) Construct a reversible Boolean logic circuit for a Fredkin gate from Toffoli gates. Simplify some of the Toffoli gates to C-NOT gates, if you can. (b) Show that the following pair of quantum logic circuits are eq) unitary operator generated by it as an 8 x 8 matrix. ofp ost alent. Find the (343 marks) Find the Schmidt decomposition of the two-qubit state, |) = (10) + |2)) @ (0.4]0) + 0.3]1)) + (JO) — |2)) @ (0.3]0) + 0.4]1)) What is the von Neumann entropy of the one-qubit reduced state? (4 marks) . Consider the two-qubit interaction Hamiltonian H = aoz @ oz + boy @ oy. (a) Find its eigenvalues and eigenvectors. Are the eigenvectors entangled, and to what extent? (b) Can it be used to construct the C-NOT operation? Can it be used to constrnct the SWAP operation? Explain under what condition and why. (342 marks) ns are possible only between nearest neighbours. Given C-NOT gates between all adjacent qubits, construct a circuit for a. O-NOT gate between qubits distance d > 1 apart. (There are no ancilla qubits available, and all the intervening qubits must return to their original states at the end.) How many nearest neighbour C-NOT gates are needed as a function of d? Optimise. (4 marks) . A computational problem is said to be in the class NC*, if the result f(x) can be computed in time O((log [r)*) on a multi-processor computer, while the total number of operations remain polynomial in the input size [2|, ic. number of bits in x. Show that counting the mumber of 1’s ina binary word a € {0,1} is an NC? problem, Hint: You may use one-bit adder as a unit of counting. (4 marks) . Consider the state |y)) = Jp(|01) — |10)) in the four-dimensional Hilbert space. (a) Find (J @U)|), where U is a general 2 x 2 matrix with det(U) = 1. (b) Bvaluate discrete Fourier transform of |¢)) in the four-dimensional space. Compare it with the case, where two-dimensional discrete Fourier transform is carried out on each qubit. Explain the difference. (243 marks) (P.7.0.)7, Grover’s algorithm reaches the target state with probability close to one using oracle calls Q ~ VN. Suppose one stops the algorithm earlier, when the success probability is p <1, and compensates that by repeating the algorithm 1/p times. What will be the total query complexity? Optimise it to find the best stage to stop the algorithm, Le. find Qbest and prea (4 marks) 8. Consider Wigner functions of qubits in the basis labeled by 0. and a eigenvelues. (a) A general single qubit mixed state has the Bloch representation, p = $(I + 9"- 2) with [7] <1. Find the region of the Bloch sphere such that each element of its Wigner function is positive. (b) For a two qubit pure state, express the singlet state constraint (#(!) + 4) = 0, in terms of the elements of the Wigner function. Is it possible to assign non-negative values to all the elements? Explain, (3+3 marks) 9. Consider Steane’s error correcting code where one logical qubit is encoded among seven physical qubits according to: {0) = (0000000) + j1010101) + Jo110011) + {1100110} + (0001111) + {1011020) +- 0111100) + |1101001))/v8 1) = (11111112) + Jo101010) + {1001100} + 0011001) + 1110000) + Jo100101) + |1000011) + jo010110))/VB (a) What is the Hamming distance of this code? How many quantum errors can it detect? How many quantum errors can it correct? (b) Let My = XaXXoX7, Mz = XyXgXeX7, Mg = XiXgX5X7, X = [Ty Ki. Note that M? Show that 0) = (1--Mi)(14+-Ma)(1+-Ms)10)"7/ VB, |T) = (1+ Mi)(14+-Ma)(1-4+-Ms)X|0)® /VB. (c) Construct an encoding circuit for this code, ie. transform (al0) + 6|1))|0)® to (a|0) + 6/T)) using H and C-NOT gates. Hint: First find the circuit that converts |0)|g) to (J +X @ U)|0)|d)/v2. (a) This is a stabiliser code. How many elements does the stabiliser group have? List the generators of the stabiliser group. (e) This is a transverse code, i.e. uniform operations on physical qubits produce the same operation on the logical qubit. In particular, show that Ral Xo ZT Ze ATE te _ Hint: It helps to consider the action of stabiliser generators on 77, (142444243 marks)