The Minimum Size of Unextendible Product Bases in the Bipartite Case (and Some Multipartite Cases)

Abstract:

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 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.

Authors:

Download:

Cite as:

  • J. Chen and N. Johnston. The Minimum Size of Unextendible Product Bases in the Bipartite Case (and Some Multipartite Cases). Communications in Mathematical Physics, 333(1):351-365, 2015.

Supplementary material:

Related publications: