Guardado en:
Detalles Bibliográficos
Autor principal: Demianowicz, Maciej
Formato: Preprint
Publicado: 2025
Materias:
Acceso en línea:https://arxiv.org/abs/2509.26135
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866914328165220352
author Demianowicz, Maciej
author_facet Demianowicz, Maciej
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.
format Preprint
id arxiv_https___arxiv_org_abs_2509_26135
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Progress in the study of the (non)existence of genuinely unextendible product bases
Demianowicz, Maciej
Quantum Physics
Combinatorics
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.
title Progress in the study of the (non)existence of genuinely unextendible product bases
topic Quantum Physics
Combinatorics
url https://arxiv.org/abs/2509.26135