---

Semidefinite programs have found applications in many fields of physics and mathematics. They are well suited to the computation of upper bounds on the maxima of commutative or noncommutative polynomial problems. They also match nearly one to one the objects studied in quantum information theory. However, SDPs have richer structure, and are computationally more intensive than linear programs. Symmetry reduction is a well-known tool to reduce the computational requirements of solving those problems. However, there is currently no turn-key solution to exploit symmetries coming from representation of arbitrary groups. In this talk, we discuss numerical techniques to decompose finite representations of arbitrary finite groups, and a recent Octave/MATLAB implementation.

---

Denis Rosset, National Cheng Kung University
Seminar room 0.02, ETP
Contact: David Gross