Главная
Study mode:
on
1
Intro
2
Outline
3
Discrete & Quantum Fourier Transform (QFT)
4
The Deutsch-Jozsa algorithm (1992)
5
The Bernstein-Vazirani algorithm (1992)
6
Jordan's quantum algorithm for gradients (2004)
7
Generalizations and applications of Jordan's algorithm
8
The non-Abelian HSP
9
A simpler algorithm for graph isomorphism
10
Towards approximating the Jones polynomial
11
(Dynamical) Hamiltonian simulation
12
Product formula approach (Lloyd 1996)
13
Ground state preparation of frustration-free Hamiltonian
14
Continuous-time quantum / random walks
15
Exponential speedup by a quantum walk
Description:
Explore quantum algorithms in this comprehensive lecture from the Quantum Wave in Computing Boot Camp. Delve into key techniques including Discrete and Quantum Fourier Transform, the Deutsch-Jozsa and Bernstein-Vazirani algorithms, and Jordan's quantum algorithm for gradients. Examine generalizations and applications, including a simpler algorithm for graph isomorphism and approaches to approximating the Jones polynomial. Investigate Hamiltonian simulation techniques, ground state preparation, and continuous-time quantum walks. Gain insights into the exponential speedup potential of quantum algorithms through this in-depth overview presented by András Gilyén from Caltech.

Quantum Algorithms - An Overview of Techniques

Simons Institute
Add to list