When asymptotic LOCC offers no advantage over finite LOCC

Abstract

We consider bipartite LOCC, the class of operations implementable by local quantum operations and classical communication between two parties. Surprisingly, there are operations that cannot be implemented with finitely many messages but can be approximated to arbitrary precision with more and more messages. This significantly complicates the analysis of what can or cannot be approximated with LOCC. Towards alleviating this problem, we exhibit two scenarios in which allowing vanishing error does not help. The first scenario involves implementation of measurements with projective product measurement operators. The second scenario is the discrimination of unextendible product bases on two 3-dimensional systems.

Cited by in corpus (5)

• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders
• Tight asymptotic bounds on local hypothesis testing between a pure bipartite state and the white noise state
• General approach to quantum channel impossibility by local operations and classical communication
• Devising local protocols for multipartite quantum measurements
• Local approximation of multipartite quantum measurements