Bounding the separable rank via polynomial optimization (Q2144234)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7535500
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Bounding the separable rank via polynomial optimization |
scientific article; zbMATH DE number 7535500 |
Statements
Bounding the separable rank via polynomial optimization (English)
0 references
1 June 2022
0 references
entanglement
0 references
polynomial optimization
0 references
approximation hierarchies
0 references
matrix factorization ranks
0 references
completely positive rank
0 references
separable rank
0 references
0 references
0 references
0 references
0 references
0 references
0.7871127724647522
0 references
0.7795168161392212
0 references
0.762431800365448
0 references
0.762150228023529
0 references
0.7611731886863708
0 references
