Convex Optimization Methods for Quantum Information Theory

This thesis develops new computational algorithms to solve complex mathematical problems that arise when studying quantum computers and how they process information. Many of these important calculations require finding the best solution among many possibilities, but existing methods are either too slow or unreliable. This research develops new, efficient computational methods to compute these quantities, thus providing new practical tools which allow us to better understand the fundamental limits of quantum computing.