A family of norms with applications in quantum information theory II

Quantum Information and Computation

Volumn 11, Issue 1-2, 2011, Pages 104-123

  Johnston, Nathaniel ^a   Kribs, David W ^a,b  

^a UNIVERSITY OF GUELPH   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

Bound entanglement; Norm; Schmidt rank; Separability

Indexed keywords

COMPUTATION THEORY; INFORMATION THEORY; QUANTUM ENTANGLEMENT; QUANTUM OPTICS;

BOUND ENTANGLEMENT; DUALITY THEORY; NORM; PARTIAL TRANSPOSE; QUANTUM INFORMATION THEORY; SCHMIDT; SCHMIDT RANK; SEMI-DEFINITE PROGRAM (SDP); SEPARABILITY; WERNER STATE;

MATLAB;

EID: 78650993124     PISSN: 15337146     EISSN: None     Source Type: Journal    
DOI: 10.26421/qic11.1-2-8     Document Type: Article

References (40)

1. N. Johnston and D. W. Kribs (2010), A family of norms with applications in quantum information theory, J. Math. Phys., 51, 082202.
2. D. Chruściński and A. Kossakowski (2009), Spectral conditions for positive maps, Commun. Math. Phys., 290, pp. 1051-1064.
3. D. Chruściński, A. Kossakowski, and G. Sarbicki (2009), Spectral conditions for entanglement witnesses vs. bound entanglement, Phys. Rev A, 80, 042314.
4. L. Pankowski, M. Piani, M. Horodecki, and P. Horodecki (2010), A few steps more towards NPT bound entanglement, IEEE Trans. Inf. Theory, 56, pp. 4085-4100.
5. M. Grotschel, L. Lovász, and A. Schrijver (1993), Geometric Algorithms and Combinatorial Optimization, SpringerVerlag, second corrected edition.
6. J. Watrous (2009), Semideńite programs for completely bounded norms, Theory of Computing, 5, pp. 217-238.
7. R. Jain, Z. Ji, S. Upadhyay, and J. Watrous (2010), QIP = PSPACE, Proceedings of the 42nd ACM Symposium on Theory of Computing.
8. Werner, R. F. (1989), Quantum states with Einstein-Podolsky-Rosen correlations admitting a hiddenvariable model, Phys. Rev. A, 40, pp. 4277-4281.
9. M. Lewenstein, D. Bruss, J. I. Cirac, B. Kraus, M. Kus, J. Samsonowicz, A. Sanpera, and R. Tarrach (2000), Separability and distillability in composite quantum systemsa primer-, Journal of Modern Optics, 47, 2841.
10. *-algebras, Trans. Amer. Math. Soc., 135, pp. 199-212.
11. A. Uhlmann (1976), The \transition probability" in the state space of a *-algebra, Rep. Math. Phys., 9, pp. 273.
12. V. Osipov, H.-J. Sommers, and K. Zyczkowski (2010), Random Bures mixed states and the distribution of their purity, J. Phys. A: Math. Theor., 43, 055302.
13. E. Størmer (1986), Extension of positive maps into B(H), J. Funct. Anal., 66, No.2, pp. 235-254.
14. E. Størmer (2008), Duality of cones of positive maps, arXiv:0810.4253v1 [math.OA].
15. L. Skowronek, E. Størmer, and K. Zyczkowski (2009), Cones of positive maps and their duality relations, J. Math. Phys., 50, 062106.
16. F. Brandao. Mentioned during his talk Quantum hypothesis testing of noni.i.d. states and its connection to reversible resource theories at the Operator Structures in Quantum Information Workshop at the Fields Institute on July 7, 2009.
17. G. Aubrun, S. Szarek, and E. Werner (2010), Nonadditivity of Renyi entropy and Dvoretzky's Theorem, J. Math. Phys., 51, 022102.
18. M.-D. Choi (1975), Completely positive linear maps on complex matrices, Lin. Alg. Appl., 10, pp. 285-290.
19. V. I. Paulsen (2003), Completely Bounded Maps and Operator Algebras, Cambridge University Press, Cambridge.
20. B. Terhal and P. Horodecki (2000), A Schmidt number for density matrices, Phys. Rev. A Rapid Communications, Vol. 61, 040301.
21. M. Horodecki, P. Horodecki, and R. Horodecki (1996), Separability of mixed states: necessary and sufficient conditions, Phys. Lett. A, 223, pp. 1-8.
22. A. Peres (1996), Separability criterion for density matrices, Phys. Rev. Lett. 77, pp. 1413-1415.
23. F. Alizadeh (1995), Interior point methods in semideńite programming with applications to combinatorial optimization, SIAM J. Opt., 5(1), pp. 1351.
24. L. Vandenberghe and S. Boyd (1996), Semideńite programming, SIAM Review, 38(1), pp. 4995.
25. L. Lovasz (2003), Semideńite programs and combinatorial optimization, Rec. Adv. Alg. Comb.
26. E. de Klerk (2002), Aspects of Semideńite Programming Interior Point Algorithms and Selected Applications, Vol. 65 of Applied Optimization, Kluwer Academic Publishers, Dordrecht.
27. H. Wolkowicz, R. Saigal, and L. Vandenberghe (2000), Handbook of semideńite programming: theory, algorithms, and applications, Vol. 27 of International series in operations research & management science, Springer.
28. S. Boyd and L. Vandenberghe (2004), Convex optimization, Cambridge University Press.
29. D. P. DiVincenzo, P. W. Shor, J. A. Smolin, B. M. Terhal, and A. V. Thapliyal (2000), Evidence for bound entangled states with negative partial transpose, Phys. Rev. A, 61, 062312.
30. W. Dr, J. I. Cirac, M. Lewenstein, and D. Bruss (2000), Distillability and partial transposition in bipartite systems, Phys. Rev. A, 61, 062313.
31. P. Horodecki (1997), Separability criterion and inseparable mixed states with positive partial transposition, Phys. Lett. A, 232, pp. 333.
32. M. Horodecki, P. Horodecki, and R. Horodecki (1998), Mixedstate entanglement and distillation: Is there a \bound" entanglement in nature?, Phys. Rev. Lett., 80, pp. 5239.
33. M. Horodecki and P. Horodecki (1999), Reduction criterion of separability and limits for a class of protocols of entanglement distillation, Phys. Rev. A, 59, pp. 4206.
34. P. Gawron, Z. Puchala, J. A. Miszczak, L. Skowronek, M.-D. Choi, and K. Zyczkowski (2009), Local numerical range: a versatile tool in the theory of quantum information, arXiv:0905.3646v1 [quantph].
35. V. Milman (1971), A new proof of the theorem of A. Dvoretzky on sections of convex bodies, Funct. Anal. Appl., 5, pp. 28-37. English translation
36. V. Vedral and M. B. Plenio (1998), Entanglement measures and purilication procedures, Phys. Rev. A, 57, pp. 1619-1633.
37. V. Vedral, M. B. Plenio, M. A. Rippin, and P. L. Knight (1997), Quantifying entanglement, Phys. Rev. Lett. 78, pp. 2275-2279.
38. Private communication with F. Brandao.
39. S. Aaronson, S. Beigi, A. Drucker, B. Fefferman, and P. Shor (2009), The power of unentanglement, Theory of Computing, 5, pp. 1-42.
40. J. F. Sturm (1999), Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones, Optimization Methods and Software, 11-12, pp. 625-653. Special issue on Interior Point Methods (CD supplement with software). http://sedumi.ie.lehigh.edu/