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

Physical Review A

Entanglement and perfect discrimination of a class of multiqubit states by local operations and classical communication

Somshubhro Bandyopadhyay

Published Feb 25, 2010• 17 citations
Publisher

Abstract

It is shown that while entanglement ensures difficulty in discriminating a set of mutually orthogonal states perfectly by local operations and classical communication (LOCC), entanglement content does not. In particular, for a class of entangled multiqubit states, the maximum number of perfectly LOCC distinguishable orthogonal states is shown to be independent of the average entanglement of the states, and the spatial configuration with respect to which LOCC operations may be carried out. It is also pointed out that for this class, the makeup of an ensemble, that is whether it consists only of entangled states or not, determines the maximum number of perfectly distinguishable states.

DOI
10.1103/physreva.81.022327

Related papers

On entanglement and perfect LOCC discrimination of a class of multiqubit states

Somshubhro Bandyopadhyay

It is shown that while entanglement remains a significant factor in discriminating a set of mutually orthogonal entangled states perfectly by local operations and classical communication (LOCC), entanglement content is not. In particular, for a class of entangled multi-qubit states, the maximum number of perfectly LOCC distinguishable orthogonal states is shown to be independent of the average entanglement of the states, and the spatial configuration with respect to which LOCC operations may be carried out. It is also pointed out that the make-up of an ensemble, that is, whether it consists only of entangled states or is a mix of both entangled and product states, determines the maximum number of perfectly distinguishable states.

arXiv:0907.1754•Jul 10, 2009•0 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

Three maximally entangled states can require two-way local operations and classical communication for local discrimination

Michael Nathanson

We show that there exist sets of three mutually orthogonal $d$-dimensional maximally entangled states which cannot be perfectly distinguished using one-way local operations and classical communication (LOCC) for arbitrarily large values of $d$. This contrasts with several well-known families of maximally entangled states, for which any three states can be perfectly distinguished. We then show that two-way LOCC is sufficient to distinguish these examples. We also show that any three mutually orthogonal $d$-dimensional maximally entangled states can be perfectly distinguished using measurements with a positive partial transpose (PPT) and can be distinguished with one-way LOCC with high probability. These results circle around the question of whether there exist three maximally entangled states which cannot be distinguished using the full power of LOCC; we discuss possible approaches to answer this question.

arXiv:1310.4220•Physical Review A•Dec 12, 2013•69 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•46 citations

More assistance of entanglement, less rounds of classical communication

Atanu Bhunia, Indranil Biswas, Indrani Chattopadhyay +1 more

Abstract Classical communication plays a crucial role to distinguish locally a class of quantum states. Despite considerable advances, we have very little knowledge about the number of measurement and communication rounds needed to implement a discrimination task by local quantum operations and classical communications (in short, LOCC). In this paper, we are able to show the relation between round numbers with the local discrimination of a set of pure bipartite orthogonal quantum states. To demonstrate the possible strong dependence on the round numbers, we consider a class of orthogonal product states in d ⊗ d , which require at least 2 d − 2 round of classical communications. Curiously the round number can be reduced to d by the assistance of one-ebit of entanglement as resource and can be reduced further by assistance of more entanglement. We are also able to show that the number of LOCC rounds needed for a discrimination task may depend on the amount of entanglement assistance.

arXiv:2303.13645•Journal of Physics A Mathematical and Theoretical•Aug 7, 2023•7 citations

Entanglement cost of discriminating noisy Bell states by local operations and classical communication

Somshubhro Bandyopadhyay, Vincent M. Russo

Entangled states can help in quantum-state discrimination by local operations and classical communication (LOCC). For example, a Bell state is necessary (and sufficient) to perfectly discriminate a set of either three or four Bell states by LOCC. In this paper, we consider the task of LOCC discrimination of the states of noisy Bell ensembles, where a given ensemble consists of the states obtained by mixing the Bell states with an arbitrary two-qubit state with nonzero probabilities. It is proved that a Bell state is required for optimal discrimination by LOCC, even though the ensembles do not contain, in general, any maximally entangled state and, in specific instances, any entangled state.

arXiv:2106.08721•Physical Review A•Sep 30, 2021•11 citations
It is shown that while entanglement ensures difficulty in discriminating a set of mutually orthogonal states perfectly by local operations and classical communication (LOCC), entanglement content does not. In particular, for a class of entangled multiqubit states, the maximum number of perfectly LOCC distinguishable orthogonal states is shown to be independent of the average entanglement of the states, and the spatial configuration with respect to which LOCC operations may be carried out. It is also pointed out that for this class, the makeup of an ensemble, that is whether it consists only of entangled states or not, determines the maximum number of perfectly distinguishable states.
It is shown that while entanglement remains a significant factor in discriminating a set of mutually orthogonal entangled states perfectly by local operations and classical communication (LOCC), entanglement content is not. In particular, for a class of entangled multi-qubit states, the maximum number of perfectly LOCC distinguishable orthogonal states is shown to be independent of the average entanglement of the states, and the spatial configuration with respect to which LOCC operations may be carried out. It is also pointed out that the make-up of an ensemble, that is, whether it consists only of entangled states or is a mix of both entangled and product states, determines the maximum number of perfectly distinguishable states.
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.
We show that there exist sets of three mutually orthogonal ddd-dimensional maximally entangled states which cannot be perfectly distinguished using one-way local operations and classical communication (LOCC) for arbitrarily large values of ddd. This contrasts with several well-known families of maximally entangled states, for which any three states can be perfectly distinguished. We then show that two-way LOCC is sufficient to distinguish these examples. We also show that any three mutually orthogonal ddd-dimensional maximally entangled states can be perfectly distinguished using measurements with a positive partial transpose (PPT) and can be distinguished with one-way LOCC with high probability. These results circle around the question of whether there exist three maximally entangled states which cannot be distinguished using the full power of LOCC; we discuss possible approaches to answer this question.
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.
Abstract Classical communication plays a crucial role to distinguish locally a class of quantum states. Despite considerable advances, we have very little knowledge about the number of measurement and communication rounds needed to implement a discrimination task by local quantum operations and classical communications (in short, LOCC). In this paper, we are able to show the relation between round numbers with the local discrimination of a set of pure bipartite orthogonal quantum states. To demonstrate the possible strong dependence on the round numbers, we consider a class of orthogonal product states in d ⊗ d , which require at least 2 d − 2 round of classical communications. Curiously the round number can be reduced to d by the assistance of one-ebit of entanglement as resource and can be reduced further by assistance of more entanglement. We are also able to show that the number of LOCC rounds needed for a discrimination task may depend on the amount of entanglement assistance.
Entangled states can help in quantum-state discrimination by local operations and classical communication (LOCC). For example, a Bell state is necessary (and sufficient) to perfectly discriminate a set of either three or four Bell states by LOCC. In this paper, we consider the task of LOCC discrimination of the states of noisy Bell ensembles, where a given ensemble consists of the states obtained by mixing the Bell states with an arbitrary two-qubit state with nonzero probabilities. It is proved that a Bell state is required for optimal discrimination by LOCC, even though the ensembles do not contain, in general, any maximally entangled state and, in specific instances, any entangled state.