Distinguishability of a tripartite unextendible product basis using local operations and classical communication

In this presentation, we quantify multi-partite state distinguishability for an important tripartite system. We analyze the smallest tripartite Unextendible Product Basis (UPB). This UPB has interesting symmetries and is not entangled. Our work is an important step towards full analysis of local information in locally indistinguishable sets of states. We consider the case in which the parties can only use Local Operations and Classical Communication, which makes perfect distinguishability impossible. We expose our discovery of optimal protocols for distinguishing our UPB.