Introduction to Quantum Computing Part 2 of 3 - IPAM at UCLA
Institute for Pure & Applied Mathematics (IPAM) via YouTube
Overview
Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Dive into the second part of a three-part lecture series on quantum computing, presented by Fang Song from Portland State University at IPAM's Graduate Summer School on Post-quantum and Quantum Cryptography. Explore two major families of quantum algorithms: period finding (also known as Hidden Subgroup Problem HSP) and Grover's search. Examine Simon's algorithm, phase estimation, and the renowned quantum factoring algorithm by Shor/Kitaev. Discover the impact of these algorithms on cryptography, including potential breaks of cryptosystems, superposition attacks, and quantum rewinding. Enhance your understanding with suggested readings from Watrous qc notes and Childs' notes. This hour-long lecture, recorded on July 26, 2022, offers an in-depth look at advanced quantum computing concepts and their implications for the field of cryptography.
Syllabus
Fang Song - Introduction to quantum computing Part 2 of 3 - IPAM at UCLA
Taught by
Institute for Pure & Applied Mathematics (IPAM)