Overview
Dive into the ninth installment of Dr. Kitty Yeung's Quantum Computing series, focusing on Shor's Algorithm. Explore the intricacies of this groundbreaking quantum algorithm, including its application in factoring large numbers and its potential to revolutionize cryptography. Learn about the number of qubits required, common divisors, and the role of quantum oracles. Gain insights into the measurement process, circuit implementations for both short and large numbers, and the Quantum Fourier Transform (QFT). Discover how Q# programming language is utilized in quantum computing applications. This comprehensive lecture provides a deep understanding of Shor's Algorithm and its significance in the field of quantum computing.
Syllabus
Introduction
How many qubits
Common Divider
Quantum Computing
Quantum Graphics
Oracles
References
Measurement
Circuit for Short
Circuit for Large Numbers
QFT
QSharp
Taught by
HACKADAY