This interdisciplinary course is an introduction to the exciting field of quantum cryptography. This course covers fundamental ideas of quantum cryptography, Cryptographic concepts and tools, security definitions, the min-entropy and privacy amplification. End of this course, students will be armed with a fundamental toolbox for understanding, designing and analyzing quantum protocols, understand how untrusted quantum devices can be tested and understand the quantum key distribution protocols.

**Assessment**

This course does not involve any written exams. Students need to answer 5 assignment questions to complete the course, the answers will be in the form of written work in pdf or word. Students can write the answers in their own time. Each answer needs to be 200 words (1 Page). Once the answers are submitted, the tutor will check and assess the work.

**Certification**

Edukite courses are free to study. To successfully complete a course you must submit all the assignment of the course as part of the assessment. Upon successful completion of a course, you can choose to make your achievement formal by obtaining your Certificate at a cost of £49.

Having an Official Edukite Certification is a great way to celebrate and share your success. You can:

- Add the certificate to your CV or resume and brighten up your career
- Show it to prove your success

Course Credit: TU Delft

### Course Curriculum

Module: 01 | |||

0.0 Introduction to A crash course on quantum information | 00:01:00 | ||

0.1.1 The qubit | 00:12:00 | ||

0.1.2 More than one qubit | 00:10:00 | ||

0.2.1 Combining qubits using the tensor product | 00:08:00 | ||

0.2.2 Examples: combining qubits using the tensor product | 00:06:00 | ||

0.3.1 Measuring qubits in the standard basis | 00:09:00 | ||

0.3.2 Measuring qubits in another basis | 00:08:00 | ||

0.3.3 Examples: measuring qubits | 00:07:00 | ||

0.4.1 Operations on qubits | 00:09:00 | ||

0.4.2 Examples: operations on qubits | 00:11:00 | ||

0.5.1 Why we cannot copy qubits | 00:06:00 | ||

0.6.1 The Bloch Sphere representation | 00:03:00 | ||

Module: 02 | |||

1.0.1 Introduction and Course overview | 00:12:00 | ||

1.1.1 The one time pad | 00:12:00 | ||

1.1.2 Example: the one time pad | 00:02:00 | ||

1.2.1 The density matrix | 00:18:00 | ||

1.2.2 Example: The density matrix | 00:07:00 | ||

1.2.3 The Bloch sphere representation of the density matrix | 00:05:00 | ||

1.3.1 Encrypting qubits with the quantum one-time pad | 00:15:00 | ||

1.3.2 Example: The quantum one-time pad | 00:06:00 | ||

1.4.1 Combining multiple qubits – tensor product of density matrices | 00:07:00 | ||

1.4.2 Example: tensor product of density matrices | 00:03:00 | ||

1.5.1 Classical-quantum states | 00:07:00 | ||

1.5.2 Example: Classical quantum states | 00:04:00 | ||

1.6.1 General measurements | 00:13:00 | ||

1.6.2 Example: measuring one out of two qubits | 00:08:00 | ||

1.7.1 The partial trace | 00:14:00 | ||

1.7.2 Example: tracing out a qubit | 00:07:00 | ||

Module: 03 | |||

2.1.1 Separable states, entangled states | 00:11:00 | ||

2.1.2 Example – Separable states, entangled states | 00:04:00 | ||

2.2.1 Purification | 00:06:00 | ||

2.2.2 Uhlmann’s theorem | 00:08:00 | ||

2.2.3 Example: applying Uhlmann’s theorem | 00:05:00 | ||

2.3.1 The Schmidt decomposition | 00:12:00 | ||

2.3.2 Uniqueness of the Schmidt decomposition | 00:07:00 | ||

2.4.1 Using entanglement to share a classical secret | 00:10:00 | ||

2.4.2 Sharing a quantum secret | 00:07:00 | ||

2.5.1 Looking ahead to quantum key distribution: verifying entanglement using a Bell experiment | 00:13:00 | ||

2.5.2 Example – Looking ahead to quantum key distribution: verifying entanglement using a Bell experiment | 00:07:00 | ||

2.6.1 Monogamy of Entanglement | 00:14:00 | ||

2.6.2 Playing CHSH with three players | 00:08:00 | ||

Module: 04 | |||

3.1.1 What it means to be ignorant: ideal case | 00:05:00 | ||

3.1.2 Example – What it means to be ignorant: ideal case | 00:04:00 | ||

3.2.1 Trace distance and its use in security definitions (operational interpretation) | 00:14:00 | ||

3.2.2 Example – Trace distance and its use in security definitions (operational interpretation) | 00:12:00 | ||

3.3.1 The (min)-entropy including the smooth min-entropy | 00:09:00 | ||

3.3.2 The (min)-entropy including the smooth min-entropy | 00:13:00 | ||

3.3.3 Example – The (min)-entropy including the smooth min-entropy | 00:06:00 | ||

3.4.1 Uncertainty principles: simple version BB84 | 00:11:00 | ||

3.4.2 Example – Uncertainty principles: simple version BB84 | 00:08:00 | ||

3.5.1 Extended UR principles: tripartite version | 00:11:00 | ||

3.5.2 Example – Extended UR principles: tripartite version | 00:05:00 | ||

Module: 05 | |||

4.1.1 Privacy amplification | 00:11:00 | ||

4.1.2 Amplifying a weak secret by taking parities | 00:08:00 | ||

4.2.1 Randomness extractors | 00:11:00 | ||

4.2.2 Example: A strong extractor against bit-fixing sources | 00:06:00 | ||

4.3.1 An extractor construction based on two-universal hash functions | 00:16:00 | ||

4.3.2 A family of two-universal hash functions | 00:05:00 | ||

4.4.1 The pretty good measurement | 00:13:00 | ||

4.4.2 The PGM in action | 00:04:00 | ||

4.5.1 A strong quantum-proof extractor | 00:10:00 | ||

4.5.2 The two-universal extractor in action | 00:05:00 | ||

Module: 06 | |||

5.1.1 Introduction to key distribution | 00:06:00 | ||

5.2.1 Key distribution over a special channel | 00:09:00 | ||

5.2.2 Key distribution with an storage limited eavesdropper | 00:04:00 | ||

5.3.1 The need for error correction | 00:07:00 | ||

5.4.1 Introduction to information reconciliation | 00:05:00 | ||

5.4.2 A simple protocol for information reconciliation | 00:10:00 | ||

Module: 07 | |||

6.1.1 Intro to QKD | 00:04:00 | ||

6.2.1 Definitions and concepts in QKD | 00:09:00 | ||

6.3.1 BB84 states and the six state protocol | 00:07:00 | ||

6.4.1 The BB84 protocol | 00:17:00 | ||

6.4.2 Security in BB84 | 00:05:00 | ||

6.5.1 Purifying protocols using entanglement | 00:10:00 | ||

6.5.2 Implementing a Bell basis measurement locally | 00:04:00 | ||

6.6.1 Security from a guessing game | 00:07:00 | ||

6.6.2 A concentration inequality | 00:04:00 | ||

6.7.1 Authentication | 00:12:00 | ||

Guest lecture: Nicolas Gisin | 00:09:00 | ||

Module: 08 | |||

7.1.1 Device-independent cryptography | 00:12:00 | ||

7.2.1 Testing entanglement using the CHSH game | 00:17:00 | ||

7.2.2 The GHZ game | 00:04:00 | ||

7.3.1 A protocol for device-independent QKD | 00:09:00 | ||

7.3.2 The CHSH guessing game | 00:07:00 | ||

7.4.1 Security against collective attacks | 00:10:00 | ||

7.4.2 A candidate attack on DIQKD | 00:07:00 | ||

7.5.1 Security against general attacks | 00:13:00 | ||

7.5.2 Playing games in parallel | 00:06:00 | ||

Module: 08 | |||

8.1.2 Secure function evaluation | 00:08:00 | ||

8.2.1 Oblivious transfer | 00:14:00 | ||

8.2.2 A quantum protocol for OT? | 00:07:00 | ||

8.3.1 Bit commitment | 00:07:00 | ||

8.4.1 Impossibility of bit commitment | 00:10:00 | ||

8.4.2 Computationally secure commitments | 00:06:00 | ||

8.5.1 Coin flipping | 00:14:00 | ||

8.5.2 Coin flipping over the phone | 00:05:00 | ||

Module: 10 | |||

9.1.1 How to evade impossibility | 00:19:00 | ||

9.1.2 Example Evading impossibility | 00:15:00 | ||

9.2.1 The noisy storage model | 00:05:00 | ||

9.2.2 Example The noisy storage model | 00:10:00 | ||

9.3.1 A protocol for oblivious transfer | 00:12:00 | ||

9.3.2 Example A simple protocol for 1-2 oblivious transfer in the noisy-storage model | 00:05:00 | ||

9.3.3 Example: continuation | 00:08:00 | ||

9.4.1 Security from quantum uncertainty | 00:20:00 | ||

9.5.1 Weak string erasure | 00:16:00 | ||

9.5.2 Security against Bob | 00:06:00 | ||

9.5.3 Security from quantum uncertainty | 00:05:00 | ||

Module: 11 | |||

10.1.1 Position-based cryptography | 00:10:00 | ||

10.1.2 A protocol for position-verification | 00:06:00 | ||

10.2.1 Quantum teleportation | 00:16:00 | ||

10.2.2 Example quantum teleportation | 00:06:00 | ||

10.2.3 An attack using entanglement | 00:11:00 | ||

10.2.4 Security of position verification | 00:11:00 | ||

10.3.1 Introduction to Quantum computing in the cloud | 00:11:00 | ||

10.4.1 Delegating quantum circuits | 00:19:00 | ||

10.4.2 Computing using magic states | 00:05:00 | ||

10.5.1 Delegation in the measurement-based model | 00:11:00 | ||

10.5.2 Hiding a Hadamard | 00:04:00 | ||

10.6.1 Delegating to multiple provers | 00:13:00 | ||

10.7.1 Conclusion | 00:03:00 | ||

Assessment | |||

Submit Your Assignment | 00:00:00 | ||

Certification | 00:00:00 |

### Course Reviews

No Reviews found for this course.

**587 STUDENTS ENROLLED**