Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2610.29622

Local distinguishability of five quadripartite orthogonal product states

Guang-Bao Xu, Jie Zhan, Yu-Guang Yang, Dong-Huan Jiang

quant-phSubmitted Oct 21, 2026• Announced Oct 22, 2026• 1 citation• Revised Oct 29, 2026 (v2)
v1 · Oct 21, 2026v2 · Oct 29, 2026
arXivHTMLPDF

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.

Little sign of AI-generated textIncrementalStrong assumptionsOverclaimsPossible error

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.

Related papers

Local distinguishability of five five-partite orthogonal product states

Guang-Bao Xu, Jie Zhan, Yuguang Yang +1 more

The local distinguishability of five orthogonal product states (OPSs) has been studied in several multipartite settings, but the five-partite case still requires a systematic characterization. In this paper, we consider five five-partite OPSs, where any two states are orthogonal on exactly one subsystem. By analyzing the distribution of ten pairwise orthogonality relations over five subsystems, we classify the corresponding orthogonality structures by colored orthogonality graphs. After eliminating identical graphs under relabeling of states and permutation of subsystems, we obtain 443 different graphs in seven genuinely five-partite categories. We prove that the OPSs corresponding to 434 of these graphs can be perfectly distinguished by local operations and classical communication (LOCC), while the remaining 9 exceptional cases fall into two types and require separate analysis. Our results give a characterization of the local distinguishability of five OPSs in five-partite OPSs.

arXiv:2611.08940•Nov 6, 2026•0 citations

Local distinguishability of five orthogonal product states on bipartite and tripartite quantum systems

Guang-Bao Xu, Zi-Yan Hao, Hua-Kun Wang +2 more

Local distinguishability of orthogonal quantum states can effectively reduce the consumption of quantum resources and lower economic costs in quantum protocols. Although numerous achievements have been made regarding local distinguishability of orthogonal quantum states, some fundamental issues have not been effectively addressed. For example, the local distinguishability of five orthogonal product states (OPSs) is still unknown up to now. In this paper, we give the properties of local distinguishability of five OPSs on bipartite and tripartite quantum systems. Firstly, to characterize the structure of a set of bipartite OPSs, we propose the concept of the vector of orthogonal relations for a set of bipartite OPSs. Secondly, we classify the structures of five bipartite OPSs into six categories by this concept and prove that five of these six categories can be perfectly distinguished by local operations and classical communication (LOCC). Thirdly we show that the local distinguishability of each case of the sixth category singly. On the other hand, we first divide the structures of five tripartite OPSs into eight categories by the vectors of orthogonal relations of five tripartite OPSs. Then we give the local distinguishability of each category. Our work enriches the research results of quantum nonlocality and will provide a clear understanding of the local distinguishability of five OPSs.

quant-pharXiv:2512.00484•Physical Review A•Dec 2, 2025•1 citation

Local distinguishability of four multipartite orthogonal product states

Guang‐Bao Xu, Zi-Yan Hao, Hua-Kun Wang +2 more

In this paper, we give the local distinguishability of four orthogonal product states (OPSs) on multipartite and high-dimension systems. To characterize the different orthogonal relationships between four multipartite OPSs, a new concept, i.e., the vector of the numbers of pairwise orthogonal relations, is proposed. We classify four tripartite OPSs, any two of which are orthogonal only on one subsystem, into three categories by using the vectors of the numbers of pairwise orthogonal relations. We prove that any four tripartite OPSs belonging to two of the three categories can be perfectly distinguished by local operations and classical communication (LOCC). Meanwhile, we find an interesting phenomenon that two sets of four tripartite OPSs belonging to the remaining one of the three categories have different local distinguishability even if they have the same orthogonal graph. This means that the orthogonal graph is not a sufficient condition for determining the local distinguishability of a set of OPSs. Additionally, for the remaining category, we specify the conditions under which four tripartite OPSs can be locally distinguished and the conditions under which four tripartite OPSs cannot be perfectly distinguished by LOCC. On the other hand, we prove that any four tripartite OPSs with seven or more pairwise orthogonal relations can be perfectly distinguished by LOCC. Furthermore, we prove that any four OPSs with six or more pairwise orthogonal relations can be perfectly distinguished by LOCC on four-, five-, and six-partite systems.

Physical Review A•Sep 30, 2025•8 citations

Local distinguishability of six bipartite orthogonal product states

Guang-Bao Xu, Hua-Kun Wang, Yu-Guang Yang +1 more

It is necessary to investigate the local distinguishability of orthogonal quantum state sets, as their adoption in protocol design helps diminish quantum state transmission and cut operational costs. In this paper, we explore the local distinguishability of six orthogonal product states (OPSs) on any bipartite quantum system. We classify different sets of six bipartite OPSs into eight categories by using the vectors of the numbers of pairwise orthogonality relations, where any two states are orthogonal on only one subsystem within each set. We find that these eight categories contain a total of 78 distinct cases, all but five of which are perfectly distinguishable via local operations and classical communication (LOCC). Furthermore, we discuss the local distinguishability of those five distinct cases in detail. Our work explicitly characterizes the local distinguishability of six bipartite OPSs.

quant-pharXiv:2607.02006•Physical Review A•Jul 3, 2026•2 citations

Orthogonality and distinguishability: Criterion for local distinguishability of arbitrary orthogonal states

Ping‐Xing Chen, Cheng-Zu Li

We consider the relation between the orthogonality and the distinguishability of a set of arbitrary states (including multipartite states). It is shown that if a set of arbitrary states can be distinguished by local operations and classical communication (LOCC), each of the states can be written as a linear combination of product vectors such that all product vectors of one of the states are orthogonal to the other states. With this result we then prove a simple necessary condition for LOCC distinguishability of a class of orthogonal states. These conclusions may be useful in discussing the distinguishability of orthogonal quantum states further, understanding the essence of nonlocality and discussing the distillation of entanglement.

arXiv:quant-ph/0209048•Physical Review A•Dec 12, 2003•44 citations

Graph Structures for Local Distinguishability of Quantum Product States

Sooyeong Kim, David W. Kribs, Michael Nathanson +2 more

We consider the problem of distinguishing sets of quantum product states with local operations and classical communication (LOCC). Recent work has used graph theory to identify sets of product states distinguishable with one-way LOCC. We extend these efforts to full two-way LOCC, with the first significant analysis of the set of graphs corresponding to bipartite product states that can be distinguished with two-way protocols after finitely many steps. We derive basic closure properties of the set of distinguishable graphs and identify some classes of graphs that guarantee local distinguishability and some graphs that do not. We also include several examples and forward-looking comments.

quant-pharXiv:2606.26558•Linear Algebra and its Applications•Jun 26, 2026•0 citations
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.
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 371371371 graph classes. The paper establishes perfect LOCC distinguishability for 355355355 classes, leaving 161616 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)(2,2)(2,2) and (2,1,1)(2,1,1)(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.
The local distinguishability of five orthogonal product states (OPSs) has been studied in several multipartite settings, but the five-partite case still requires a systematic characterization. In this paper, we consider five five-partite OPSs, where any two states are orthogonal on exactly one subsystem. By analyzing the distribution of ten pairwise orthogonality relations over five subsystems, we classify the corresponding orthogonality structures by colored orthogonality graphs. After eliminating identical graphs under relabeling of states and permutation of subsystems, we obtain 443 different graphs in seven genuinely five-partite categories. We prove that the OPSs corresponding to 434 of these graphs can be perfectly distinguished by local operations and classical communication (LOCC), while the remaining 9 exceptional cases fall into two types and require separate analysis. Our results give a characterization of the local distinguishability of five OPSs in five-partite OPSs.
Local distinguishability of orthogonal quantum states can effectively reduce the consumption of quantum resources and lower economic costs in quantum protocols. Although numerous achievements have been made regarding local distinguishability of orthogonal quantum states, some fundamental issues have not been effectively addressed. For example, the local distinguishability of five orthogonal product states (OPSs) is still unknown up to now. In this paper, we give the properties of local distinguishability of five OPSs on bipartite and tripartite quantum systems. Firstly, to characterize the structure of a set of bipartite OPSs, we propose the concept of the vector of orthogonal relations for a set of bipartite OPSs. Secondly, we classify the structures of five bipartite OPSs into six categories by this concept and prove that five of these six categories can be perfectly distinguished by local operations and classical communication (LOCC). Thirdly we show that the local distinguishability of each case of the sixth category singly. On the other hand, we first divide the structures of five tripartite OPSs into eight categories by the vectors of orthogonal relations of five tripartite OPSs. Then we give the local distinguishability of each category. Our work enriches the research results of quantum nonlocality and will provide a clear understanding of the local distinguishability of five OPSs.
In this paper, we give the local distinguishability of four orthogonal product states (OPSs) on multipartite and high-dimension systems. To characterize the different orthogonal relationships between four multipartite OPSs, a new concept, i.e., the vector of the numbers of pairwise orthogonal relations, is proposed. We classify four tripartite OPSs, any two of which are orthogonal only on one subsystem, into three categories by using the vectors of the numbers of pairwise orthogonal relations. We prove that any four tripartite OPSs belonging to two of the three categories can be perfectly distinguished by local operations and classical communication (LOCC). Meanwhile, we find an interesting phenomenon that two sets of four tripartite OPSs belonging to the remaining one of the three categories have different local distinguishability even if they have the same orthogonal graph. This means that the orthogonal graph is not a sufficient condition for determining the local distinguishability of a set of OPSs. Additionally, for the remaining category, we specify the conditions under which four tripartite OPSs can be locally distinguished and the conditions under which four tripartite OPSs cannot be perfectly distinguished by LOCC. On the other hand, we prove that any four tripartite OPSs with seven or more pairwise orthogonal relations can be perfectly distinguished by LOCC. Furthermore, we prove that any four OPSs with six or more pairwise orthogonal relations can be perfectly distinguished by LOCC on four-, five-, and six-partite systems.
It is necessary to investigate the local distinguishability of orthogonal quantum state sets, as their adoption in protocol design helps diminish quantum state transmission and cut operational costs. In this paper, we explore the local distinguishability of six orthogonal product states (OPSs) on any bipartite quantum system. We classify different sets of six bipartite OPSs into eight categories by using the vectors of the numbers of pairwise orthogonality relations, where any two states are orthogonal on only one subsystem within each set. We find that these eight categories contain a total of 78 distinct cases, all but five of which are perfectly distinguishable via local operations and classical communication (LOCC). Furthermore, we discuss the local distinguishability of those five distinct cases in detail. Our work explicitly characterizes the local distinguishability of six bipartite OPSs.
We consider the relation between the orthogonality and the distinguishability of a set of arbitrary states (including multipartite states). It is shown that if a set of arbitrary states can be distinguished by local operations and classical communication (LOCC), each of the states can be written as a linear combination of product vectors such that all product vectors of one of the states are orthogonal to the other states. With this result we then prove a simple necessary condition for LOCC distinguishability of a class of orthogonal states. These conclusions may be useful in discussing the distinguishability of orthogonal quantum states further, understanding the essence of nonlocality and discussing the distillation of entanglement.
We consider the problem of distinguishing sets of quantum product states with local operations and classical communication (LOCC). Recent work has used graph theory to identify sets of product states distinguishable with one-way LOCC. We extend these efforts to full two-way LOCC, with the first significant analysis of the set of graphs corresponding to bipartite product states that can be distinguished with two-way protocols after finitely many steps. We derive basic closure properties of the set of distinguishable graphs and identify some classes of graphs that guarantee local distinguishability and some graphs that do not. We also include several examples and forward-looking comments.