The construction and weakly local indistinguishability of multiqubit unextendible product bases
From MaRDI portal
Publication:6550811
DOI10.1007/s11128-024-04379-wzbMATH Open1542.81181MaRDI QIDQ6550811
Publication date: 5 June 2024
Published in: Quantum Information Processing (Search for Journal in Brave)
Cites Work
- Distinguishability of quantum states under restricted families of measurements with an application to quantum data hiding
- Unextendible product bases, uncompletable product bases and bound entanglement
- The tensor rank of tensor product of two three-qubit W states is eight
- On positive maps in quantum information
- Unextendible product bases and 1-factorization of complete graphs
- The minimum size of unextendible product bases in the bipartite case (and some multipartite cases)
- The construction of 7-qubit unextendible product bases of size ten
- Nonlocality, asymmetry, and distinguishing bipartite states
- The structure of qubit unextendible product bases
- No-Signalling-Assisted Zero-Error Capacity of Quantum Channels and an Information Theoretic Interpretation of the Lovász Number
- Distinguishability of complete and unextendible product bases
- QUANTUM PERFECT STATE TRANSFER ON WEIGHTED JOIN GRAPHS
- Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
- Quantum data hiding
- Multiqubit UPB: the method of formally orthogonal matrices
- Graph states for quantum secret sharing
- Graph theory and qubit information systems of extremal black branes
- A family of indecomposable positive linear maps based on entangled quantum states
- Unextendible product bases
This page was built for publication: The construction and weakly local indistinguishability of multiqubit unextendible product bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550811)
