Papers
Topics
Authors
Recent
Search
2000 character limit reached

Unextendible and uncompletable product bases in every bipartition

Published 11 Jul 2022 in quant-ph | (2207.04763v1)

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.

Summary

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.