Foundational Quantum Algorithms Part I: Deutsch’s and Grover’s Algorithms: John Watrous | QGSS 2025
This course explores computational advantages of quantum information, including what we can do with quantum computers and their advantages over classical computers. It begins with quantum query algorithms, which offer simple proof of concept demonstrations for quantum algorithms, and then moves on to quantum algorithms for problems including integer factorization and unstructured search.
▶︎
Foundational Quantum Algorithms Part II : John Watrous | QGSS 2025
▶︎
But what is quantum computing? (Grover's Algorithm)
▶︎
Petros Wallden, "Evaluating and Verifying Quantum Computations", Annual Conference 2026
▶︎
Scott Aaronson - The TRUTH About Quantum Computing
▶︎
Where my explanation of Grover’s algorithm failed
▶︎
Why Both AI and Quantum Physics Rely on This Formula
▶︎
A Visual Introduction to Grover's Algorithm and Reflections
▶︎
Why I Left Quantum Computing Research
▶︎
Meet the Mind: The Brain Behind Shor’s Algorithm
▶︎
The most beautiful formula not enough people understand
▶︎
Basics of Quantum Error Correction I: Correcting Errors with the Shor code: John Watrous | QGSS 2025
▶︎
Quantum Query Algorithms | Understanding Quantum Information & Computation | Lesson 05
▶︎
Why Building AI Data Centres Isn’t Working Anymore
▶︎
Towards Fault-Tolerant Quantum Computing :Patrick Rall | QGSS 2025
▶︎
The Strange Math That Predicts (Almost) Anything
▶︎
Grover's Algorithm | Understanding Quantum Information & Computation | Lesson 08
▶︎
The Hardest Questions in Physics | World Science Festival
▶︎
Deutsch's Algorithm | How Quantum Computers ACTUALLY Solve Problems Faster
▶︎
Astrophysicists Try to Resolve the Wave-Particle Duality
▶︎