Quantum Computation (Caltech PHYS 219)
Prof. John Preskill, Caltech
32 courses · 9 tutorials
Prof. John Preskill, Caltech
John Watrous
Delft University of Technology (QuTech)
Delft University of Technology (QuTech)
MIT xPRO
Prof. Isaac Chuang and Prof. Peter Shor, MIT
IBM Quantum / Qiskit Team
Xanadu
Delft University of Technology (QuTech)
Delft University of Technology (QuTech)
Microsoft Quantum
MIT Physics Department
Dept of Computer Science, University of Oxford
Qubit by Qubit instructors (Stanford PhDs)
Prof. Elias Fernandez-Combarro Alvarez, University of Oviedo
Delft University of Technology (QuTech)
Delft University of Technology (QuTech)
IBM Quantum
IBM Quantum Community
Microsoft Learn
Prof. Peter Shor, MIT
IBM Quantum / Qiskit Community
University of Cambridge / Isaac Physics
Keio University / Rodney Van Meter
MIT xPRO / Isaac Chuang, William Oliver, Peter Shor, Aram Harrow
Munich Quantum Valley / TU Munich / LMU Munich
Packt
Purdue University
Saint Petersburg State University / Sergey Sysoev
Prof. Will Zeng, Stanford
Microsoft
IonQ Researchers
How Grover's algorithm searches an unsorted database in √N steps, and why that matters for cryptography and optimization.
A conceptual guide to how quantum algorithms actually work: using superposition to explore many paths, interference to amplify correct answers, and measurement to extract results.
Understand the structure of quantum algorithms through state preparation, oracles, interference, and measurement, using Deutsch's algorithm as the clearest possible example.
Implement the Quantum Phase Estimation algorithm in Q# to estimate eigenvalues of unitary operators, with a worked example using the T gate.
Learn how the Deutsch-Jozsa algorithm solves in a single query a problem that requires exponentially many classical queries, and implement both constant and balanced oracles in Qiskit.
How Shor's algorithm breaks RSA encryption by factoring large numbers exponentially faster than any classical computer, and what this means for cybersecurity.
Build the Quantum Fourier Transform in Cirq one rotation at a time. Verifies against the classical DFT, explains the bit reversal, and shows where the speedup actually comes from.
Understand Simon's algorithm, the first proof of exponential quantum speedup, covering the hidden period problem, quantum circuit, classical post-processing over GF(2), and a complete Qiskit implementation.
Implement the Bernstein-Vazirani algorithm in Qiskit: find a hidden bit string in a single query using superposition and phase kickback, versus N queries classically.