Parseval frames provide redundant encodings, with equal-norm Parseval frames offering optimal robustness against one erasure. However, constructing such frames can be challenging. The Paulsen Problem asks to determine how far an ε-nearly equal-norm Parseval frame is from the set of all equal-norm Parseval frames. In this talk, I will present an approach to the Paulsen’s problem based on quiver invariant theory