Related papers: Inefficiency and classical communication bounds fo…

We study the amount of communication needed for two parties to transform some given joint pure state into another one, either exactly or with some fidelity. Specifically, we present a method to lower bound this communication cost even when…

It is known that general convertibility of bipartite entangled states is not possible to arbitrary error without some classical communication. While some trade-offs between communication cost and conversion error have been proven, these…

We consider implementations of a bipartite unitary on many pairs of unknown input states by local operation and classical communication assisted by shared entanglement. We investigate to what extent the entanglement cost and the classical…

We solve the problem of the optimal cloning of pure entangled two-qubit states with a fixed degree of entanglement using local operations and classical communication. We show, that amazingly, classical communication between the parties can…

Entanglement concentration requires no classical communication, but the best prior art result for diluting to N copies of a partially entangled state requires an amount of communication on the order of sqrt(N) bits. Our main result is to…

Entanglement bits or ``ebits'' have been proposed as a quantitative measure of a fundamental resource in quantum information processing. For such an interpretation to be valid, it is important to show that the same number of ebits in…

We analyze implementations of bipartite unitaries by means of local operations and classical communication (LOCC) assisted by shared entanglement. We employ concepts and techniques developed in quantum Shannon theory to study an asymptotic…

Two dual questions in quantum information theory are to determine the communication cost of simulating a bipartite unitary gate, and to determine their communication capacities. We present a bipartite unitary gate with two surprising…

We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of particles in an entangled quantum state. We prove linear lower bounds for…

Quantum entanglement distillation protocols are LOCC protocols between Alice and Bob that convert imperfect EPR pairs, or, in general, partially entangled bipartite states into perfect or near-perfect EPR pairs. The classical communication…

We propose a probabilistic two-party communication complexity scenario with a prior nonmaximally entangled state, which results in less communication than that is required with only classical random correlations. A simple all-optical…

We analyze the difference in the local distinguishability among the following three restrictions; (i) Local operations and only one-way classical communications (one-way LOCC) are permitted. (ii) Local operations and two-way classical…

We present an improved protocol for entanglement purification of bipartite mixed states. The protocol requires two-way classical communication and hence implies an improved lower bound on the quantum capacity with two-way classical…

We construct the protocols to achieve probabilistic and deterministic entanglement transformations for bipartite pure states by means of local operations and classical communication. A new condition on pure contraction transformations is…

We present an optimal scheme to realize the transformations between single copies of two bipartite entangled states without classical communication between the sharing parties. The scheme achieves the upper bound for the success…

Any deterministic bipartite entanglement transformation involving finite copies of pure states and carried out using local operations and classical communication (LOCC) results in a net loss of entanglement. We show that for almost all such…

We show that entanglement guarantees difficulty in the discrimination of orthogonal multipartite states locally. The number of pure states that can be discriminated by local operations and classical communication is bounded by the total…

Bell's theorem implies that the outcomes of local measurements on two maximally entangled systems cannot be simulated without classical communication between the parties. The communication cost is finite for n Bell states, but it grows…

Entanglement assistance is known to reduce the quantum communication complexity of evaluating functions with distributed inputs. But does the type of entanglement matter, or are EPR pairs always sufficient? This is a natural question…

We present a general theoretical framework for both deterministic and probabilistic entanglement transformations of bipartite pure states achieved via local operations and classical communication. This framework unifies and greatly…