相关论文: The Minimum Size of Qubit Unextendible Product Bas…
Unextendible product bases have been shown to have many important uses in quantum information theory, particularly in the qubit case. However, very little is known about their mathematical structure beyond three qubits. We present several…
The construction of multipartite unextendible product bases (UPBs) is a basic problem in quantum information. We respectively construct two families of $2\times2\times4$ and $2\times2\times2\times4$ UPBs of size eight by using the existing…
Unextendible product bases (UPBs) play a key role in the study of quantum entanglement and nonlocality. A famous open question is whether there exist genuinely unextendible product bases (GUPBs), namely multipartite product bases that are…
The unextendible orthogonal matrices (UPBs) can be used for various problems in quantum information. We provide an algorithm to check if two UPBs are non-equivalent to each other. We give a method to construct UPBs and we apply this method…
A long-standing open question asks for the minimum number of vectors needed to form an unextendible product basis in a given bipartite or multipartite Hilbert space. A partial solution was found by Alon and Lovasz in 2001, but since then…
An important problem in quantum information is to construct multiqubit unextendible product bases (UPBs). By using the unextendible orthogonal matrices, we construct a 7-qubit UPB of size 11. It solves an open problem in [Quantum…
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…
We consider the unextendible product bases (UPBs) of fixed cardinality $m$ in quantum systems of $n$ qubits. These UPBs are divided into finitely many equivalence classes with respect to an equivalence relation introduced by N. Johnston.…
Unextendible product bases (UPBs) provide a versatile tool with various applications across different areas of quantum information theory. Their comprehensive characterization is thus of great importance and has been a subject of vital…
We studied the construction problem of the unextendible product basis (UPB). We mainly give a method to construct a UPB of a quantum system through the UPBs of its subsystem. Using this method and the UPBs which are known for us, we…
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\ge3$. We prove that they do not exist…
We study the local distinguishability of general multi-qubit states and show that local projective measurements and classical communication are as powerful as the most general local measurements and classical communication. Remarkably, this…
In quantum information theory, it is a fundamental problem to construct multipartite unextendible product bases (UPBs). We show that there exist two families UPBs in Hilbert space…
The 4-qubit unextendible product basis (UPB) has been recently studied by [Johnston, J. Phys. A: Math. Theor. 47 (2014) 424034]. From this result we show that there is only one UPB of size $6$ and six UPBs of size $9$ in…
An unextendible product basis (UPB) is a set of orthogonal product states which span a subspace of a given Hilbert space while the complementary subspace contains no product state. These product bases are useful to produce bound entangled…
A set of mutually unbiased bases (MUBs) is said to be unextendible if there does not exist another basis that is unbiased with respect to the given set. Here, we prove the existence of smaller sets of MUBs in prime-squared dimensions…
We completely characterize the condition when a tile structure provides an unextendible product basis (UPB), and construct UPBs of different large sizes in $\mathbb{C}^m\otimes\mathbb{C}^n$ for any $n\geq m\geq 3$. This solves an open…
We discuss the concept of unextendible product basis (UPB) and generalized UPB for fermionic systems, using Slater determinants as an analogue of product states, in the antisymmetric subspace $\wedge^ N \bC^M$. We construct an explicit…
We discuss the subject of Unextendible Product Bases with the orthogonality condition dropped and we prove that the lowest rank non-separable positive-partial-transpose states, i.e. states of rank 4 in 3 x 3 systems are always locally…
A set of multipartite orthogonal product states is locally irreducible, if it is not possible to eliminate one or more states from the set by orthogonality-preserving local measurements. An effective way to prove that a set is locally…