Maximum Dimension of Subspaces with No Product Basis
Abstract
Let n2 and d1,…,dn2 be integers, and F be a field. A vector u∈Fd1·sdn is called a product vector if u=u[1]·s u[n] for some u[1]∈Fd1,…,u[n]∈Fdn. A basis composed of product vectors is called a product basis. In this paper, we show that the maximum dimension of subspaces of Fd1·sdn with no product basis is equal to d1d2·s dn-2 if either (i) n=2 or (ii) n3 and \#F>\di : i=n1,n2\ for some n1 and n2. When F=C, this result is related to the maximum number of simultaneously distinguishable states in general probabilistic theories (GPTs).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.