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

Discriminating bipartite mixed states by local operations

Jin-Hua Zhang, Fulin Zhang, Zhi‐Xi Wang, Le-Min Lai, Shao-Ming Fei

Published Mar 12, 2020• 7 citations
arXivHTMLPDF

Abstract

Unambiguous state discrimination of two mixed bipartite states via local operations and classical communications (LOCC) is studied and compared with the result of a scheme realized via global measurement. We show that the success probability of a global scheme for mixed-state discrimination can be achieved perfectly by the local scheme. In addition, we simulate this discrimination via a pair of pure entangled bipartite states. This simulation is perfect for local rather than global schemes due to the existence of entanglement and global coherence in the pure states. We also prove that LOCC protocol and the sequential state discrimination (SSD) can be interpreted in a unified view. We then hybridize the LOCC protocol with three protocols (SSD, reproducing, and broadcasting) relying on classical communications. Such hybridizations extend the gaps between the optimal success probability of global and local schemes, which can be eliminated only for the SSD rather than the other two protocols.

DOI
10.1103/physreva.101.032316

Related papers

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

Unambiguous discrimination of fermionic states through local operations and classical communication

Matteo Lugli, Paolo Perinotti, Alessandro Tosini

The paper studies unambiguous discrimination of fermionic states through local operations and classical communication (LOCC). In the task of unambiguous discrimination, no error is tolerated but an inconclusive result is allowed. We show that contrary to the quantum case, it is not always possible to distinguish two fermionic states through LOCC unambiguously with the same success probability as if global measurements were allowed. Furthermore, we prove that we can overcome such a limit through an ancillary system made of two fermionic modes, independently of the dimension of the system, prepared in a maximally entangled state: in this case, LOCC protocols achieve the optimal success probability.

arXiv:2009.05657•Physical Review A•Jan 21, 2021•6 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

Discrimination of two-qubit unitaries via local operations and classical communication

Joonwoo Bae

Distinguishability is a fundamental and operational measure generally connected to information applications. In quantum information theory, from the postulates of quantum mechanics it often has an intrinsic limitation, which then dictates and also characterises capabilities of related information tasks. In this work, we consider discrimination between bipartite two-qubit unitary transformations by local operations and classical communication (LOCC) and its relations to entangling capabilities of given unitaries. We show that a pair of entangling unitaries which do not contain local parts, if they are perfectly distinguishable by global operations, can also be perfectly distinguishable by LOCC. There also exist non-entangling unitaries, e.g. local unitaries, that are perfectly discriminated by global operations but not by LOCC. The results show that capabilities of LOCC are strictly restricted than global operations in distinguishing bipartite unitaries for a finite number of repetitions, contrast to discrimination of a pair of bipartite states and also to asymptotic discrimination of unitaries.

arXiv:1601.07256•Scientific Reports•Dec 15, 2015•14 citations

Two-way classical communication remarkably improves local distinguishability

Masaki Owari, Masahito Hayashi

We analyze the difference in the local distinguishability among the following three restrictions: (i) local operations and only one-way classical communications (one-way LOCC) are permitted; (ii) local operations and two-way classical communications (two-way LOCC) are permitted; and (iii) all separable operations are permitted. We obtain two main results concerning the discrimination between a given bipartite pure state and the completely mixed state with the condition that the given state should be detected perfectly. As the first result, we derive the optimal discrimination protocol for a bipartite pure state in cases (i) and (iii). As the second result, by constructing a concrete two-way local discrimination protocol, it is proven that case (ii) is much better than case (i), i.e. two-way classical communication remarkably improves the local distinguishability in comparison with one-way classical communication at least for a low-dimensional bipartite pure state.

arXiv:0708.3154•New Journal of Physics•Jan 14, 2008•34 citations

On the Chernoff distance for asymptotic LOCC discrimination of bipartite quantum states

William Matthews, Andreas Winter

Motivated by the recent discovery of a quantum Chernoff theorem for asymptotic state discrimination, we investigate the distinguishability of two bipartite mixed states under the constraint of local operations and classical communication (LOCC), in the limit of many copies. While for two pure states a result of Walgate et al. shows that LOCC is just as powerful as global measurements, data hiding states (DiVincenzo et al.) show that locality can impose severe restrictions on the distinguishability of even orthogonal states. Here we determine the optimal error probability and measurement to discriminate many copies of particular data hiding states (extremal d times d Werner states) by a linear programming approach. Surprisingly, the single-copy optimal measurement remains optimal for n copies, in the sense that the best strategy is measuring each copy separately, followed by a simple classical decision rule. We also put a lower bound on the bias with which states can be distinguished by separable operations. This is a shortened version of a paper [1] recently submitted to Communications in Mathematical Physics; here the proofs have been omitted.

IEEE Information Theory Workshop (ITW)•May 1, 2008•9 citations
Unambiguous state discrimination of two mixed bipartite states via local operations and classical communications (LOCC) is studied and compared with the result of a scheme realized via global measurement. We show that the success probability of a global scheme for mixed-state discrimination can be achieved perfectly by the local scheme. In addition, we simulate this discrimination via a pair of pure entangled bipartite states. This simulation is perfect for local rather than global schemes due to the existence of entanglement and global coherence in the pure states. We also prove that LOCC protocol and the sequential state discrimination (SSD) can be interpreted in a unified view. We then hybridize the LOCC protocol with three protocols (SSD, reproducing, and broadcasting) relying on classical communications. Such hybridizations extend the gaps between the optimal success probability of global and local schemes, which can be eliminated only for the SSD rather than the other two protocols.
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.
The paper studies unambiguous discrimination of fermionic states through local operations and classical communication (LOCC). In the task of unambiguous discrimination, no error is tolerated but an inconclusive result is allowed. We show that contrary to the quantum case, it is not always possible to distinguish two fermionic states through LOCC unambiguously with the same success probability as if global measurements were allowed. Furthermore, we prove that we can overcome such a limit through an ancillary system made of two fermionic modes, independently of the dimension of the system, prepared in a maximally entangled state: in this case, LOCC protocols achieve the optimal success probability.
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.
Distinguishability is a fundamental and operational measure generally connected to information applications. In quantum information theory, from the postulates of quantum mechanics it often has an intrinsic limitation, which then dictates and also characterises capabilities of related information tasks. In this work, we consider discrimination between bipartite two-qubit unitary transformations by local operations and classical communication (LOCC) and its relations to entangling capabilities of given unitaries. We show that a pair of entangling unitaries which do not contain local parts, if they are perfectly distinguishable by global operations, can also be perfectly distinguishable by LOCC. There also exist non-entangling unitaries, e.g. local unitaries, that are perfectly discriminated by global operations but not by LOCC. The results show that capabilities of LOCC are strictly restricted than global operations in distinguishing bipartite unitaries for a finite number of repetitions, contrast to discrimination of a pair of bipartite states and also to asymptotic discrimination of unitaries.
We analyze the difference in the local distinguishability among the following three restrictions: (i) local operations and only one-way classical communications (one-way LOCC) are permitted; (ii) local operations and two-way classical communications (two-way LOCC) are permitted; and (iii) all separable operations are permitted. We obtain two main results concerning the discrimination between a given bipartite pure state and the completely mixed state with the condition that the given state should be detected perfectly. As the first result, we derive the optimal discrimination protocol for a bipartite pure state in cases (i) and (iii). As the second result, by constructing a concrete two-way local discrimination protocol, it is proven that case (ii) is much better than case (i), i.e. two-way classical communication remarkably improves the local distinguishability in comparison with one-way classical communication at least for a low-dimensional bipartite pure state.
Motivated by the recent discovery of a quantum Chernoff theorem for asymptotic state discrimination, we investigate the distinguishability of two bipartite mixed states under the constraint of local operations and classical communication (LOCC), in the limit of many copies. While for two pure states a result of Walgate et al. shows that LOCC is just as powerful as global measurements, data hiding states (DiVincenzo et al.) show that locality can impose severe restrictions on the distinguishability of even orthogonal states. Here we determine the optimal error probability and measurement to discriminate many copies of particular data hiding states (extremal d times d Werner states) by a linear programming approach. Surprisingly, the single-copy optimal measurement remains optimal for n copies, in the sense that the best strategy is measuring each copy separately, followed by a simple classical decision rule. We also put a lower bound on the bias with which states can be distinguished by separable operations. This is a shortened version of a paper [1] recently submitted to Communications in Mathematical Physics; here the proofs have been omitted.