Constructing $2\times2\times4$ and $4\times4$ unextendible product bases and positive-partial-transpose entangled states
Lin Chen, Kai Wang, Yi Shen, Yize Sun, Lijun Zhao

TL;DR
This paper classifies unextendible product bases (UPBs) of specific sizes in certain 4-qubit and bipartite systems and constructs a PPT entangled state with a detailed entanglement measure.
Contribution
It provides a complete classification of UPBs of sizes 6 and 9 in certain 4-qubit and bipartite systems and constructs a new PPT entangled state with analytical entanglement quantification.
Findings
Only one UPB of size 6 in ^2d7^2d7^4
Six UPBs of size 9 in ^2d7^2d7^4
No UPB of size 7 in the studied systems
Abstract
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 and six UPBs of size in , three UPBs of size in , and no UPB of size in and . Furthermore we construct a 4-qubit positive-partial-transpose (PPT) entangled state \r of rank seven, and show that it is also a PPT entangled state in and , respectively. We analytically derive the geometric measure of entanglement of a special \r.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Information and Cryptography · Quantum Computing Algorithms and Architecture · Quantum Mechanics and Applications
