Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Quantum Computation and Information Security

via YouTube

Overview

This course covers the following learning outcomes and goals: understanding the basics of quantum computation and its applications in information security, exploring the principles of quantum bits (qubits) and their complex states, learning about quantum key distribution and its role in secure communication, and gaining insights into Shor's algorithm for factoring large numbers efficiently. The course teaches individual skills such as RSA encryption, factoring numbers using quantum algorithms, quantum key distribution techniques, and the experimental demonstration of qubits. Additionally, it covers concepts like Schrodinger's Cat, qubit states, polarized light representation of bits, and the differences between classical and quantum computers. The teaching method of the course involves a combination of theoretical explanations, practical demonstrations, and thought experiments to illustrate complex concepts in quantum computation and information security. The intended audience for this course includes individuals interested in cryptography, quantum computing, information security, and those looking to deepen their understanding of advanced computational concepts.

Syllabus

Intro
Secure Communication
RSA encryption Ron Rivest, Adi Shamir, and Leonard Adleman - Choose two prime numbers and multiply
How hard is factoring?
Thought experiment: Schrodinger's Cat
1 hour later, the cat is 50% dead
50% alive, 50% dead
Introducing the quantum bit (qubit)
A Qubit is in a complex state, with infinite possibilities
Building a Qubit
Aside on cryptography • Alice and Bob want to communicate
Polarizing Light
Represent Bits as Polarized Light
Measuring Photons
Quantum Key Distribution
What about eavesdropping?
Key Validation
Classical computers can be built from NAND gates only
Quantum Computers can be built from CNOT gates and single-qubit operators
Experimental demonstration of 2 qubits
Factoring N=15: Construct a function
Factoring N=15: Find the period
Factoring N=15: Apply QFT
Factor 15: Find the factors
How fast is Shor's algorithm?
Summary

Reviews

Start your review of Quantum Computation and Information Security

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.