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

Local distinguishability of quantum states in bipartite systems

Xiaoqian Zhang, Guo, Cheng, Weiqi Luo, Xiaoqing Tan

Published Dec 23, 2017• 5 citations
arXivHTMLPDF

Abstract

In this article, we show a sufficient and necessary condition for locally distinguishable bipartite states via one-way local operations and classical communication (LOCC). With this condition, we present some minimal structures of one-way LOCC indistinguishable quantum state sets. As long as an indistinguishable subset exists in a state set, the set is not distinguishable. We also list several distinguishable sets as instances.

DOI
10.48550/arxiv.1712.08830

Related papers

Classifying locally distinguishable sets: No activation across bipartitions

Atanu Bhunia, Saronath Halder, Ritabrata Sengupta

A set of orthogonal quantum states is said to be locally indistinguishable if they cannot be perfectly distinguished by local operations and classical communication (LOCC). Otherwise, the states are locally distinguishable. Interestingly, locally indistinguishable states can have productive applications in quantum information processing protocols. In this sense, locally indistinguishable states are useful. On the other hand, it is usual to consider that locally distinguishable states are useless. Nevertheless, recent works suggest that locally distinguishable states should be given due consideration as in certain situations these states can be converted to locally indistinguishable states under orthogonality-preserving LOCC (OP-LOCC). Such a counterintuitive phenomenon motivates us to ask when the aforesaid conversion is possible and when it is not. In this work, we provide different structures of locally distinguishable product and entangled states which do not allow the aforesaid conversion. We also provide certain structures of locally distinguishable states which allow the aforesaid conversion. In this way, we classify the locally distinguishable sets by introducing hierarchies among them. In a multipartite system, this study becomes more involved as there exist multipartite locally distinguishable sets which cannot be converted to locally indistinguishable sets by OP-LOCC across any bipartition. We say this as ``no activation across bi-partitions".

arXiv:2507.10698•Physical Review A•Jan 30, 2026•2 citations

Conditions for local transformations between sets of quantum states

Somshubhro Bandyopadhyay, Saronath Halder, Ritabrata Sengupta

We study the problem of transforming a set of pure bipartite states into another using deterministic LOCC (local operations and classical communication). Necessary conditions for the existence of such a transformation are obtained using LOCC constraints on state transformation, entanglement, and distinguishability. These conditions are shown to be independent but not sufficient. We discuss their satisfiability and classify all possible input-output pairs of sets accordingly. We also prove that strict inclusions hold between LOCC, separable, and positive partial transpose operations for set transformation problems.

arXiv:2204.08821•Physical Review A•Jun 23, 2022•0 citations

An algorithm for one-way LOCC distinguishability of orthogonal bipartite states

Meng-Meng Si, Zhihui Li, Chen‐Ming Bai

Local distinguishability of quantum states is a basic problem in quantum information theory. For an arbitrary group of entangled states in d ⊗ d bipartite system, Singal presented a subspace related to these states, and then he determined that the group of states can be distinguished by one-way local operations and classical communication(1-LOCC) if this subspace contains a maximally Abelian subspace. In this paper according to Singal's results, we present an algorithm to distinguish orthogonal bipartite states in d ⊗ d system based on 1-LOCC; we gives a sufficient condition to judge whether generalized orthogonal quantum states in 4 ⊗ 4 can be distinguished. Finally, we show an corresponding example to verify the conclusion.

IEEE International Conference on Nanotechnology (IEEE-NANO)•Jul 1, 2017•0 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•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

Distinguishing maximally entangled states by one-way local operations and classical communication

Zhichao Zhang, Keqin Feng, Fei Gao +1 more

In this paper, we mainly study the local indistinguishability of mutually orthogonal bipartite maximally entangled states. We construct sets of fewer than $d$ orthogonal maximally entangled states which are not distinguished by one-way local operations and classical communication (LOCC) in the Hilbert space of $d\ensuremath{\bigotimes}d$. The proof, based on the Fourier transform of an additive group, is very simple but quite effective. Simultaneously, our results give a general unified upper bound for the minimum number of one-way LOCC indistinguishable maximally entangled states. This improves previous results which only showed sets of $N\ensuremath{\ge}d\ensuremath{-}2$ such states. Finally, our results also show that previous conjectures in Zhang et al. [Z.-C. Zhang, Q.-Y. Wen, F. Gao, G.-J. Tian, and T.-Q. Cao, Quant. Info. Proc. 13, 795 (2014)] are indeed correct.

Physical Review A•Jan 21, 2015•26 citations
In this article, we show a sufficient and necessary condition for locally distinguishable bipartite states via one-way local operations and classical communication (LOCC). With this condition, we present some minimal structures of one-way LOCC indistinguishable quantum state sets. As long as an indistinguishable subset exists in a state set, the set is not distinguishable. We also list several distinguishable sets as instances.
A set of orthogonal quantum states is said to be locally indistinguishable if they cannot be perfectly distinguished by local operations and classical communication (LOCC). Otherwise, the states are locally distinguishable. Interestingly, locally indistinguishable states can have productive applications in quantum information processing protocols. In this sense, locally indistinguishable states are useful. On the other hand, it is usual to consider that locally distinguishable states are useless. Nevertheless, recent works suggest that locally distinguishable states should be given due consideration as in certain situations these states can be converted to locally indistinguishable states under orthogonality-preserving LOCC (OP-LOCC). Such a counterintuitive phenomenon motivates us to ask when the aforesaid conversion is possible and when it is not. In this work, we provide different structures of locally distinguishable product and entangled states which do not allow the aforesaid conversion. We also provide certain structures of locally distinguishable states which allow the aforesaid conversion. In this way, we classify the locally distinguishable sets by introducing hierarchies among them. In a multipartite system, this study becomes more involved as there exist multipartite locally distinguishable sets which cannot be converted to locally indistinguishable sets by OP-LOCC across any bipartition. We say this as ``no activation across bi-partitions".
We study the problem of transforming a set of pure bipartite states into another using deterministic LOCC (local operations and classical communication). Necessary conditions for the existence of such a transformation are obtained using LOCC constraints on state transformation, entanglement, and distinguishability. These conditions are shown to be independent but not sufficient. We discuss their satisfiability and classify all possible input-output pairs of sets accordingly. We also prove that strict inclusions hold between LOCC, separable, and positive partial transpose operations for set transformation problems.
Local distinguishability of quantum states is a basic problem in quantum information theory. For an arbitrary group of entangled states in d ⊗ d bipartite system, Singal presented a subspace related to these states, and then he determined that the group of states can be distinguished by one-way local operations and classical communication(1-LOCC) if this subspace contains a maximally Abelian subspace. In this paper according to Singal's results, we present an algorithm to distinguish orthogonal bipartite states in d ⊗ d system based on 1-LOCC; we gives a sufficient condition to judge whether generalized orthogonal quantum states in 4 ⊗ 4 can be distinguished. Finally, we show an corresponding example to verify the conclusion.
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.
In this paper, we mainly study the local indistinguishability of mutually orthogonal bipartite maximally entangled states. We construct sets of fewer than ddd orthogonal maximally entangled states which are not distinguished by one-way local operations and classical communication (LOCC) in the Hilbert space of $d\ensuremath{\bigotimes}d$. The proof, based on the Fourier transform of an additive group, is very simple but quite effective. Simultaneously, our results give a general unified upper bound for the minimum number of one-way LOCC indistinguishable maximally entangled states. This improves previous results which only showed sets of $N\ensuremath{\ge}d\ensuremath{-}2$ such states. Finally, our results also show that previous conjectures in Zhang et al. [Z.-C. Zhang, Q.-Y. Wen, F. Gao, G.-J. Tian, and T.-Q. Cao, Quant. Info. Proc. 13, 795 (2014)] are indeed correct.