Nonexistence of $n$-qubit unextendible product bases of size $2^n-5$

Abstract

It is known that the $n$-qubit system has no unextendible product bases (UPBs) of cardinality $2^n-1$, $2^n-2$ and $2^n-3$. On the other hand the $n$-qubit UPBs of cardinality $2^n-4$ exist for all $n\ge 3$. We prove that they do not exist for cardinality $2^n-5$.

arXiv comment6 pages

References in corpus (14)

• Quantum Nonlocality without Entanglement
• Unextendible Product Bases and Bound Entanglement
• Unextendible Product Bases, Uncompletable Product Bases and Bound Entanglement
• Separability criteria for genuine multiparticle entanglement
• Separability in 2xN composite quantum systems
• The Minimum Size of Unextendible Product Bases in the Bipartite Case (and Some Multipartite Cases)
• Four-qubit entangled symmetric states with positive partial transpositions
• The Structure of Qubit Unextendible Product Bases
• Tight Bell inequalities with no quantum violation from qubit unextendible product bases
• Qubit-qudit states with positive partial transpose
• Description of rank four PPT entangled states of two qutrits
• Separability problem for multipartite states of rank at most four
• Construction of multi-qubit optimal genuine entanglement witnesses
• Orthogonal product bases of four qubits

Cited by in corpus (5)

• Unextendible product bases from tile structures and their local entanglement-assisted distinguishability
• Multiqubit UPB: The method of formally orthogonal matrices
• Negative result about the construction of genuinely entangled subspaces from unextendible product bases
• Constructing unextendible product bases from multiqubit ones
• Progress in the study of the (non)existence of genuinely unextendible product bases