6.845 | Fall 2010 | Graduate

Quantum Complexity Theory

Assignments

Problem Set 3: Quantum Algorithms and Lower Bounds

Description:

Problem set on quantum algorithms and lower bounds, the Bernstein-Vazirani problem, Simon’s problem, oracle separations, Grover’s algorithm, the polynomial method, and the “Almost-As-Good-As-New Lemma.”

Resource Type:
Assignments
pdf
74 kB
Problem Set 3: Quantum Algorithms and Lower Bounds

Course Info

As Taught In
Fall 2010
Level