The construction and weakly local indistinguishability of multiqubit unextendible product bases

DOI10.1007/S11128-024-04379-WMaRDI QIDQ6550811zbMATH OpenFDO

Authors Yize Sun, Baoshan Wang

Publication date 5 June 2024

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S11128-024-04379-W

zbMATH Keywords

complete graphlocal indistinguishabilitysecret sharingunextendible product bases

Mathematics Subject Classification ID

Special bases (entangled, mutual unbiased, etc.) (81P55)

Recommendations

• The construction of 7-qubit unextendible product bases of size ten
• The structure of qubit unextendible product bases
• Multiqubit UPB: the method of formally orthogonal matrices
• Multipartite unextendible product bases and quantum security
• The minimum size of qubit unextendible product bases

Cites work

• A family of indecomposable positive linear maps based on entangled quantum states
• Distinguishability of complete and unextendible product bases
• Distinguishability of quantum states under restricted families of measurements with an application to quantum data hiding
• Graph states for quantum secret sharing
• Graph theory and qubit information systems of extremal black branes
• Multiqubit UPB: the method of formally orthogonal matrices
• No-Signalling-Assisted Zero-Error Capacity of Quantum Channels and an Information Theoretic Interpretation of the Lovász Number
• Nonlocality, asymmetry, and distinguishing bipartite states
• On positive maps in quantum information
• Quantum data hiding
• QUANTUM PERFECT STATE TRANSFER ON WEIGHTED JOIN GRAPHS
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• The construction of 7-qubit unextendible product bases of size ten
• The minimum size of unextendible product bases in the bipartite case (and some multipartite cases)
• The structure of qubit unextendible product bases
• The tensor rank of tensor product of two three-qubit W states is eight
• Unextendible product bases
• Unextendible product bases and 1-factorization of complete graphs
• Unextendible product bases, uncompletable product bases and bound entanglement

Cited in

(1)

• Multipartite unextendible product bases and quantum security

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)