BEST SEPARABLE APPROXIMATION WITH SEMI-DEFINITE PROGRAMMING METHOD (Q4659847)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: BEST SEPARABLE APPROXIMATION WITH SEMI-DEFINITE PROGRAMMING METHOD |
scientific article; zbMATH DE number 2148190
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | BEST SEPARABLE APPROXIMATION WITH SEMI-DEFINITE PROGRAMMING METHOD |
scientific article; zbMATH DE number 2148190 |
Statements
BEST SEPARABLE APPROXIMATION WITH SEMI-DEFINITE PROGRAMMING METHOD (English)
0 references
21 March 2005
0 references
optimal Lewenstein-Sanpera decomposition
0 references
semi-definite programming
0 references
Bell decomposable states
0 references
Werner and isotropic states
0 references
0 references
