Related papers: On the communication cost of entanglement transfor…
Suppose Alice and Bob share a maximally entangled state of any finite dimension and each perform two-outcome measurements on the respective part of the state. It is known, due to the recent result of Regev and Toner, that if a classical…
The quantum teleportation with noisy EPR state is discussed. Using an optimal decomposition technique, we compute the concurrence, entanglement of formation and Groverian measure for various noisy EPR resources. It is shown analytically…
We show that all multi-partite pure states can, under local operations, be transformed into bi-partite pairwise entangled states in a "lossless fashion": An arbitrary distinguished party will keep pairwise entanglement with all other…
Recent advances in quantum technology facilitate the realization of information processing using quantum computers at least on the small and intermediate scales of up to several dozens of qubits. We investigate entanglement cost required…
We study exact, non-deterministic conversion of multipartite pure quantum states into one-another via local operations and classical communication (LOCC) and asymptotic entanglement transformation under such channels. In particular, we…
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…
Entanglement is among the most fundamental-and at the same time puzzling-properties of quantum physics. Its modern description relies on a resource-theoretical approach, which treats entangled systems as a means to enable or accelerate…
High-fidelity quantum entanglement is a key resource for quantum communication and distributed quantum computing, enabling quantum state teleportation, dense coding, and quantum encryption. Any sources of decoherence in the communication…
Despite the apparent similarity between shared randomness and shared entanglement in the context of Communication Complexity, our understanding of the latter is not as good as of the former. In particular, there is no known "entanglement…
We study the preparation and distribution of high-fidelity multi-party entangled states via noisy channels and operations. In the particular case of GHZ and cluster states, we study different strategies using bipartite or multipartite…
We present two protocols for the single-photon entanglement concentration. With the help of the 50:50 beam splitter, variable beam splitter and an auxiliary photon, we can concentrate a less-entangled single-photon state into a maximally…
We show that the minimal rate of noise needed to catalytically erase the entanglement in a bipartite quantum state is given by the regularized relative entropy of entanglement. This offers a solution to the central open question raised in…
In quantum state redistribution as introduced in [Luo and Devetak (2009)] and [Devetak and Yard (2008)], there are four systems of interest: the $A$ system held by Alice, the $B$ system held by Bob, the $C$ system that is to be transmitted…
Distribution of entanglement is an essential task in quantum information processing and the realization of quantum networks. In our work, we theoretically investigate the scenario where a central source prepares an N-partite entangled state…
We present two realistic entanglement concentration protocols (ECPs) for pure partially entangled photons. A partially entangled photon pair can be concentrated to a maximally entangled pair with only an ancillary single photon in a certain…
Different procedures have been developed in order to recover entanglement after propagation over a noisy channel. Besides a certain amount of noise, entanglement is completely lost and the channel is called entanglement breaking. Here we…
A class of lower bounds for the entanglement cost of any quantum state was recently introduced in [arXiv:2111.02438] in the form of entanglement monotones known as the tempered robustness and tempered negativity. Here we extend their…
A natural operational paradigm for distributed quantum and classical information processing involves local operations coordinated by multiple rounds of public communication. In this paper we consider the minimum number of communication…
We prove a general lower bound on the bounded-error entanglement-assisted quantum communication complexity of Boolean functions. The bound is based on the concept that any classical or quantum protocol to evaluate a function on distributed…
A common scenario in distributed computing involves a client who asks a server to perform a computation on a remote computer. An important problem is to determine the minimum amount of communication needed to specify the desired…