The construction and local distinguishability of multiqubit unextendible product bases
arXiv:2102.11553
Abstract
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 comment23 pages, 11 figures
References in corpus (20)
- Persistent entanglement in arrays of interacting particles
- Quantum Nonlocality without Entanglement
- Unextendible Product Bases and Bound Entanglement
- Preparation and Measurement of Three-Qubit Entanglement in a Superconducting Circuit
- Local Distinguishability of Multipartite Orthogonal Quantum States
- Graph States for Quantum Secret Sharing
- Unextendible Product Bases, Uncompletable Product Bases and Bound Entanglement
- Nonlocality, Asymmetry, and Distinguishing Bipartite States
- Hiding classical data in multi-partite quantum states
- Strong Quantum Nonlocality without Entanglement
- Distinguishability of complete and unextendible product bases
- No-Signalling Assisted Zero-Error Capacity of Quantum Channels and an Information Theoretic Interpretation of the Lovasz Number
- Strong quantum nonlocality with entanglement
- The Structure of Qubit Unextendible Product Bases
- On local indistinguishability of orthogonal pure states by using a bound on distillable entanglement
- Tight Bell inequalities with no quantum violation from qubit unextendible product bases
- The Minimum Size of Qubit Unextendible Product Bases
- Graph Theory and Qubit Information Systems of Extremal Black Branes
- Multiqubit UPB: The method of formally orthogonal matrices
- On positive maps in quantum information