Progress in the study of the (non)existence of genuinely unextendible product bases

Abstract

We investigate the open problem of the existence of genuinely unextendible product bases (GUPBs), that is, multipartite unextendible product bases (UPBs) which remain unextendible even with respect to biproduct vectors across all bipartitions of the parties. To this end, we exploit the well-known connection between UPBs and graph theory through orthogonality graphs and orthogonal representations, together with recent progress in this framework, and employ forbidden induced subgraph characterizations to single out the admissible local orthogonality graphs for GUPBs. Using this approach, we establish that GUPBs of size thirteen in three-qutrit systems-the smallest candidate GUPBs-do not exist. We further provide a partial characterization of graphs relevant to larger bases and systems with ququart subsystems.

References in corpus (13)

• Multipartite Nonlocality without Entanglement in Many Dimensions
• House of Graphs 2.0: a database of interesting graphs and more
• Generic local distinguishability and completely entangled subspaces
• Strong quantum nonlocality for unextendible product bases in heterogeneous systems
• Universal construction of genuinely entangled subspaces of any size
• Nonexistence of $n$-qubit unextendible product bases of size $2^n-5$
• Strong quantum nonlocality and unextendibility without entanglement in $N$-partite systems with odd $N$
• Unextendible and uncompletable product bases in every bipartition
• Fully non-positive-partial-transpose genuinely entangled subspaces
• A Complete Hierarchy of Linear Systems for Certifying Quantum Entanglement of Subspaces
• Negative result about the construction of genuinely entangled subspaces from unextendible product bases
• Unextendible and strongly uncompletable product bases
• X-arability of mixed quantum states