The minimum size of unextendible product bases in the bipartite case (and some multipartite cases)
DOI10.1007/s00220-014-2186-7zbMath1306.81010arXiv1301.1406OpenAlexW3102941179MaRDI QIDQ2514200
Nathaniel Johnston, Jianxin Chen
Publication date: 3 February 2015
Published in: Communications in Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.1406
Hilbert and pre-Hilbert spaces: geometry and topology (including spaces with semidefinite inner product) (46C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Multilinear algebra, tensor calculus (15A69) Quantum coherence, entanglement, quantum correlations (81P40)
Related Items (22)
Uses Software
Cites Work
- Unnamed Item
- Unextendible product bases, uncompletable product bases and bound entanglement
- Unextendible product bases and 1-factorization of complete graphs
- Three-by-three bound entanglement with general unextendible product bases
- Ranks of zero patterns and sign patterns*
- A COMPLETELY ENTANGLED SUBSPACE OF MAXIMAL DIMENSION
- A family of indecomposable positive linear maps based on entangled quantum states
- Unextendible product bases
This page was built for publication: The minimum size of unextendible product bases in the bipartite case (and some multipartite cases)