Simpler semidefinite programs for completely bounded norms
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 much simpler, semidefinite programming formulations of these norms.
- Publication:
-
arXiv e-prints
- Pub Date:
- July 2012
- DOI:
- 10.48550/arXiv.1207.5726
- arXiv:
- arXiv:1207.5726
- Bibcode:
- 2012arXiv1207.5726W
- Keywords:
-
- Quantum Physics;
- Mathematics - Optimization and Control
- E-Print:
- 15 pages, reference added in version 2