Scribd
Upload
108 views2 pages

Quantum Computing: Exercise Sheet 2: Steven Herbert and Anuj Dawar

This document contains an exercise sheet on quantum computing concepts. It includes 13 problems related to quantum gates, quantum circuits, quantum algorithms like Deutsch-Jozsa and Grover's algorithms. Some of the problems involve showing properties of quantum gates, constructing gates from other standard gates, analyzing quantum protocols, and tracing the evolution of quantum states through circuits.

Uploaded by

Juan Diego
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
108 views2 pages

Quantum Computing: Exercise Sheet 2: Steven Herbert and Anuj Dawar

This document contains an exercise sheet on quantum computing concepts. It includes 13 problems related to quantum gates, quantum circuits, quantum algorithms like Deutsch-Jozsa and Grover's algorithms. Some of the problems involve showing properties of quantum gates, constructing gates from other standard gates, analyzing quantum protocols, and tracing the evolution of quantum states through circuits.

Uploaded by

Juan Diego
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Quantum Computing: Exercise Sheet 2

Steven Herbert and Anuj Dawar

1. Let j i = j00i + j01i + j10i + j11i. Show by explicitly expressing the tensor product
that:
(X
I )j
i = j10i + j11i + j00i + j01i
2. Let A and B be 2  2 matrices, and j i and ji be single qubit states (i.e., 2  1 element
vectors). Show that:
(A
B )(j i
ji) = (Aj i)
(B ji)
3. Show that a swap gate can be constructed from three CNOT gates.
4. Give the matrix form of the controlled-Hadamard gate. That is a two-qubit gate { let the
rst qubit be the control and the second be the target { if the rst (control) qubit equals
zero, then the second (target) qubit is unchanged; if the rst (control) qubit equals one, then
a Hadamard gate is performed on the second (target) qubit.
Hint: Look at the matrix form of the CNOT gate, in which the rst qubit controls a Pauli-X
(not) gate on the second qubit.
5. Show how the controlled-Not gate can be constructed from Hadamard gates and the controlled-
Z. Demonstrate that the construction is correct by multiplying the corresponding matrices.
6. Verify that the four Bell states ( p12 (j00i + j11i); p12 (j00i j11i); p12 (j01i + j10i); p12 (j01i j10i))
form an orthonormal basis for C4 .
7. Suppose that Eve intercepts the qubit transmitted by Alice in the superdense coding protocol.
Can she infer which of the four pairs of bits 00; 01; 10, or 11 Alice was trying to transmit? If
so, how? If not, why not?
8. Let Alice and Bob each have one qubit of a Bell pair ( p12 (j00i + j11i)); let Bob and Charlie
also each have one half of another Bell pair. If Bob uses the Bell pair he shares with Charlie,
to teleport his qubit from the Bell pair he (Bob) shares with Alice, show that the result is
that Alice and Charlie now share a Bell pair.
9. Alice and Bob are using the BB84 protocol, and Eve attempts the intercept, measure and
retransmit attach described in the lectures. If Alice and Bob compare a bit-string of length
n (i.e., from their shared channel) to determine whether they are being eavesdropped, what
is the probability that Eve's actions remain undetected?
10. Regarding the statements on Slides 14 and 15 of lecture 7, show that:
(a) The Unitary in the Deutsch-Jozsa algorithm indeed transforms:

j i=
X p1 jxi (j0i j1i) :
1
2f0 1gn 2
n
x ;

1
to:
j i=
X p1 ( 1) f (x)
jxi (j0i j1i) :
2
x2f0;1gn
2 n

(b) H
j0i
= p12n
P
2f0 1gn jxi,
P
n n
x ;

(c) H
jxi = p12n
n
z ;

2f0 1gn ( 1) jz i.
x z

11. Let n = 2 and


(a) f (x) = 0 if x is even or zero, and 1 otherwise,
(b) f (x) = 0 for all x.
For each case, work through the Deutsch-Jozsa algorithm explicitly, and show the probabilities
for each of the 2 = 4 possible measurements of the two qubits.
n

12. In Lecture 8 it was claimed that C 1 X (that is, a Pauli-X gate controlled by the \And" of
n

n 1 qubits) could be implemented eciently using To oli gates and some extra workspace
qubits. Show how C 1 X can be constructed from n 2 To oli gates and n 3 workspace
n

qubits (all in the state j0i).


13. Suppose we apply Grover's algorithm to a 3 qubit register, in which only the state j010i is
marked. What is the probability of measuring the marked state (j010i) after applying the
Grover iterate 0,1,2,3 times?

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy