Grover's Algorithm for SAT with Approximate 'p' - Lesson 59
Offered By: Ryan O'Donnell via YouTube
Course Description
Overview
Explore Grover's Algorithm for SAT in this 14-minute video lesson, part of the "Quantum Computer Programming in 100 Easy Lessons" series. Learn how to apply the algorithm when the fraction of satisfying input strings 'p' is known approximately. Discover why knowing 'p' almost exactly is sufficient for finding a satisfying assignment in roughly sqrt(1/p) steps. Delve into the process of removing the assumption of magically knowing 'p' precisely. Taught by Ryan O'Donnell from Carnegie Mellon University, this lesson offers valuable insights into quantum computing techniques and their practical applications.
Syllabus
#59/100: Grover when you know 'p' to within 1% || Quantum Computer Programming in 100 Easy Lessons
Taught by
Ryan O'Donnell
Related Courses
Understanding Quantum ComputersKeio University via FutureLearn Квантовые вычисления (Quantum computing)
Saint Petersburg State University via Coursera Quantum Information Science I, Part 2
Massachusetts Institute of Technology via edX The Introduction to Quantum Computing
Saint Petersburg State University via Coursera Quantum Computing
NPTEL via YouTube