Bounding the separable rank via polynomial optimization
From MaRDI portal
Publication:2144234
DOI10.1016/j.laa.2022.04.010zbMath1490.81031arXiv2109.14494OpenAlexW3201927314MaRDI QIDQ2144234
Sander Gribling, Andries Steenkamp, Monique Laurent
Publication date: 1 June 2022
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2109.14494
entanglementpolynomial optimizationapproximation hierarchiescompletely positive rankmatrix factorization ranksseparable rank
Factorization of matrices (15A23) Semidefinite programming (90C22) Quantum coherence, entanglement, quantum correlations (81P40) Polynomial optimization (90C23)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Tensor Decompositions and Applications
- Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank
- From seven to eleven: completely positive matrices with high cp-rank
- The \(\mathcal A\)-truncated \(K\)-moment problem
- An improved semidefinite programming hierarchy for testing entanglement
- Positive semidefinite rank
- Positive maps of low dimensional matrix algebras
- Symmetry groups, semidefinite programs, and sums of squares
- Moment problems for operator polynomials
- Separability criterion and inseparable mixed states with positive partial transposition.
- A simplex algorithm for rational cp-factorization
- The set of separable states has no finite semidefinite representation except in dimension \(3\times 2\)
- Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Factorization and cutting planes for completely positive matrices by copositive projection
- An operator-valued generalization of Tchakaloff's theorem
- Global Optimization with Polynomials and the Problem of Moments
- Approximation of the Stability Number of a Graph via Copositive Programming
- Positive Maps and Separable Matrices
- Julia: A Fresh Approach to Numerical Computing
- Tensor rank is NP-complete
- Mixed states in one spatial dimension: Decompositions and correspondence with nonnegative matrices
- Classical deterministic complexity of Edmonds' Problem and quantum entanglement
- On the Complexity of Nonnegative Matrix Factorization
- Dilations and Hahn Decompositions for Linear Maps
- Separability Criterion for Density Matrices
- The Theory of Quantum Information
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- Unknown quantum states: The quantum de Finetti representation
- The Complexity of Positive Semidefinite Matrix Factorization
- Symmetric Tensor Nuclear Norms
- Dimensions, lengths, and separability in finite-dimensional quantum systems
- JuMP: A Modeling Language for Mathematical Optimization
- Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
- Separability of \(n\)-particle mixed states: necessary and sufficient conditions in terms of linear maps
