4:22 Recent Progress in Quantum Algorithms Conference — Waterloo, April 2012 Institute for Quantum Computing
49:12 Quantum Algorithms for the k-distinctness Problem - Aleksandrs Belovs Institute for Quantum Computing
40:07 Quantum query complexity: Adversaries, polynomials and direct product theorems - Jérémie Roland Institute for Quantum Computing
40:10 A Parallel Approximation Algorithm for Positive Semidefinite Programming - Rahul Jain Institute for Quantum Computing
34:30 Improving the Quantum Query Complexity of Boolean Matrix Multiplication Using Graph Collision Institute for Quantum Computing
48:22 Thomas Vidick - The computational complexity of multiple entangled provers Institute for Quantum Computing
