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

TitleThe Minimum Size of Unextendible Product Bases in the Bipartite Case (and Some Multipartite Cases)
Publication TypeJournal Article
Year of Publication2015
AuthorsChen, J, Johnston, N
JournalCommunications in Mathematical Physics
Volume333
Issue1
Pages351 - 365
Date Published2014/10/10
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 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.
URLhttp://arxiv.org/abs/1301.1406v1
DOI10.1007/s00220-014-2186-7
Short TitleCommun. Math. Phys.