A family of norms with applications in quantum information theory II

Authors:
Nathaniel Johnston;David W. Kribs
Affiliations:
Department of Mathematics and Statistics, University of Guelph, Guelph, Ontario, Canada;Department of Mathematics and Statistics, University of Guelph, Guelph, Ontario, Canada and Institute for Quantum Computing, University of Waterloo, Waterloo, Ontario, Canada
Venue:
Quantum Information & Computation
Year:
2011

Citing 4
Cited 0

Semidefinite programming

SIAM Review
Convex Optimization

Convex Optimization
QIP = PSPACE

Proceedings of the forty-second ACM symposium on Theory of computing
A few steps more towards NPT bound entanglement

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of computing the family of operator norms recently introducedin [1]. We develop a family of semidefinite programs that can be used to exactly computethem in small dimensions and bound them in general. Some theoretical consequencesfollow from the duality theory of semidefinite programming, including a new constructiveproof that for all r there are non-positive partial transpose Werner states that are r-undistillable. Several examples are considered via a MATLAB implementation of thesemidefinite program, including the case of Werner states and randomly generated statesvia the Bures measure, and approximate distributions of the norms are provided. Weextend these norms to arbitrary convex mapping cones and explore their implicationswith positive partial transpose states.