CS计算机代考程序代写 algorithm MULT20015 Assignment 2 2021 final

MULT20015 Assignment 2 2021 final

MULT20015 Assignment 2, 2021

1

MULT20015 Elements of Quantum Computing

Assignment 2

Due: 5pm Thursday 14th October, 2021

Instructions: Work on your own, attempt all questions. Submit your completed written
work electronically as a pdf file (no other formats accepted) to LMS, with name and student
number on the front, on or before the due date. You may submit a scanned or photographed
copy of a hand-written assignment as long as your submission is clear and legible. Only
electronic submissions of PDF files are accepted.

Total marks = 30

Question 1 [2.0 + 2.0 = 4.0 marks]
The circuit (below left) carries out two-bit addition S = A + B with an addition carry bit (c),
where A = a0 + 2a1, B = b0 + 2b1 (ordering is a0 = least significant bit, a1 = most significant
bit etc) and the sum S is represented using 3 bits, i.e. S = s0 + 2s1 + 4s2:

(a) Explain how the circuit works by considering the system at each time-step for the case:
A = 3, B = 3 (decimal notation).

(b) Show how you would modify the circuit so that the bit ordering of A, B and S are reversed
(i.e. most significant bit last).

Question 2 [2.0 + (1.0 + 3.0 + 1.0) = 7.0 marks]
Consider the Deutsch-Josza algorithm for the case where the function f (x) is defined over 2-
bit numbers, x. In Lectures, the general circuit for function evaluation was given by:

a1
a0
b1
b0
c
s2
s1
s0

Uf
|yi

|xi

|y � f(x)i

|xi

MULT20015 Assignment 2, 2021

2

(a) Find circuits that correspond to each of the four function cases for the two-bit case
(tabulated below). Program these in the QUI (four separate instances) to verify. Supply screen
shots for each of the four cases.

𝑓!(00) = 0
𝑓!(01) = 0
𝑓!(10) = 0
𝑓!(11) = 0

𝑓”(00) = 0
𝑓”(01) = 1
𝑓”(10) = 0
𝑓”(11) = 1

CONSTANT BALANCED
𝑓#(00) = 1

𝑓#(01) = 1
𝑓#(10) = 1
𝑓#(11) = 1

𝑓$(00) = 1
𝑓$(01) = 0
𝑓$(10) = 0
𝑓$(11) = 1

(b) Now consider a different set of functions fi defined over two-qubit (n=2) inputs as:

Each function fi returns ‘1’ for only one of the possible two-bit/qubit inputs and ‘0’ for all
other input strings.

Consider you are provided an implementation (i.e. a program in either the classical or quantum
sense) for one of the functions fi where i is one of the 4 values from the set {1, 2, 3, 4},
the problem is to develop a classical and a quantum algorithm to determine i, i.e. which of
the functions is being evaluated.

(i) Describe a classical algorithm to solve the above problem. What is the elementary step?
What is the cost function (under worst-case scenario) as a function of input size n? Find Big-
O class from the cost function.

(ii) Devise a quantum algorithm to solve the above problem for n=2. Determine the quantum
circuit for each fi and explain carefully how they work. Implement the quantum circuits on
QUI and verify their working for all four functions fi tabulated above (include screen shots).

(iii) What is the elementary step in your quantum implementation? For n=2, how many
elementary steps are required to find i. Plot a graph of number of function queries required
as a function of n. Find the cost and complexity class.

MULT20015 Assignment 2, 2021

3

Question 3 [1.0 + (1.0 + 1.0) = 3.0 marks]

(a) Alice chooses the two primes to construct her RSA keys:

p = 2881309652927113715947711

and

q = 14323296331779246294235011689.

Determine the smallest valid RSA public key and its corresponding private key for Alice. Show
your workings with an explanation justifying your answer.

(b) An experiment attempts to factor 511 using Shor’s algorithm on a quantum computer.
The experimenters choose a base of a = 3, and attempt to find the period, r, such that ar
= 1 mod 511. After performing Shor’s algorithm, the upper control register, containing n =
18 qubits is measured and the value m = 1001010101010101012 is obtained.

(i) Based on this measured value, use the continued fraction expansion to find candidate
periods, r. For each candidate period, r, test to determine if ar = 1 mod 511 or not. Show
your working.

(ii) Use the period, r, obtained in part (i) to find the factors of 511. Show your working.

Question 4 [1.0 + 3.0 + 2.0 + 2.0 + 1.0 = 9.0 marks]

(a) On the QUI, program a x-rotation gate with a rotation angle of #%


and a global phase of

%

directly on a |ψ⟩ = |−⟩ = (|0⟩ − |1⟩)/√2 state. What is the resulting state (including phase)
when this rotation is applied to the |−⟩ state? Show that |−⟩ is an eigenstate of this rotation.
Include your circuit in your answer.

(b) Construct the Quantum Phase Estimation (QPE) circuit described in the lectures, which
could be used to estimate the eigenvalue of the eigenstate, |ψ⟩ = |−⟩ for a x-rotation gate,
with a rotation angle of #%


(with a global phase of %


). Use four qubits in the control (upper)

register.

You may make use of the following (inverse) quantum Fourier Transform for four qubits:

MULT20015 Assignment 2, 2021

4

The angles of the controlled-Z rotations shown (in order, from left to right) are:
I. −𝜋/2 (with a global phase of −π/4)
II. −𝜋/4 (with a global phase of −π/8)
III. −𝜋/2 (with a global phase of −π/4)
IV. −𝜋/8 (with a global phase of −π/16)
V. −𝜋/4 (with a global phase of −π/8)
VI. −𝜋/2 (with a global phase of −π/4)

Include a screenshot of your circuit in your answer.

(c) Determine (using QUI) the probabilities of the resulting measurements (on the control/upper
register). Recall that if

𝑈|ψ⟩ = exp(𝑖2πθ) |ψ⟩,

then QPE allows us to estimate θ using a quantum computer. Use these measurements for
the QPE circuit with U=Rx(2𝜋/3) (with a global phase of

%

) and |ψ⟩ = |−⟩ to estimate θ, and

briefly compare you estimates of θ with your answer in part (a). Why are they not identical?

(d) Modify your circuit and repeat steps above to determine the phase angle, θ, for U=Rx(2𝜋/5)
with a global phase of 𝜋/5 applied to the state |ψ⟩ = |−⟩.

(e) Briefly explain what could you do to obtain a better estimate of θ?

Question 5 (2.0 + 2.0 + 3.0 = 7.0 marks)

The first few triangular numbers, 𝑇& = 𝑛(𝑛 + 1)/2, are 1, 3, 6, 10 and 15.

(a) Write out the circuit for an oracle of five qubits which marks (ie. applies a -1 phase to)
each of the states if it is a triangular number. You may use multiply controlled gates.
Implement the oracle on the QUI and verify its working for all triangular numbers over five
qubits (include screen shots).

(b) On the QUI (set to 5 qubits), program this oracle into Grover’s algorithm. Apply enough
Grover iterations (consisting of oracle and inversion about the mean) to optimize the probability
of measuring a triangular number. Determine the angle of rotation in the geometrical picture
and show that it is consistent with the optimal number of iterations found in QUI.

(c) If you used Grover’s algorithm to find a random triangular number less than or equal to
127 (commensurate with 7 qubits), approximately how many iterations (consisting of oracle
and inversion about the mean) should you use to ensure a high probability of success? Show
your working.