Published by the Department of Computer Science, The University of Chicago.

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)
• BibTeX entry for this article (245 bytes)

Submitted August 21, 2012, revised June 3, 2013; published July 13, 2013.

© 2013 John Watrous
Licensed under a Creative Commons Attribution License

Article 7

Article 9

Volume 2013

Published articles