Scribd
Upload
84 views2 pages

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

This document contains an exercise sheet on quantum computing concepts including: 1) Expressing controlled-Rn and controlled-Rny matrices and showing their inverse relationship. 2) Analyzing the state and measurement outcomes of the quantum phase estimation algorithm. 3) Showing that permutation matrices are unitary. 4) Working through Shor's algorithm to factor 21 and describing eigenvectors and eigenvalues.

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
84 views2 pages

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

This document contains an exercise sheet on quantum computing concepts including: 1) Expressing controlled-Rn and controlled-Rny matrices and showing their inverse relationship. 2) Analyzing the state and measurement outcomes of the quantum phase estimation algorithm. 3) Showing that permutation matrices are unitary. 4) Working through Shor's algorithm to factor 21 and describing eigenvectors and eigenvalues.

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 3

Steven Herbert and Anuj Dawar

1. Express controlled-Rn and controlled-Rny , as de ned in lecture 9, in matrix form { and show
that the latter is indeed the inverse of the former.
2. (a) What is the stateafter the  controlled-unitary stage of the QPE algorithm estimating the
1 1
phase of unitary p12 1 1 , with three qubits in the rst register, and the second register
 
initialised in the state j0i = 10 ?
(b) What will the measurement outcomes be after the inverse QFT stage of the QPE algo-
rithm?
3. Show that permutation matrices are unitary.
4. This question concerns using Shor's algorithm to factor the number 21.
(a) Step through Shor's algorithm on Slide 8 of lecture 10 with N = 21. Verify that 21 is
neither even nor a prime power, and then use x = 10 for step 3 { nd the order of 10 mod 21
and use this to factor 21.
(b) Say we were to run Shor's algorithm in full with x = 10, and were to measure the phase
corresponding to the eigenvector u1 (as de ned on Slide 14), express this eigenvector (in full,
not as abbreviated by a sum) and its eigenvalue.
5. What would happen if we could only approximately prepare the state j1i as the input to the
second register in Shor's algorithm?
6. (a) Show that, as claimed in lecture 11:
e i(H1+H2)t = e iH1te iH2t + O(t2)
(b) Show that we can obtain a more accurate simulation if, to estimate e i(H1+H2)t, we
instead use: iH t=2 iH t iH t=2
e 1 e 2 e 1

7. If we are performing quantum chemistry on a n-qubit Hamiltonian, and we prepare the input
to the second register as a uniform superposition of all eigenvectors, what is the probability
that QPE gives us the ground-state phase?
8. The matrices de ning probabilistic automata, as de ned on Slide 7 of lecture 12, have the
property that the entries in each column add up to 1. Prove that this property is preserved
under matrix multiplication.
9. (a) What is the language accepted by the quantum automaton described on Slide 8 of lecture
12?
1
(b) Prove that there is no two-state probabilistic automaton with this behaviour.
(c) Describe a probabilistic automaton (with more than two states) that exhibits this be-
haviour.
10. Consider a quantum nite automaton with two basis states, j0i being the start state and j1i
the only accepting state. The automaton operates on a two letter alphabet, with matrices:
   
1 1 1
Ma = p 1 1 ; Mb = 0 1 1 0
2
Give a complete description of the probabilities of acceptance associated with various possible
input strings.
11. Suppose M is a quantum Turing machine that accepts a language L in the bounded probability
sense: for each string w 2 L, there is a probability > 32 that M is observed in an accepting
state after reading w and for each string w 62 L, there is a probability < 13 that M is observed
in an accepting state after reading w. We de ne a new machine M0 that, on input w makes
three independent runs of M on input w and decides acceptance by majority. What is the
probability that M0 accepts w 2 L? What about w 62 L?
12. (Optional) It can be proven that entanglement is necessary for exponential speed-ups. Give
a sketch of a proof of this, by showing that an initial product state, which undergoes a circuit
consisting of gates which always output a product state when a product state is input, can
be simulated on a classical computer with only a polynomial overhead in the number of
computations.

You might also like