English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Recently, the problem of discriminating multipartite unitary operations bylocal operations and classical communication (LOCC) has attracted significantattention. The latest work in the literature on this problem showed that twomultipartite unitary operations can always be perfectly distinguished by LOCCwhen a finite number of runs are allowable. However, in these schemes, localentanglement (an entangled state holden by one party) was required, which seemsto imply that local entanglement is necessary for perfect discriminationbetween unitary operations by LOCC. In this article, we show that a perfectdiscrimination between two unitary operations acting on a two-qudits can alwaysbe achieved without exploiting any entanglement. As a result, we conclude thatlocal entanglement is not necessary for perfect discrimination between unitaryoperations acting on two-qudits by LOCC.

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