The Minimum Size of Unextendible Product Bases in the Bipartite Case (and Some Multipartite Cases)
- First Online:
- Cite this article as:
- Chen, J. & Johnston, N. Commun. Math. Phys. (2015) 333: 351. doi:10.1007/s00220-014-2186-7
- 136 Downloads
A long-standing open question asks for the minimum number of vectors needed to form an unextendible product basis in a given bipartite or multipartite Hilbert space. A partial solution was found by Alon and Lovász (J. Comb. Theory Ser. A, 95:169–179, 2001), but since then only a few other cases have been solved. We solve all remaining bipartite cases, as well as a large family of multipartite cases.