On convex optimization problems in quantum information theory

Understand

Convex optimization problems arise naturally in quantum information theory, often in terms of minimizing a convex function over a convex subset of the space of hermitian matrices.

• In most cases, finding exact solutions to these problems is usually impossible.
• As inspired by earlier investigations into the relative entropy of entanglement [Phys.
• Rev.