The talk will give an introduction to this new branch of compressed sensing. One has an affine subspace intersect the positive semideinite (PSD) matrices and wishes to find a smallest rank matrix therein. This is a highly nonconvex problem. Minimizing the trace is a convex problem which often gives the correct answer. There is an elegant probablistic analysis which applies in some situations. The talk gives an exposition of this.