In this paper, we investigate the number of independent vector variables in an [Formula: see text]-qubit Orthogonal Product Basis (OPB). Here, the term “independent vector variable” refers to a structural element in the construction of a Unextendible Orthogonal Matrix (UOM). Intuitively, since fixing one state [Formula: see text] in a qubit basis [Formula: see text] uniquely determines its orthogonal partner [Formula: see text], we treat the pair as a single degree of freedom — one variable — rather than two. Based on this counting measure, we propose the conjecture that the number is upper bounded by [Formula: see text]. We show that if the number of orthogonal pairs of variables is minimum, then the matrix corresponding to the OPB contains a column consisting of exactly one variable. In this case the conjecture holds. We also demonstrate more OPBs true for the conjecture, when they have a column containing a small number of independent variables.
Abstract An orthogonal product basis (OPB) of a finite-dimensional Hilbert space H = H 1 ⊗ H 2 ⊗ ⋯ ⊗ H n is an orthonormal basis of H consisting of product vectors | x 1 〉 ⊗ | x 2 〉 ⊗ ⋯ ⊗ | x n 〉 . We show that the problem of constructing the OPBs of an n -qubit system can be reduced to a purely combinatorial problem. We solve this combinatorial problem in the case of four qubits and obtain 33 multiparameter families of OPBs. Each OPB of four qubits is equivalent, under local unitary operations and qubit permutations, to an OPB belonging to at least one of these families.
We use edge-colored complete multigraphs to study complete orthogonal product bases (OPBs) in
n-qubit systems. We prove that two OPBs are equivalent if and only if their associated multigraphs are isomorphic, thereby reducing OPB classification to graph isomorphism. Within this framework, we establish the upper bound
v≤2n−1 on the number of variables of an
n-qubit OPB. We also derive
(2an−1+1)≤an≤B2n−1n for the number
an of equivalence classes of
n-qubit OPBs, where
Bm denotes the number of partitions of an
m-element set. These bounds imply the asymptotic behavior
an=22n+o(n). For every OPB, the connectivity pattern of its color layers characterizes local irreducibility, which in turn implies indistinguishability by finite-round local operations and classical communication (LOCC); the existence of a complete color-splitting tree characterizes perfect distinguishability by finite-round LOCC. Finally, we give an algorithm for testing OPB equivalence and a recursive graph algorithm that constructs a finite-round LOCC protocol whenever such perfect discrimination is possible.
In quantum information theory, the state space of a multipartite quantum system is modeled by a tensor product. In the tensor-product space $\C^{d_1}\otimes\cdots\otimes\C^{d_p}$, a nonzero vector is a \emph{product state} if it can be written as
∣φ1⟩⊗⋯⊗∣φp⟩ with $\ket{\varphi_j}\in\C^{d_j}\setminus\{0\}$. An \emph{unextendible product basis} (UPB) is a finite family of pairwise orthogonal product states such that no nonzero product state is orthogonal to all of them. UPBs play a key role in investigating quantum entanglement and nonlocal phenomena. Finding a smallest UPB is a natural extremal problem: it asks how few pairwise orthogonal product states suffice to prevent any further product state from being added. The general minimum-size problem for UPBs has been studied for over two decades since the seminal work of Alon and Lovász.
Let
fm(d1,…,dp) be the minimum cardinality of a UPB in the space, and let
fLB(d1,…,dp)=1+∑j=1p(dj−1) be the natural lower bound. Alon and Lovász determined exactly when
fm attains the lower bound
fLB, but the obstructed multipartite cases remained open in general.
We prove a stabilization theorem: for every non-all-qubit system with
p≥3, whenever the natural lower bound
fLB is unattainable, the true minimum is exactly
fLB+1. Precisely, if the number of even local dimensions
di is positive and even, and at least one local dimension is greater than two, then
fm(d1,…,dp)=fLB(d1,…,dp)+1. The proof is built on a unified graph-theoretic framework. Our result, together with earlier work, settles the minimum size problem for UPBs in all finite quantum systems.
The construction of multiqubit unextendible product bases (UPBs) has been a long-standing problem. We give a systematic construction of multiqubit UPBs by studying their unextendible orthogonal matrices (UOMs) with graph-theoretic methods. Row decompositions of small UOMs produce the main intervals. Com- pletion graphs settle the remaining small UPB sizes, except for one size obtained from a good column structure. Nonexistence of the other UPB sizes follows from counts of fibres and row pairs. The computer is used only for a few finite UOM checks, whose exact tests are stated in the certificate appendix. These arguments determine the complete multiqubit UPB size spectrum in every dimension.
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 Information Processing 19:185 (2020)]. Next, we graph-theoretically show that the UPB is locally indistinguishable in the bipartite systems of two qubits and five qubits, respectively. It turns out that the UPB corresponds to a complete graph with 11 vertices constructed by three sorts of nonisomorphic graphs. Taking the graphs as product vectors, we show that they are in three different orbits up to local unitary equivalence. Moreover, we also present the number of sorts of nonisomorphic graphs of complete graphs of some known UPBs and their orbits.