TY - JOUR T1 - The Minimum Size of Unextendible Product Bases in the Bipartite Case (and Some Multipartite Cases) JF - Communications in Mathematical Physics Y1 - 2015 A1 - Jianxin Chen A1 - Nathaniel Johnston AB - 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 Lovasz in 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. VL - 333 U4 - 351 - 365 UR - http://arxiv.org/abs/1301.1406v1 CP - 1 J1 - Commun. Math. Phys. U5 - 10.1007/s00220-014-2186-7 ER -