Saved in:
Bibliographic Details
Main Author: Demianowicz, Maciej
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2509.26135
Tags: Add Tag
No Tags, Be the first to tag this record!
Table of Contents:
  • 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.