Quantum Computing and Impact On Public Key Encryption - Prof Alan Woodward

Overview

Explore the implications of quantum computing on public key encryption in this comprehensive 55-minute lecture by Prof Alan Woodward. Delve into the evolution of computing, from early logic gates to modern microprocessors, and understand the limitations of classical computing. Examine quantum principles, including Schrödinger's equation, uncertainty, and entanglement, before diving into the fundamentals of quantum computing, such as qubits, superposition, and quantum gates. Investigate various qubit implementations, including ion traps, optical qubits, and Josephson junctions. Analyze Peter Shor's groundbreaking quantum algorithm and its potential to revolutionize factoring, with practical demonstrations using the Quantum Playground. Gain insights into the future of cryptography and the challenges posed by quantum computing to current encryption methods.

Syllabus

Structure For Lecture
Home Computer: 1950's Style
Classical Logic Gates
Switches To Build Logic Gates
Logic Gates On A Single Chip
The Microprocessor Is Born
What Is The Limit For Transistors?
Reaching The Limit
Ultradense Chips
Algorithms Are The Problem
Travelling Salesman Problem
Schrodinger's Equation
Uncertainty
Entanglement
So Recap: Quantum Principles Behind Quantum Computing
The Qubit Is Born
Superposition Of Qubits
Quantum vs Classical Gates
Hadamard Gate
Controlled Not Gate
Controlled Controlled Not (CCN) Gate
Library of Quantum Gates
Languages for expressing logical quantum circuits
Linear lon Trap
lon Trap On A Chip
Optical Qubits
Programmable Optical Chips
Configurable Optical Circuits
Josephson Junctions
Charge Qubits
IBM's Latest 5 Qubit Processor
Let's Play Four Card Monte
Under The Hood
Peter Shor: His "Quantum" Alghorithm
Euler 1760
Reducing Factoring To Order Finding
Factor 15
Order Finding - The Result
Continued Fractions
Quantifying The Speedup
Quantum Playground: Explore Shor For Yourself
An Inconvenient Truth