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

Local entanglement is not necessary for perfect discrimination between unitary operations acting on two qudits by local operations and classical communication

Lvzhou Li, Daowen Qiu

Published Mar 24, 2008• 18 citations
arXivHTMLPDF

Abstract

Recently, the problem of discriminating multipartite unitary operations by local operations and classical communication (LOCC) has attracted significant attention. The latest work in the literature on this problem showed that two multipartite unitary operations can always be perfectly distinguished by LOCC when a finite number of runs are allowable. However, in these schemes, local entanglement (an entangled state held by one party) was required, which seems to imply that local entanglement is necessary for perfect discrimination between unitary operations by LOCC. In this paper, we show that a perfect discrimination between two unitary operations acting on a two-qudit system can always be achieved without exploiting any entanglement. As a result, we conclude that local entanglement is not necessary for perfect discrimination between unitary operations acting on a two-qudit system by LOCC. Our result, in general, is based on the assumption made by X. F. Zhou, Y. S. Zhang, and G. C. Guo [Phys. Rev. Lett. 99, 170401 (2007)] that for any unitary operation $U$, we can obtain its reverse transformation ${U}^{\ifmmode\dagger\else\textdagger\fi{}}$ by exchanging the input and output ports of the whole setup. Thus, we further consider whether we can avoid using this assumption, and we find that for unitary operations acting on two qubits, our result can be obtained without using this assumption. However, in higher dimension how to do that seems to be unclear.

DOI
10.1103/physreva.77.032337

Related papers

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•15 citations

Capability of local operations and classical communication to distinguish bipartite unitary operations

Lvzhou Li, Shenggen Zheng, Haozhen Situ +1 more

The problem studied in this paper is, if the number of queries to unitary operations is fixed, say $k$, then when do local operations and classical communication (LOCC) suffice for optimally distinguishing bipartite unitary operations? We consider the above problem for two-qubit unitary operations in the case of $k=1$, showing that for two two-qubit entangling unitary operations without local parties, LOCC achieves the same distinguishability as the global operations. Specifically, we obtain the following: (i) if such two unitary operations are perfectly distinguishable by global operations, then they are perfectly distinguishable by LOCC also, and (ii) if they are not perfectly distinguishable by global operations, then LOCC can achieve the same optimal discrimination probability as the global operations.

arXiv:1711.03865•Physical Review A•Nov 20, 2017•11 citations

Local Distinguishability of Multipartite Unitary Operations

Runyao Duan, Yuan Feng, Mingsheng Ying

We show that any two different unitary operations acting on an arbitrary multipartite quantum system can be perfectly distinguished by local operations and classical communication when a finite number of runs is allowed. Intuitively, this result indicates that the lost identity of a nonlocal unitary operation can be recovered locally. No entanglement between distant parties is required.

arXiv:0705.1424•Physical Review Letters•Jan 17, 2008•56 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

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

LOCC distinguishability of unilaterally transformable quantum states

Somshubhro Bandyopadhyay, Sibasish Ghosh, Guruprasad Kar

We consider the question of perfect local distinguishability of mutually orthogonal bipartite quantum states, with the property that every state can be specified by a unitary operator acting on the local Hilbert space of Bob. We show that if the states can be exactly discriminated by one-way local operations and classical communication (LOCC) where Alice goes first, then the unitary operators can also be perfectly distinguished by an orthogonal measurement on Bob's Hilbert space. We give examples of sets of N ⩽ d maximally entangled states in d ⊗ d for d = 4,5,6 that are not perfectly distinguishable by one-way LOCC. Interestingly, for d = 5,6, our examples consist of four and five states, respectively. We conjecture that these states cannot be perfectly discriminated by two-way LOCC.

arXiv:1102.0841•New Journal of Physics•Dec 8, 2011•99 citations
Recently, the problem of discriminating multipartite unitary operations by local operations and classical communication (LOCC) has attracted significant attention. The latest work in the literature on this problem showed that two multipartite unitary operations can always be perfectly distinguished by LOCC when a finite number of runs are allowable. However, in these schemes, local entanglement (an entangled state held by one party) was required, which seems to imply that local entanglement is necessary for perfect discrimination between unitary operations by LOCC. In this paper, we show that a perfect discrimination between two unitary operations acting on a two-qudit system can always be achieved without exploiting any entanglement. As a result, we conclude that local entanglement is not necessary for perfect discrimination between unitary operations acting on a two-qudit system by LOCC. Our result, in general, is based on the assumption made by X. F. Zhou, Y. S. Zhang, and G. C. Guo [Phys. Rev. Lett. 99, 170401 (2007)] that for any unitary operation UUU, we can obtain its reverse transformation U\ifmmode†\else\textdagger\fi{U}^{\ifmmode\dagger\else\textdagger\fi{}}U\ifmmode†\else\textdagger\fi by exchanging the input and output ports of the whole setup. Thus, we further consider whether we can avoid using this assumption, and we find that for unitary operations acting on two qubits, our result can be obtained without using this assumption. However, in higher dimension how to do that seems to be unclear.
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.
The problem studied in this paper is, if the number of queries to unitary operations is fixed, say kkk, then when do local operations and classical communication (LOCC) suffice for optimally distinguishing bipartite unitary operations? We consider the above problem for two-qubit unitary operations in the case of k=1k=1k=1, showing that for two two-qubit entangling unitary operations without local parties, LOCC achieves the same distinguishability as the global operations. Specifically, we obtain the following: (i) if such two unitary operations are perfectly distinguishable by global operations, then they are perfectly distinguishable by LOCC also, and (ii) if they are not perfectly distinguishable by global operations, then LOCC can achieve the same optimal discrimination probability as the global operations.
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.
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.
We consider the question of perfect local distinguishability of mutually orthogonal bipartite quantum states, with the property that every state can be specified by a unitary operator acting on the local Hilbert space of Bob. We show that if the states can be exactly discriminated by one-way local operations and classical communication (LOCC) where Alice goes first, then the unitary operators can also be perfectly distinguished by an orthogonal measurement on Bob's Hilbert space. We give examples of sets of N ⩽ d maximally entangled states in d ⊗ d for d = 4,5,6 that are not perfectly distinguishable by one-way LOCC. Interestingly, for d = 5,6, our examples consist of four and five states, respectively. We conjecture that these states cannot be perfectly discriminated by two-way LOCC.