Quantum Computation (Caltech PHYS 219)
Prof. John Preskill, Caltech
25 courses · 9 tutorials
Prof. John Preskill, Caltech
Dr Steven Herbert, University of Cambridge
Prof. Elias Fernandez-Combarro Alvarez, University of Oviedo
Delft University of Technology (QuTech)
Delft University of Technology (QuTech)
Packt
Giordano Scappucci, Menno Veldhorst, Eliška Greplová (QuTech, TU Delft)
Delft University of Technology (QuTech)
Christian Andersen (QuTech, TU Delft)
Delft University of Technology (QuTech)
MIT xPRO / Isaac Chuang, William Oliver, Peter Shor, Aram Harrow
IBM Quantum
John Watrous
IonQ Researchers
Keio University / Rodney Van Meter
Microsoft Quantum
Microsoft
Prof. Peter Shor, MIT
Prof. Isaac Chuang and Prof. Peter Shor, MIT
Aleks Kissinger, Dept of Computer Science, University of Oxford
Pramey Upadhyaya
IBM Quantum / Qiskit Team
Dr. Donovan
Qubit by Qubit instructors (Stanford PhDs)
Xanadu
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.