[go: up one dir, main page]

0% found this document useful (0 votes)
40 views4 pages

Quantum Algorithms and Cryptography - Unit 14 - Week 12

The document outlines the Week 12 assignment for the Quantum Algorithms and Cryptography course, detailing various questions related to quantum gates, encryption randomness, and Trapdoor Claw-Free Functions. It includes multiple-choice questions with correct answers and scores for each question. The assignment submission deadline was April 16, 2025, and the document provides a framework for understanding key concepts in quantum cryptography.

Uploaded by

Kay Zero
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
0% found this document useful (0 votes)
40 views4 pages

Quantum Algorithms and Cryptography - Unit 14 - Week 12

The document outlines the Week 12 assignment for the Quantum Algorithms and Cryptography course, detailing various questions related to quantum gates, encryption randomness, and Trapdoor Claw-Free Functions. It includes multiple-choice questions with correct answers and scores for each question. The assignment submission deadline was April 16, 2025, and the document provides a framework for understanding key concepts in quantum cryptography.

Uploaded by

Kay Zero
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/ 4

Quantum Algorithms and Cryptography - - Unit 14 - Week 12 file:///home/linux/Downloads/Quantum%20Algorithms%20...

(https://swayam.gov.in) (https://swayam.gov.in/nc_details/NPTEL)

farhaankhan0860@gmail.com 

NPTEL (https://swayam.gov.in/explorer?ncCode=NPTEL) » Quantum Algorithms and Cryptography (course)


Click to register
for Certification
exam (https://
Week 12: Assignment 12
examform.nptel.ac.in/2025_01/
exam_form/ The due date for submitting this assignment has passed.
dashboard) Due on 2025-04-16, 23:59 IST.

If already Assignment submitted on 2025-04-16, 21:55 IST


registered, click 1) Which of the following quantum gates are universal? 1 point
to check your
payment status Clifford and Tofolli Gate
Tofolli Gate
Clifford Gate
Course Clifford and CNOT gate
outline
No, the answer is incorrect.
Score: 0
About NPTEL Accepted Answers:
() Clifford and Tofolli Gate

2) Which of the following is/are true with respect to encryption randomness (a, b) in 1 point
How does an
Quantum Public Key Encryption?
NPTEL online
course work?
It is encrypted using Quantum One time Pad scheme.
()
It is encrypted using a classical quantum-secure Public Key Encryption scheme.
Week 1 () It is not encrypted.
It is encrypted using a classical quantum-secure Private key Encryption scheme.
Week 2 ()
No, the answer is incorrect.
Score: 0
Week 3 ()
Accepted Answers:
It is encrypted using a classical quantum-secure Public Key Encryption scheme.

1 of 4 4/25/25, 9:57 PM
Quantum Algorithms and Cryptography - - Unit 14 - Week 12 file:///home/linux/Downloads/Quantum%20Algorithms%20...

3) In the IND-CPA security proof of the Quantum Public Key Encryption scheme (QPKE), 1 point
Week 4 ()
who chooses the encryption randomness (a, b) ?

Week 5 () Challenger of classical quantum-secure Public Key Encryption.


Adversary of QPKE.
Week 6 ()
Challenger of QPKE.
Week 7 () None of the above.

Yes, the answer is correct.


Week 8 () Score: 1
Accepted Answers:
Week 9 () Challenger of QPKE.

4) Let Π be the classical quantum-secure public key encryption scheme with public key pk 1 point
Week 10 ()
and QOTP be the Quantum One time pad. What is the ciphertext of quantum public key encryption
when mixed state ρ is encrypted with encryption randomness (a, b) as in the real-world?
Week 11 ()

Week 12 () QOTP(a, b, ρ), Π. Encrypt(pk, (a, b))

Quantum PKE QOTP(0, 0, ρ), Π. Encrypt(pk, (a, b))


and FHE - Part
1 (unit? QOTP(a, b, ρ), Π. Encrypt(pk, (0, 0))
unit=81&lesso
n=82) QOTP(a, b, ρ), Π. Encrypt(pk, ρ)
Quantum PKE Yes, the answer is correct.
and FHE - Part Score: 1
2 (unit? Accepted Answers:
unit=81&lesso QOTP(a, b, ρ), Π. Encrypt(pk, (a, b))
n=83)
5) Let f0 , f1 be a Trapdoor Claw-Free Function (TCF) pair. Let s be a hidden bit 1 point
Quantum PKE associated with (f0 , f1 ) such that (f0 , f1 ) is encryption of s , then which of the following is correct?
and FHE: Part
3 (unit?
unit=81&lesso For all (x0 , x1 ) such that f0 (x0 ) = f1 (x1 ), x0 [1] ⊕ x1 [1] = s
n=84)
For all (x0 , x1 ) such that f0 (x0 ) = f1 (x1 ), x0 [1] ⊕ x1 [1] = 1 − s
Quantum PKE
and FHE: Part
For all (x0 , x1 ) such that f0 (x0 ) = f1 (x1 ), x0 [1] ⊕ x1 [1] = 0
4 (unit?
unit=81&lesso
n=85) For all (x0 , x1 ) such that f0 (x0 ) = f1 (x1 ), x0 [1] ⊕ x1 [1] = 1

Quantum PKE Yes, the answer is correct.


Score: 1
and FHE: Part
Accepted Answers:
5 (unit?
unit=81&lesso For all (x0 , x1 ) such that f0 (x0 ) = f1 (x1 ), x0 [1] ⊕ x1 [1] = s
n=86) Questions 6 and 7 are based on the following setup. The property of Clifford gate C is:
′ ′
Week 12 For all (x, z) , there exists (x′ , z ′ ) s.t. ∀ |ψ⟩ , C X x Z z |ψ⟩ = X x Z z C|ψ⟩
Feedback
6) If the value of x′ = 1 ⊕ x and z ′ = z , then which of the following C is being used? 1 point
Form:Quantu
m Algorithms

2 of 4 4/25/25, 9:57 PM
Quantum Algorithms and Cryptography - - Unit 14 - Week 12 file:///home/linux/Downloads/Quantum%20Algorithms%20...

and H
Cryptography!!
(unit? X
unit=81&lesso
Z
n=99)
None of the above
Quiz: Week
No, the answer is incorrect.
12: Score: 0
Assignment
Accepted Answers:
12 X
(assessment?
7) If the value of x′ = x and z ′ = 1 ⊕ z , then which of the following C is being used? 1 point
name=138)

Week 12:
Lecture H
Materials
X
(unit?
unit=81&lesso Z
n=143) None of the above
Download No, the answer is incorrect.
Videos () Score: 0
Accepted Answers:
Text Z
Transcript () 8) Which of the following is/are true with respect to the Trapdoor Claw-Free (TCF) Pair? 1 point

TCF is a pair of functions f0 , f1 such that it is hard to find a claw i.e. (x0 , x1 ) such that
f0 (x0 ) = f1 (x1 ).

Quantum systems are capable of creating and maintaining a superposition state involving a pair
(x0 , x1 ), but they are unable to output both elements of the pair simultaneously.

f0 is injective function and f1 is surjective function.

In TCF, we can find a claw efficiently given a trapdoor for any y ∈ R where R is the range of
the function.

Yes, the answer is correct.


Score: 1
Accepted Answers:
TCF is a pair of functions f0 , f1 such that it is hard to find a claw i.e. (x0 , x1 ) such that
f0 (x0 ) = f1 (x1 ).
Quantum systems are capable of creating and maintaining a superposition state involving a pair
(x0 , x1 ), but they are unable to output both elements of the pair simultaneously.
In TCF, we can find a claw efficiently given a trapdoor for any y ∈ R where R is the range of the
function.

9) Given a quantum one-time pad state σ = X x Z z ρ(X x Z z )† where both x and z are 1 point
random and encrypted in the classical Homomorphic Encryption scheme. What is the output if we
apply a Clifford C to the encrypted state σ ?

3 of 4 4/25/25, 9:57 PM
Quantum Algorithms and Cryptography - - Unit 14 - Week 12 file:///home/linux/Downloads/Quantum%20Algorithms%20...

C X x Z z ρ(X x Z z )† C

C X x Z z ρ(X x Z z )† C †

C † X x Z z ρ(X x Z z )† C

C † X x Z z ρ(X x Z z )† C †
Yes, the answer is correct.
Score: 1
Accepted Answers:
C X x Z z ρ(X x Z z )† C †
10) Let f0 , f1 be a Trapdoor Claw-Free Function (TCF) pair such that 1 point
f0 (x0 ) = f1 (x1 ) = y. Which of the following is the correct representation of superposition over the
claw (x0 , x1 )?

1
((|0, x1 ⟩ + |1, x0 ⟩) ⊗ y)
√2

1
((|0, x0 ⟩ + |1, x0 ⟩) ⊗ y)
√2

1
((|0, x1 ⟩ + |1, x1 ⟩) ⊗ y)
√2

1
((|0, x0 ⟩ + |1, x1 ⟩) ⊗ y)
√2

Yes, the answer is correct.


Score: 1
Accepted Answers:
1
√2
((|0, x0 ⟩ + |1, x1 ⟩) ⊗ y)

4 of 4 4/25/25, 9:57 PM

You might also like