Simpler semidefinite programs for completely bounded norms
Quantum Physics
2012-08-03 v2 Optimization and Control
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.
Cite
@article{arxiv.1207.5726,
title = {Simpler semidefinite programs for completely bounded norms},
author = {John Watrous},
journal= {arXiv preprint arXiv:1207.5726},
year = {2012}
}
Comments
15 pages, reference added in version 2