메뉴 건너뛰기




Volumn 349, Issue 3-4, 2005, Pages 459-470

Evaluation of relative entropy of entanglement and derivation of optimal Lewenstein-Sanpera decomposition of bell decomposable states via convex optimization

Author keywords

Bell decomposable states; Convex optimization; Lewenstein Sanpera decomposition; Minimum relative entropy of entanglement; Semi definite programming

Indexed keywords

COMPUTATION THEORY; CONSTRAINT THEORY; DECOMPOSITION; LINEAR PROGRAMMING; OPTIMIZATION; SIGNAL PROCESSING;

EID: 13444280100     PISSN: 03784371     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.physa.2004.10.028     Document Type: Article
Times cited : (6)

References (38)
  • 10
    • 13444275760 scopus 로고    scopus 로고
    • On minimizing distortion and relative entropy
    • Preprint ANL/MCS-P1110-1203; Mathematics and Computer Science Division, Argonne National Laboratory submitted for publication (revised September 2004)
    • M.P. Friedlander, M.R. Gupta, On minimizing distortion and relative entropy, Preprint ANL/MCS-P1110-1203; Mathematics and Computer Science Division, Argonne National Laboratory, IEEE Trans. Inform. Theory, 2003, submitted for publication (revised September 2004).
    • (2003) IEEE Trans. Inform. Theory
    • Friedlander, M.P.1    Gupta, M.R.2
  • 27
    • 13444286602 scopus 로고    scopus 로고
    • University of California, Berkeley, USA MU Seminar
    • Lawrence, Ip, Shor's Algorithm is Optimal, University of California, Berkeley, USA MU Seminar, http://www.qcaustralia.org, 2003.
    • (2003) Shor's Algorithm Is Optimal
    • Lawrence, Ip.1
  • 31
    • 0018877134 scopus 로고
    • Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy
    • J. Shore, and R. Johnson Axiomatic derivation of the principle of maximum entropy and the principle of minimum cross-entropy IEEE Trans. Inform. Theory 33 1 1980 2637
    • (1980) IEEE Trans. Inform. Theory , vol.33 , Issue.1 , pp. 2637
    • Shore, J.1    Johnson, R.2
  • 34
    • 0025595687 scopus 로고
    • Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems
    • I. Csiszhár Why least squares and maximum entropy? An axiomatic approach to inference for linear inverse problems Ann. Statist. 19 4 1991 2032 2066
    • (1991) Ann. Statist. , vol.19 , Issue.4 , pp. 2032-2066
    • Csiszhár, I.1
  • 35
    • 0003775298 scopus 로고
    • Nonlinear programming
    • G. Golub (Ed.) SIAM, Philadelphia, 1994, originally published: McGraw-Hill, New York
    • O.L. Mangasarian, Nonlinear Programming, in: G. Golub (Ed.), Classics in Applied Mathematics, vol. 10, SIAM, Philadelphia, 1994, originally published: McGraw-Hill, New York, 1969.
    • (1969) Classics in Applied Mathematics , vol.10
    • Mangasarian, O.L.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.