The convex algebraic geometry of higher-rank numerical ranges

The higher-rank numerical range is a convex compact set generalizing the classical numerical range of a square complex matrix, first appearing in the study of quantum error correction. We will discuss some of the real algebraic and convex geometry of these sets, including a generalization of Kippenhahn’s theorem, and describe an algorithm to explicitly calculate the higher-rank numerical range of a given matrix.