Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1801.08677 · Journal of Physics A Mathematical and Theoretical

Multiqubit UPB: the method of formally orthogonal matrices

Lin Chen, Dragomir Ž. Djoković

Published May 16, 2018• 12 citations
arXivHTMLPDF

Abstract

Abstract We use formal matrices whose entries we view as vector variables taking unit vector values in one-qubit Hilbert spaces of a multiqubit quantum system. We construct many unextendible product bases (UPBs) of new sizes in such systems and provide a new construction of UPBs of n qubits of cardinality n + 1 when . We also give a new method of constructing multiqubit entangled states with all partial transposes positive.

DOI
10.1088/1751-8121/aac53b

Related papers

Constructing unextendible product bases from multiqubit ones

Taiyu Zhang, Lin Chen

Abstract The construction of multipartite unextendible product bases (UPBs) is a basic problem in quantum information. We respectively construct two families of 2 × 2 × 4 and 2 × 2 × 2 × 4 UPBs of size eight by using the existing four-qubit and five-qubit UPBs. As an application, we construct novel families of multipartite positive-partial-transpose entangled states, as well as their entanglement properties in terms of the geometric measure of entanglement.

arXiv:2203.08397•Communications in Theoretical Physics•Nov 1, 2022•1 citation

The construction and local distinguishability of multiqubit unextendible product bases

Yize Sun, Lin Chen

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.

arXiv:2102.11553•Feb 23, 2021•1 citation

Systematic construction of multiqubit unextendible product bases

Caohan Cheng, Lin Chen

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.

quant-pharXiv:2609.14788•Sep 15, 2026•0 citations

The construction of multiqubit unextendible product bases

Caohan Cheng, Lin Chen

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 to find all $5$-qubit UPBs of size eight. We apply the algorithm to check if the $5$-qubit UPBs of size eight are non-equivalent to each other. Based on all the $5$-qubit UPBs of size eight, we propose a theorem for constructing a new UPB non-equivalent to a given one.

arXiv:2402.11785•Feb 19, 2024•0 citations

Construction of multipartite unextendible product bases and geometric measure of entanglement of positive-partial-transpose entangled states

Yize Sun, Baoshan Wang, Li, Shiru

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 $\mathbb{C}^2\otimes\mathbb{C}^2\otimes\mathbb{C}^2\otimes\mathbb{C}^2\otimes\mathbb{C}^2\otimes\mathbb{C}^4$ by merging two different systems of an existing $7$-qubit UPB of size $11$. Moreover, a new family of $7$-qubit positive-partial-transpose (PPT) entangled states of rank $2^7-11$ is constructed. We analytically derive a geometric measure of entanglement of a special PPT entangled states. Also an upper bound are given by two methods.

arXiv:2212.02446•Dec 5, 2022•0 citations

Constructing 2 × 2 × 4 and 4 × 4 unextendible product bases and positive-partial-transpose entangled states

Kai Wang, Lin Chen, Yi Shen +2 more

The 4-qubit unextendible product bases (UPBs) has been recently studied by [Johnston, J. Phys. A: Math. Theor. 47 (2014) 424034]. Based on this study we show that there is only one UPB of size 6 and six UPBs of size 9 in H=C2⊗C2⊗C4, three UPBs of size 9 in K=C4⊗C4, and no UPB of size 7 in H and K. Furthermore we construct a new family of 4-qubit positive-partial-transpose (PPT) entangled states of rank seven, and show that they are also PPT entangled states in H and K, respectively. We analytically derive a geometric measure of a special PPT entangled states.

arXiv:1810.08932•Linear and Multilinear Algebra•Mar 14, 2019•15 citations
Abstract We use formal matrices whose entries we view as vector variables taking unit vector values in one-qubit Hilbert spaces of a multiqubit quantum system. We construct many unextendible product bases (UPBs) of new sizes in such systems and provide a new construction of UPBs of n qubits of cardinality n + 1 when . We also give a new method of constructing multiqubit entangled states with all partial transposes positive.
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.
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.
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 to find all 555-qubit UPBs of size eight. We apply the algorithm to check if the 555-qubit UPBs of size eight are non-equivalent to each other. Based on all the 555-qubit UPBs of size eight, we propose a theorem for constructing a new UPB non-equivalent to a given one.
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 C2⊗C2⊗C2⊗C2⊗C2⊗C4\mathbb{C}^2\otimes\mathbb{C}^2\otimes\mathbb{C}^2\otimes\mathbb{C}^2\otimes\mathbb{C}^2\otimes\mathbb{C}^4C2⊗C2⊗C2⊗C2⊗C2⊗C4 by merging two different systems of an existing 777-qubit UPB of size 111111. Moreover, a new family of 777-qubit positive-partial-transpose (PPT) entangled states of rank 27−112^7-1127−11 is constructed. We analytically derive a geometric measure of entanglement of a special PPT entangled states. Also an upper bound are given by two methods.
The 4-qubit unextendible product bases (UPBs) has been recently studied by [Johnston, J. Phys. A: Math. Theor. 47 (2014) 424034]. Based on this study we show that there is only one UPB of size 6 and six UPBs of size 9 in H=C2⊗C2⊗C4, three UPBs of size 9 in K=C4⊗C4, and no UPB of size 7 in H and K. Furthermore we construct a new family of 4-qubit positive-partial-transpose (PPT) entangled states of rank seven, and show that they are also PPT entangled states in H and K, respectively. We analytically derive a geometric measure of a special PPT entangled states.