메뉴 건너뛰기




Volumn 67, Issue 1, 2003, Pages

Checking 2×M quantum separability via semidefinite programming

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA PROCESSING; MATHEMATICAL OPERATORS; MATRIX ALGEBRA; POLYNOMIALS;

EID: 0037238433     PISSN: 10502947     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (8)

References (17)
  • 2
    • 85060213774 scopus 로고    scopus 로고
    • edited by R. Brylinski and G. Chen, Computational Mathematics Series; (Chapman & Hall/CRC, Boca Raton, FL)
    • Mathematics of Quantum Computation, edited by R. Brylinski and G. Chen, Computational Mathematics Series Vol. 3 (Chapman & Hall/CRC, Boca Raton, FL, 2002).
    • (2002) Mathematics of Quantum Computation , vol.3
  • 7
    • 0012648321 scopus 로고    scopus 로고
    • F. Alizadeh et al., see http://www.cs.nyu.edu/overton/sdppack/sdppack.html.
    • Alizadeh, F.1
  • 8
    • 0012706164 scopus 로고    scopus 로고
    • under/pub/boyd/semidef-prog
    • L. Vandenberghe and S. Boyd, available via anonymous ftp to isl.stanford.edu under/pub/boyd/semidef-prog.
    • Vandenberghe, L.1    Boyd, S.2
  • 13
    • 0012709379 scopus 로고    scopus 로고
    • e-print quant-ph/0205178
    • Y.C. Eldar et al., e-print quant-ph/0205178.
    • Eldar, Y.C.1


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