Speaker: Aram Harrow (MIT) Venue&Time: Grey Room 3 / 11:30 Abstract: Given a vector v, what is the closest k-sparse vector? The answer to this question is usually that we should take the largest k entries of v. It turns out that we can do better with randomized approximations. When approximating pure bipartite entangled states […]