Bounding the separable rank via polynomial optimization (Q2144234)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Bounding the separable rank via polynomial optimization
scientific article

    Statements

    Bounding the separable rank via polynomial optimization (English)
    0 references
    0 references
    0 references
    0 references
    1 June 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    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 references