Fetching the paper…
Reading the bibliography…
The completely bounded trace and spectral norms, for finite-dimensional spaces, are known to be efficiently expressible by semidefinite programs (J.
Geometric Algorithms and Combinatorial Optimization
M. Grötschel, L. Lovász, and A. Schrijver · 1993
Earlier work this paper cites.
Interior point methods in semidefinite programming with applications to combinatorial optimization
F. Alizadeh · 1995
Earlier work this paper cites.
Matrix Analysis
R. Bhatia · 1997
Earlier work this paper cites.
Quantum Computation and Quantum Information
M. A. Nielsen and I. L. Chuang · 2000
Earlier work this paper cites.
Aspects of Semidefinite Programming – Interior Point Algorithms and Selected Applications
E. de Klerk · 2002
Earlier work this paper cites.
Classical and Quantum Computation
A. Kitaev, A. Shen, and M. Vyalyi · 2002
Cited alongside, same era.
Completely Bounded Maps and Operator Algebras
V. Paulsen · 2002
Cited alongside, same era.
Semidefinite programs and combinatorial optimization
L. Lovász · 2003
Cited alongside, same era.
On the hardness of distinguishing mixed-state quantum computations
B. Rosgen and J. Watrous · 2005
Cited alongside, same era.
Distinguishing quantum operations having few Kraus operators
J. Watrous · 2008
Later among the works it cites.
CVX: Matlab software for disciplined convex programming
M. Grant and S. Boyd · 2009
Later among the works it cites.
Semidefinite programs for completely bounded norms
J. Watrous · 2009
Later among the works it cites.
Entanglement quantification and quantum benchmarking of optical communication devices
N. Killoran · 2012
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…