Capability of local operations and classical communication for distinguishing bipartite unitary operations

Abstract

The problem behind 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: (i) if such two unitary operations are perfectly distinguishable by global operations, then they are perfectly distinguishable by LOCC too, 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 commentSome typos have been removed. arXiv admin note: text overlap with arXiv:1708.00971

References in corpus (18)

• Local Distinguishability of Multipartite Orthogonal Quantum States
• Optimal Creation of Entanglement Using a Two--Qubit Gate
• Statistical distinguishability between unitary operations
• Using entanglement improves precision of quantum measurements
• Optimal discrimination of quantum operations
• Optimal local discrimination of two multipartite pure states
• The Perfect Distinguishability of Quantum Operations
• Unambiguous discrimination among quantum operations
• Local Distinguishability of Multipartite Unitary Operations
• Identification and Distance Measures of Measurement Apparatus
• Unambiguous discrimination among oracle operators
• Minimax discrimination of two Pauli channels
• Unitary transformations can be identified locally
• Local Entanglement Is Not Necessary for Perfect Discrimination between Unitary Operations Acting on Two-Qudits by LOCC
• Discrimination of two-qubit unitaries via local operations and classical communication
• Optimal discrimination between quantum operations
• Identification of a reversible quantum gate: assessing the resources
• Sequential scheme for locally discriminating bipartite unitary operations without inverses

Cited by in corpus (6)

• Optimal quantum discrimination of single-qubit unitary gates between two candidates
• Identifying quantum change points for Hamiltonians
• Query complexity of unitary operation discrimination
• Quantum process discrimination with restricted strategies
• Entanglement enhanced distinguishability of coherence-breaking channels
• Nonlocal characteristics and argand diagram of two-qubit gates