### Volume 2013

#### Simpler semidefinite programs for completely bounded norms

John Watrous
Institute for Quantum Computing, and School of Computer Science
University of Waterloo
john.watrous AT uwaterloo DOT ca

July 13, 2013

#### Abstract

The completely bounded trace and spectral norms, for finite-dimensional spaces, are known to be efficiently expressible by semidefinite programs (J. Watrous, Theory of Computing 5: 11, 2009). This paper presents two new, and arguably simpler, semidefinite programming formulations of these norms.

• The article: PDF (242 KB)
• Source material: ZIP (80 KB)