Published by the Department of Computer Science, The University of Chicago.
Institute for Quantum Computing, and School of Computer Science
University of Waterloo
Waterloo, Ontario, Canada
john.watrous AT uwaterloo DOT ca
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.
Submitted August 21, 2012, revised June 3, 2013; published July 13, 2013.