Local Entanglement Is Not Necessary for Perfect Discrimination between Unitary Operations Acting on Two-Qudits by LOCC

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 holden by one party) was required, which seems to imply that local entanglement is necessary for perfect discrimination between unitary operations by LOCC. In this article, we show that a perfect discrimination between two unitary operations acting on a two-qudits 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 two-qudits by LOCC.

6 pages, 2 figures, we have added Lemma 5 and its proof, and some sentences have been modified and supplemented, as well

References in corpus (5)

• Experimental Quantum State Tomography of Optical Fields and Ultrafast Statistical Sampling
• Entanglement Is Not Necessary for Perfect Discrimination between Unitary Operations
• Local Distinguishability of Multipartite Unitary Operations
• Unambiguous discrimination among oracle operators
• Unitary transformations can be identified locally

Cited by in corpus (5)

• Capability of local operations and classical communication for distinguishing bipartite unitary operations
• Optimal quantum discrimination of single-qubit unitary gates between two candidates
• Sequential scheme for locally discriminating bipartite unitary operations without inverses
• Query complexity of unitary operation discrimination
• When is the Chernoff Exponent for Quantum Operations finite?