Overview
Syllabus
Intro
Outline
Discrete & Quantum Fourier Transform (QFT)
The Deutsch-Jozsa algorithm (1992)
The Bernstein-Vazirani algorithm (1992)
Jordan's quantum algorithm for gradients (2004)
Generalizations and applications of Jordan's algorithm
The non-Abelian HSP
A simpler algorithm for graph isomorphism
Towards approximating the Jones polynomial
(Dynamical) Hamiltonian simulation
Product formula approach (Lloyd 1996)
Ground state preparation of frustration-free Hamiltonian
Continuous-time quantum / random walks
Exponential speedup by a quantum walk
Taught by
Simons Institute