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:2611.08940

Local distinguishability of five five-partite orthogonal product states

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

Published Nov 6, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2611.08940

Related papers

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 five quadripartite orthogonal product states

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

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.

quant-pharXiv:2610.29622•Oct 22, 2026•1 citation

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

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

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

Framework for distinguishability of orthogonal bipartite states by one-way local operations and classical communication

Tanmay Singal

In the topic of perfect local distinguishability of orthogonal multipartite quantum states, most results obtained so far pertain to bipartite systems whose subsystems are of specific dimensions. In contrast very few results for bipartite systems whose subsystems are of arbitrary dimensions, are known. This is because a rich variety of (algebraic or geometric) structure is exhibited by different sets of orthogonal states owing to which it is difficult to associate some common property underlying them all, i.e., a common property that would play a crucial role in the local distinguishability of these states. In this Rapid Communication, I propose a framework for the distinguishability by one-way local operations and classical communication (1-LOCC) of sets of orthogonal bipartite states in a ${d}_{A}\ensuremath{\bigotimes}{d}_{B}$ bipartite system, where ${d}_{A},{d}_{B}$ are the dimensions of both subsytems, labeled as $A$ and $B$. I show that if the $i\mathrm{th}$ party (where $i=A,B$) can initiate a 1-LOCC protocol to perfectly distinguish among a set of orthogonal bipartite states, then the information of the existence of such a 1-LOCC protocol lies in a subspace of ${d}_{i}\ifmmode\times\else\texttimes\fi{}{d}_{i}$ Hermitian matrices, denoted by ${\mathcal{T}}_{\ensuremath{\perp}}^{(i)}$, and that the method to extract this information (of the existence of this 1-LOCC protocol) from ${\mathcal{T}}_{\ensuremath{\perp}}^{(i)}$ depends on the value of $\mathrm{dim}{\mathcal{T}}_{\ensuremath{\perp}}^{(i)}$. In this way one can give sweeping results for the 1-LOCC (in)distinguishability of all sets of orthogonal bipartite states corresponding to certain values of $\mathrm{dim}{\mathcal{T}}_{\ensuremath{\perp}}^{(i)}$. Thus I propose that the value of $\mathrm{dim}{\mathcal{T}}_{\ensuremath{\perp}}^{(i)}$ gives the common underlying property based on which sweeping results for the 1-LOCC (in)distinguishability of orthogonal bipartite quantum states can be made.

arXiv:1509.08450•Physical Review A•Mar 7, 2016•6 citations
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.
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.
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.
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.
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.
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.
In the topic of perfect local distinguishability of orthogonal multipartite quantum states, most results obtained so far pertain to bipartite systems whose subsystems are of specific dimensions. In contrast very few results for bipartite systems whose subsystems are of arbitrary dimensions, are known. This is because a rich variety of (algebraic or geometric) structure is exhibited by different sets of orthogonal states owing to which it is difficult to associate some common property underlying them all, i.e., a common property that would play a crucial role in the local distinguishability of these states. In this Rapid Communication, I propose a framework for the distinguishability by one-way local operations and classical communication (1-LOCC) of sets of orthogonal bipartite states in a ${d}_{A}\ensuremath{\bigotimes}{d}_{B}$ bipartite system, where dA,dB{d}_{A},{d}_{B}dA​,dB​ are the dimensions of both subsytems, labeled as AAA and BBB. I show that if the ithi\mathrm{th}ith party (where i=A,Bi=A,Bi=A,B) can initiate a 1-LOCC protocol to perfectly distinguish among a set of orthogonal bipartite states, then the information of the existence of such a 1-LOCC protocol lies in a subspace of ${d}_{i}\ifmmode\times\else\texttimes\fi{}{d}_{i}$ Hermitian matrices, denoted by ${\mathcal{T}}_{\ensuremath{\perp}}^{(i)}$, and that the method to extract this information (of the existence of this 1-LOCC protocol) from ${\mathcal{T}}_{\ensuremath{\perp}}^{(i)}$ depends on the value of $\mathrm{dim}{\mathcal{T}}_{\ensuremath{\perp}}^{(i)}$. In this way one can give sweeping results for the 1-LOCC (in)distinguishability of all sets of orthogonal bipartite states corresponding to certain values of $\mathrm{dim}{\mathcal{T}}_{\ensuremath{\perp}}^{(i)}$. Thus I propose that the value of $\mathrm{dim}{\mathcal{T}}_{\ensuremath{\perp}}^{(i)}$ gives the common underlying property based on which sweeping results for the 1-LOCC (in)distinguishability of orthogonal bipartite quantum states can be made.