arXiv:2610.29622
Local distinguishability of five quadripartite orthogonal product states
Guang-Bao Xu, Jie Zhan, Yu-Guang Yang, Dong-Huan Jiang
Abstract
The local distinguishability of five bipartite and tripartite orthogonal product states (OPSs) has been effectively resolved, while that of five quadripartite OPSs has not yet been effectively addressed. In this paper, we give the local distinguishability of five quadripartite OPSs, where any two of these five states are orthogonal on exactly one subsystem. Based on the vectors of the numbers of pairwise orthogonality relations, we classify different sets of five quadripartite OPSs into nine categories, which correspond to 371 distinct orthogonality graphs. We show that the sets of five quadripartite OPSs corresponding to 355 of the 371 cases can be perfectly distinguished by local operations and classical communication (LOCC), whereas the sets of five quadripartite OPSs for the remaining 16 cases cannot exactly distinguished by LOCC. Our results enrich the theory of nonlocality for sets of OPSs.
AI Summary
The paper studies perfect LOCC discrimination of five quadripartite orthogonal product states under the restriction that every pair is orthogonal on exactly one subsystem. It extends earlier classifications for five bipartite and tripartite product states, representing the orthogonality relations as a uniquely edge-colored complete graph on five vertices. For configurations with orthogonality relations on all four subsystems, the ten edges have nine possible distributions among parties. Identifying graphs under state relabeling and party permutation gives $371$ graph classes. The paper establishes perfect LOCC distinguishability for $355$ classes, leaving $16$ exceptional graphs grouped into four structural types. The positive results use case-by-case enumeration and local projective measurements that identify or exclude a state while preserving orthogonality, followed by known discrimination protocols for smaller product-state sets. Two reduction criteria cover vertices with local degree patterns $(2,2)$ and $(2,1,1)$, subject to an additional edge-color condition. For three exceptional graphs, explicit parameter-restricted families are proved indistinguishable by showing that every orthogonality-preserving first local POVM element is proportional to the identity on the local support. The other thirteen are analyzed through reductions involving a known exceptional four-state tripartite structure. The restriction to exactly one orthogonal subsystem per pair excludes general five-state quadripartite sets. Despite the abstract’s categorical wording, the detailed results leave distinguishability within the exceptional graphs dependent on local ranks or state parameters; they do not establish universal indistinguishability for all realizations of those graphs.
Central claim may not hold: The abstract's unconditional negative classification of 16 orthogonality graphs exceeds Section IV's parameter- and rank-restricted conclusions. The negative theorems for graphs (8-25), (10-27), and (10-43) establish indistinguishability only under additional parameter restrictions absent from the abstract. Section IV's reductions for the other 13 exceptions do not establish impossibility for every LOCC protocol, and a party with no orthogonality edges can still provide useful discrimination information. The explicit flagged construction for graph (8-3) satisfies the unique-subsystem orthogonality assumption and the stated three rank-two conditions but is perfectly LOCC-distinguishable, directly refuting the blanket negative classification.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.