Bounding the separable rank via polynomial optimization (Q2144234): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3201927314 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2109.14494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Can Quantum-Mechanical Description of Physical Reality Be Considered Complete? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Julia: A Fresh Approach to Numerical Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: From seven to eleven: completely positive matrices with high cp-rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the copositive representation of binary and continuous nonconvex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unknown quantum states: The quantum de Finetti representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dimensions, lengths, and separability in finite-dimensional quantum systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3672499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Moment problems for operator polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of the Stability Number of a Graph via Copositive Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed states in one spatial dimension: Decompositions and correspondence with nonnegative matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: JuMP: A Modeling Language for Mathematical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The set of separable states has no finite semidefinite representation except in dimension \(3\times 2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive semidefinite rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry groups, semidefinite programs, and sums of squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3172441 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on matrix factorization ranks via noncommutative polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical deterministic complexity of Edmonds' Problem and quantum entanglement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dilations and Hahn Decompositions for Linear Maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved semidefinite programming hierarchy for testing entanglement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor rank is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separability of \(n\)-particle mixed states: necessary and sufficient conditions in terms of linear maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separability criterion and inseparable mixed states with positive partial transposition. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An operator-valued generalization of Tchakaloff's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor Decompositions and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization with Polynomials and the Problem of Moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(\mathcal A\)-truncated \(K\)-moment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric Tensor Nuclear Norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive Maps and Separable Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2706552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separability Criterion for Density Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4285035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Positive Semidefinite Matrix Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplex algorithm for rational cp-factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorization and cutting planes for completely positive matrices by copositive projection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3243490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4241225 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Nonnegative Matrix Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory of Quantum Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive maps of low dimensional matrix algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0) / rank
 
Normal rank

Latest revision as of 05:12, 29 July 2024

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
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references