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:1909.10440 · Physical Review A

Locally distinguishing quantum states with limited classical communication

Saronath Halder, Chirag Srivastava

Published May 7, 2020• 15 citations
arXivHTMLPDF

Abstract

We consider different settings of the task to distinguish pure orthogonal quantum states under local operations and a limited amount of classical communication. In the first setting, the spatially separated parties are allowed to perform only local projective measurements without any classical communication during the measurements. Under such a restricted class of operations, if the states are indistinguishable, then within a second group of settings, the parties are allowed to use an additional resource for the distinguishing. The additional resource is either a pure entangled state or multiple identical copies of the given states. Comparisons between these two types of resources are also done in certain cases. Both probabilistic discrimination and perfect discrimination of the states are considered for the second group of settings. Within a third setting, the parties perform local projective measurements with a restriction on the availability of classical communication during the measurements. But in this setting the parties are allowed to use a maximally entangled state as a resource.

DOI
10.1103/physreva.101.052313

Related papers

Distinguishability and Indistinguishability by Local Operations and Classical Communication

Heng Fan

It is well known that orthogonal quantum states can be distinguished perfectly. However, if we assume that these orthogonal quantum states are shared by spatially separated parties, the distinguishability of these shared quantum states may be completely different. We show that a set of linearly independent quantum states ${({U}_{m,n}\ensuremath{\bigotimes}I){\ensuremath{\rho}}^{AB}({U}_{m,n}^{\ifmmode\dagger\else\textdagger\fi{}}\ensuremath{\bigotimes}I){}}_{m,n=0}^{d\ensuremath{-}1}$, where ${U}_{m,n}$ are generalized Pauli matrices, cannot be discriminated deterministically or probabilistically by local operations and classical communication. On the other hand, any $l$ maximally entangled states from this set are locally distinguishable if $l(l\ensuremath{-}1)\ensuremath{\le}2d$. The explicit projecting measurements are obtained to locally discriminate these states. As an example, we show that four Werner states are locally indistinguishable.

arXiv:quant-ph/0311026•Physical Review Letters•Apr 30, 2004•216 citations

When Do Local Operations and Classical Communication Suffice for Two-Qubit State Discrimination?

Eric Chitambar, Runyao Duan, Min-Hsiu Hsieh

In this paper, we consider the conditions under which a given ensemble of two-qubit states can be optimally distinguished by local operations and classical communication (LOCC). We begin by completing the perfect distinguishability problem of two-qubit ensembles-both for separable operations and LOCC-by providing necessary and sufficient conditions for the perfect discrimination of one pure and one mixed state. Then, for the well-known task of minimum error discrimination, it is shown that almost all two-qubit ensembles consisting of three pure states cannot be optimally discriminated using LOCC. This is surprising considering that any two pure states can be distinguished optimally by LOCC. Special attention is given to ensembles that lack entanglement, and we prove an easy sufficient condition for when a set of three product states cannot be optimally distinguished by LOCC, thus providing new examples of the phenomenon known as non-locality without entanglement. We next consider an example of N parties who each share the same state but who are ignorant of its identity. The state is drawn from the rotationally invariant trine ensemble, and we establish a tight connection between the N-copy ensemble and Shor's lifted single-copy ensemble. For any finite N, we prove that optimal identification of the states cannot be achieved by LOCC; however, as N→∞, LOCC can indeed discriminate the states optimally. This is the first result of its kind. Finally, we turn to the task of unambiguous discrimination and derive new lower bounds on the LOCC inconclusive probability for symmetric states. When applied to the double trine ensemble, this leads to a rather different distinguishability character than when the minimum error probability is considered.

arXiv:1308.1737•IEEE Transactions on Information Theory•Jan 31, 2014•51 citations

Entanglement of minimal dimension and a class of local state discrimination problems

Saronath Halder, Suchetana Goswami

In this work, we construct small sets of bipartite orthogonal pure states that cannot be perfectly distinguished by local operations and classical communication (LOCC). We mention that not all the states within the constructed sets are necessarily entangled. However, such a set contains at least one entangled state which cannot be conclusively identified by LOCC (with nonzero probability). Then, we show that the states of any such set can be perfectly distinguished by LOCC using a minimal-dimensional entangled resource state. Clearly, here the entangled resource state provides an advantage irrespective of the dimension of the given set. Using this result, we also prove that any pure entangled state is useful as a resource to distinguish the states of any present set unambiguously with nonzero probability under LOCC. These sets exist in all two-qudit Hilbert spaces. Furthermore, it is possible to decrease the average entanglement content of such a set or to increase the cardinality of the set without changing certain properties of the same.

quant-pharXiv:2603.28284•Mar 31, 2026•0 citations

Locally distinguish orthogonal quantum states with entanglement resources

Zhichao Zhang

It is known that many sets of orthogonal quantum states, which cannot be distinguished perfectly by local operations and classical communication (LOCC), have been constructed. However, these discussions have left the following open question: How many entanglement resources are necessary and/or sufficient for this task to be possible with LOCC? In this paper, we present a local discrimination protocol which uses entanglement more efficiently than teleportation to distinguish one class of orthogonal product states in 3⊗3⊗3. Then, we generalize it for 3⊗3⊗...⊗3 quantum systems which has 3n parties. For the open question, our results offer rather general insight into why entanglement is useful for such tasks, and present a better understanding of the relationship between entanglement and nonlocality.

IEEE International Conference on Signal, Information and Data Processing (ICSIDP)•Dec 1, 2019•0 citations

Inequivalent Quantum Resources from Multipartite State Discrimination

Srijani Das, Tuhin Paul, Manasi Patra +2 more

Any two orthogonal quantum states can be perfectly distinguished via local operations and classical communication (LOCC), yet whether all orthogonal multipartite pairs incur an identical operational cost remains an open question. Here, we address the resource consumption required for local state discrimination across multipartite pair of states. We demonstrate that distinct pairs of orthogonal multipartite maximally entangled states require unequal amounts of quantum resources to achieve local distinguishability. Extending our framework beyond individual pairs, we analyze larger sets of both locally distinguishable and indistinguishable multipartite orthogonal states, revealing a nontrivial hierarchy in their entanglement consumption. These results show that the resource cost of LOCC discrimination is state-dependent, providing insight into the fine-grained structure of multipartite nonlocality.

quant-pharXiv:2610.10143•Oct 8, 2026•0 citations

Local distinguishability with preservation of entanglement

Scott M. Cohen

I consider the deterministic distinguishability of a set of orthogonal, bipartite states when only a single copy is available and the parties are restricted to local operations and classical communication, but with the additional requirement that entanglement must be preserved in the process. Several general theorems aimed at characterizing sets of states with which the parties can succeed in such a task are proven. These include (i) a maximum for the number of states when the Schmidt rank of every outcome must be at least a given minimum, (ii) an upper bound (equal to the dimension of Hilbert space if entanglement need not be preserved) for the sum over Schmidt ranks of the initial states when only one-way classical communication is allowed, and (iii) separately, a necessary and a sufficient condition on the states such that their original Schmidt ranks can always be preserved. Two additional theorems explicitly demonstrate a trade-off between the extent to which the set of states fill Hilbert space, as measured by their Schmidt ranks, and how refined the parties must make their measurements, an important factor in determining the Schmidt rank the state can retain after it has been identified. It is shown that our bound on the sum of Schmidt ranks can be exceeded if two-way communication is permitted, and this includes the case that entanglement need not be preserved, so that this sum can exceed the dimension of Hilbert space. Such questions, concerning how the various results are affected by the resources used by the parties (amount of classical communication and types of local operations), are addressed for each theorem. This subject is closely related to the problem of locally purifying an entangled state from a mixed state, which is of direct relevance to teleportation and dense coding using a mixed-state resource. In an appendix, I give an extremely simple and transparent proof of ``nonlocality without entanglement,'' a phenomenon originally discussed by Bennett and co-workers several years ago.

arXiv:quant-ph/0602026•Physical Review A•May 10, 2007•86 citations
We consider different settings of the task to distinguish pure orthogonal quantum states under local operations and a limited amount of classical communication. In the first setting, the spatially separated parties are allowed to perform only local projective measurements without any classical communication during the measurements. Under such a restricted class of operations, if the states are indistinguishable, then within a second group of settings, the parties are allowed to use an additional resource for the distinguishing. The additional resource is either a pure entangled state or multiple identical copies of the given states. Comparisons between these two types of resources are also done in certain cases. Both probabilistic discrimination and perfect discrimination of the states are considered for the second group of settings. Within a third setting, the parties perform local projective measurements with a restriction on the availability of classical communication during the measurements. But in this setting the parties are allowed to use a maximally entangled state as a resource.
It is well known that orthogonal quantum states can be distinguished perfectly. However, if we assume that these orthogonal quantum states are shared by spatially separated parties, the distinguishability of these shared quantum states may be completely different. We show that a set of linearly independent quantum states ${({U}_{m,n}\ensuremath{\bigotimes}I){\ensuremath{\rho}}^{AB}({U}_{m,n}^{\ifmmode\dagger\else\textdagger\fi{}}\ensuremath{\bigotimes}I){}}_{m,n=0}^{d\ensuremath{-}1}$, where Um,n{U}_{m,n}Um,n​ are generalized Pauli matrices, cannot be discriminated deterministically or probabilistically by local operations and classical communication. On the other hand, any lll maximally entangled states from this set are locally distinguishable if $l(l\ensuremath{-}1)\ensuremath{\le}2d$. The explicit projecting measurements are obtained to locally discriminate these states. As an example, we show that four Werner states are locally indistinguishable.
In this paper, we consider the conditions under which a given ensemble of two-qubit states can be optimally distinguished by local operations and classical communication (LOCC). We begin by completing the perfect distinguishability problem of two-qubit ensembles-both for separable operations and LOCC-by providing necessary and sufficient conditions for the perfect discrimination of one pure and one mixed state. Then, for the well-known task of minimum error discrimination, it is shown that almost all two-qubit ensembles consisting of three pure states cannot be optimally discriminated using LOCC. This is surprising considering that any two pure states can be distinguished optimally by LOCC. Special attention is given to ensembles that lack entanglement, and we prove an easy sufficient condition for when a set of three product states cannot be optimally distinguished by LOCC, thus providing new examples of the phenomenon known as non-locality without entanglement. We next consider an example of N parties who each share the same state but who are ignorant of its identity. The state is drawn from the rotationally invariant trine ensemble, and we establish a tight connection between the N-copy ensemble and Shor's lifted single-copy ensemble. For any finite N, we prove that optimal identification of the states cannot be achieved by LOCC; however, as N→∞, LOCC can indeed discriminate the states optimally. This is the first result of its kind. Finally, we turn to the task of unambiguous discrimination and derive new lower bounds on the LOCC inconclusive probability for symmetric states. When applied to the double trine ensemble, this leads to a rather different distinguishability character than when the minimum error probability is considered.
In this work, we construct small sets of bipartite orthogonal pure states that cannot be perfectly distinguished by local operations and classical communication (LOCC). We mention that not all the states within the constructed sets are necessarily entangled. However, such a set contains at least one entangled state which cannot be conclusively identified by LOCC (with nonzero probability). Then, we show that the states of any such set can be perfectly distinguished by LOCC using a minimal-dimensional entangled resource state. Clearly, here the entangled resource state provides an advantage irrespective of the dimension of the given set. Using this result, we also prove that any pure entangled state is useful as a resource to distinguish the states of any present set unambiguously with nonzero probability under LOCC. These sets exist in all two-qudit Hilbert spaces. Furthermore, it is possible to decrease the average entanglement content of such a set or to increase the cardinality of the set without changing certain properties of the same.
It is known that many sets of orthogonal quantum states, which cannot be distinguished perfectly by local operations and classical communication (LOCC), have been constructed. However, these discussions have left the following open question: How many entanglement resources are necessary and/or sufficient for this task to be possible with LOCC? In this paper, we present a local discrimination protocol which uses entanglement more efficiently than teleportation to distinguish one class of orthogonal product states in 3⊗3⊗3. Then, we generalize it for 3⊗3⊗...⊗3 quantum systems which has 3n parties. For the open question, our results offer rather general insight into why entanglement is useful for such tasks, and present a better understanding of the relationship between entanglement and nonlocality.
Any two orthogonal quantum states can be perfectly distinguished via local operations and classical communication (LOCC), yet whether all orthogonal multipartite pairs incur an identical operational cost remains an open question. Here, we address the resource consumption required for local state discrimination across multipartite pair of states. We demonstrate that distinct pairs of orthogonal multipartite maximally entangled states require unequal amounts of quantum resources to achieve local distinguishability. Extending our framework beyond individual pairs, we analyze larger sets of both locally distinguishable and indistinguishable multipartite orthogonal states, revealing a nontrivial hierarchy in their entanglement consumption. These results show that the resource cost of LOCC discrimination is state-dependent, providing insight into the fine-grained structure of multipartite nonlocality.
I consider the deterministic distinguishability of a set of orthogonal, bipartite states when only a single copy is available and the parties are restricted to local operations and classical communication, but with the additional requirement that entanglement must be preserved in the process. Several general theorems aimed at characterizing sets of states with which the parties can succeed in such a task are proven. These include (i) a maximum for the number of states when the Schmidt rank of every outcome must be at least a given minimum, (ii) an upper bound (equal to the dimension of Hilbert space if entanglement need not be preserved) for the sum over Schmidt ranks of the initial states when only one-way classical communication is allowed, and (iii) separately, a necessary and a sufficient condition on the states such that their original Schmidt ranks can always be preserved. Two additional theorems explicitly demonstrate a trade-off between the extent to which the set of states fill Hilbert space, as measured by their Schmidt ranks, and how refined the parties must make their measurements, an important factor in determining the Schmidt rank the state can retain after it has been identified. It is shown that our bound on the sum of Schmidt ranks can be exceeded if two-way communication is permitted, and this includes the case that entanglement need not be preserved, so that this sum can exceed the dimension of Hilbert space. Such questions, concerning how the various results are affected by the resources used by the parties (amount of classical communication and types of local operations), are addressed for each theorem. This subject is closely related to the problem of locally purifying an entangled state from a mixed state, which is of direct relevance to teleportation and dense coding using a mixed-state resource. In an appendix, I give an extremely simple and transparent proof of ``nonlocality without entanglement,'' a phenomenon originally discussed by Bennett and co-workers several years ago.