Unextendible and strongly uncompletable product bases
- 1 November 2024
- journal article
- research article
- Published by AIP Publishing in Journal of Mathematical Physics
- Vol. 65 (11)
Abstract
In 2003, DiVincenzo et al. put forward the question of whether there exists an unextendible product basis (UPB) that is an uncompletable product basis in every bipartition [DiVincenzo et al. Commun. Math. Phys. 238, 379–410 (2003)]. Recently, Shi et al. presented a UPB in tripartite systems that is also a strongly uncompletable product basis (SUCPB) in every bipartition [Shi et al. New J. Phys. 24, 113025 (2022)]. However, whether there exist UPBs that are SUCPBs in only one or two bipartitions remains unknown. We provide a sufficient condition for the existence of SUCPBs based on a quasi U-tile structure. We analyze all possible cases about the relationship between UPBs and SUCPBs in tripartite systems. In particular, we construct a UPB with smaller size d3 − 3d2 + 1 in Cd⊗Cd⊗Cd, which is an SUCPB in every bipartition and has a smaller cardinality than the existing one.Keywords
All Related Versions
This publication has 43 references indexed in Scilit:
- Nonlocal sets of orthogonal product states with the less amount of elements in tripartite quantum systemsQuantum Information Processing, 2022
- Nonlocal sets of orthogonal multipartite product states with less membersQuantum Information Processing, 2021
- The construction of 7-qubit unextendible product bases of size tenQuantum Information Processing, 2020
- The unextendible product bases of four qubits: Hasse diagramsQuantum Information Processing, 2019
- The local indistinguishability of multipartite product statesQuantum Information Processing, 2016
- The Minimum Size of Unextendible Product Bases in the Bipartite Case (and Some Multipartite Cases)Communications in Mathematical Physics, 2014
- Unextendible product bases and 1-factorization of complete graphsDiscrete Applied Mathematics, 2006
- Unextendible Product Bases and Locally Unconvertible Bound Entangled StatesQuantum Information Processing, 2004
- Unextendible Product Bases, Uncompletable Product Bases and Bound EntanglementCommunications in Mathematical Physics, 2003
- Unextendible Product BasesJournal of Combinatorial Theory, Series A, 2001