Unextendible and uncompletable product bases in every bipartition

Abstract

Unextendible product basis is an important object in quantum information theory and features a broad spectrum of applications, ranging bound entangled states, quantum nonlocality without entanglement, and Bell inequalities with no quantum violation. A generalized concept called uncompletable product basis also attracts much attention. In this paper, we find some unextendible product bases that are uncompletable product bases in every bipartition, which answers a 19 year-old open question proposed by DiVincenzo et al. [Commun. Math. Phys. 238, 379 (2003)]. As a consequence, we connect such unextendible product bases to local hiding of information and give a sufficient condition for the existence of an unextendible product basis, that is still an unextendible product basis in every bipartition. Our results advance the understanding of the geometry of unextendible product bases.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…