Optimizing completely positive maps using semidefinite programming

Physical Review A - Atomic, Molecular, and Optical Physics

Volumn 65, Issue 3, 2002, Pages 4-

  Audenaert, Koenraad ^a,b   De Moor, Bart ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85035286882     PISSN: 10502947     EISSN: 10941622     Source Type: Journal    
DOI: 10.1103/PhysRevA.65.030302     Document Type: Article

References (13)

1. M.F. Sacchi, Phys. Rev. A 63, 054104 (2001).
2. S. Massar and S. Popescu, Phys. Rev. A 61, 062303 (2000).
3. J. Fiurasek, e-print quant-ph/0105124(2001).
4. J. de Pillis, Pac. J. Math. 23, 129 (1967).
5. A. Jamiolkowski, Rep. Math. Phys. 3, 275 (1972).
6. J. Fiurasek (private communication, 2001).
7. L. Vandenberghe and S. Boyd, SIAM Rev. 38, 49 (1996).
8. Y. Nesterov and A. Nemirovsky, Interior-Point Polynomial Methods in Convex Programming, Vol. 13 of Studies in Applied Mathematics (SIAM, Philadelphia, 1994).
9. E. Rains, IEEE Trans. Inf. Theory (to be published).
10. L. Hardy and D.D. Song, Phys. Rev. A 63, 032304 (2001);
11. Phys. Rev. AL. HardyD.D. Song64, 032301 (2001).
12. J.F. Sturm, Optimization Methods and Software 11–12, 625 (1999). Software available at http://members.tripodnet.nl/SeDuMi
13. V. Buzek, M. Hillery, and F. Werner, J. Mod. Opt. 47, 2112 (2001).