Assignment2 - Quantum Mechanic and Quantum Computing
Assignment2 - Quantum Mechanic and Quantum Computing
AIMS 2024
1. If we use the (quantum) computer scientists’ notation for Pauli matrices, i.e.
ˆ ˙ ˆ ˙ ˆ ˙
0 1 1 0 0 ´i
X“ , Z“ , Y “
1 0 0 ´1 i 0
prove the following elementary circuit identities by considering the possible inputs and outputs:
X Y X “ ´Y
and
‚ Z
=
H ‚ H
[6 marks]
2. Again, by considering all the possible inputs (or otherwise!) show that
H ‚ H
=
‚ H H
[8 marks]
3. By considering all the possible inputs show that the CCNOT (Toffoli) gate can implement the logical
AND gate with three inputs, including an ancilla |0y into which the output is written, as in the circuit below.
[6 marks]
4. The Quantum Fourier Transform (QFT) plays an important role in several quantum algorithms. If a
state |ψy is given by
Nÿ´1
|ψy “ aj |jy
j“0
In these sums N “ 2n if we have n qubits. The circuit below implements a QFT on two qubits. Consider
the input |01y (it works for the other possible inputs too) and evaluate the output:
H R2 ˆ
‚ H ˆ
In the circuit H is the standard Hadamard gate and R2 is a controlled Rn gate with n “ 2. This means it
implements ˆ ˙
1 0
0 expp2πi{2n q
on the first register when the second register is |1y, otherwise it does nothing. The final vertical wire reverses
the order of the two qubits.
[8 marks]