Lectures on quantum computations(+ problems), Spring 2007
Julia Kempe, School of Computer Science
Introduction, axioms, Bell Inequaities
Hilbert spaces, Tensor products, quantum gates
Hilbert spaces, Super-dense coding, Teleportation
Reversibility, Accuracy
Quantum complexity theory
Extended Church-Turing thesis
Simons algorithm +QFT
Quantum factoring algorithm
Abelian HSP+ Discreet log
NP-completeProblems:lowerbounds+ZenoE?ect
Quadratic speedup for unstructured search
Phase estimation
Density matrices, von Neumann Entropy
Search algorithms and quantum walk
QuantumCommunication:Holevo’sBound
Local hamiltonians+ QMA completness
Julia Kempe, School of Computer Science
Introduction, axioms, Bell Inequaities
Hilbert spaces, Tensor products, quantum gates
Hilbert spaces, Super-dense coding, Teleportation
Reversibility, Accuracy
Quantum complexity theory
Extended Church-Turing thesis
Simons algorithm +QFT
Quantum factoring algorithm
Abelian HSP+ Discreet log
NP-completeProblems:lowerbounds+ZenoE?ect
Quadratic speedup for unstructured search
Phase estimation
Density matrices, von Neumann Entropy
Search algorithms and quantum walk
QuantumCommunication:Holevo’sBound
Local hamiltonians+ QMA completness