X

([Link] ([Link]

parthimitit@[Link] 

NPTEL ([Link] » Introduction to Quantum Computing: Quantum

Algorithms and Qiskit (course)


Click to register
for Certification
exam
Week 3 : Assignment 3
([Link]
Assignment not submitted Due date: 2025-08-13, 23:59 IST.

If already 1) Which of these operations do we expect a quantum computer to solve 2 points

registered, click exponentially faster asymptotically than a classical computer?
to check your
payment status given an oracle to a function f which is guaranteed to be constant or balanced, figure out
deterministically with probability 1 whether it is constant or balanced.

given an oracle to a function f which is guaranteed to be of the form f (x) = a. x for some
Course a, find that a.
outline prime factorization of a number which is a product of two primes
search over unstructured databases
About
NPTEL () 2) Consider a 3-qubit Grover’s algorithm. If the oracle flips the sign of |101⟩ . What is 2 points
the initial angle θ0 before you apply any Grover iteration?
How does an
NPTEL
π

online 4

course
3π
work? () 4

1
Week 1 () sin
−1
( )
2√ 2

Week 2 () cos
−1
(
1
)
2√ 2

Week 3 ()
3) Consider the previous problem (question 2). What will be the probability that we 2 points
Quantum successfully find the state |101⟩ after two iterations?
Algorithms:
Deutsch Jozsa
0.35
Algorithm 0.5
(unit? 0.88
unit=36&lesso
n=37)
0.97

Quantum 4) How many queries are required for a classical computer to certainly determine if 2 points
Algorithms: an n-bit function is constant or balanced?
Bernstein
Vazirani n
Algorithm
n
(unit? + 1
2
unit=36&lesso
n=38) 1

Quantum n−1
2 + 1
Algorithms:
Grovers
5) What is the number of queries required to determine the hidden bit string a in the 2 points
Search (unit?
Bernstein-Vazirani algorithm, where the oracle computes the function.
unit=36&lesso
n=39)
fa (x) = (a. x) mod 2.
Grover's
Algorithm Exactly one
Programming
(unit? log2 n
unit=36&lesso
n=40) n

−
Week 3: √n

Lecture notes
(unit? 6) Choose the correct circuit equalities. 2 points
unit=36&lesso
n=41)

Quiz: Week 3
: Assignment
3
(assessment?
name=79)

Download
Videos ()

7) In the Deutsch-Jozsa algorithm, what final measurement outcome indicates that 2 points
the function is balanced?

⊗
|0⟩ n

Any output other than |0⟩⊗ n

⊗
|1⟩ n

Uniform superposition of all states

8) How many oracle calls are needed in the Deutsch-Jozsa algorithm to determine 2 points
whether a function is constant or balanced (in the best case)?

n
 n
2

n logn

9) If the search space size is N = 2

n
, how many times should Grover’s operator be 2 points
applied to maximize the probability of success?

N
O(2 )

O(N )

O(logN )

−−
O(√ N )

10) Suppose the following circuit represents the Bernstein-Vazirani Oracle with 2 points

f (x) = (a. x) mod 2.

Find the correct choice of a.

1010
0101
1110
0001

You may submit any number of times before the due date. The final submission will be
considered for grading.
Submit Answers