Related papers: Inefficiency and classical communication bounds fo…

We consider distillation of ebits between a specified pair of subsystems from pure tripartite states by local operations and classical communication. It is known that, allowing an asymptotically vanishing error, the maximal rate is the…

We find the minimum and the maximum value for the local energy of an arbitrary finite bipartite system for any given amount of entanglement, also identifying families of states reaching these bounds and sharing formal analogies with thermal…

In spite of many results in quantum information theory, the complex nature of compound systems is far from being clear. In general the information is a mixture of local, and non-local ("quantum") information. To make this point more clear,…

Linden, Massar and Popescu have recently given an optimization argument to show that a single two-qubit Werner state, or any other mixture of the maximally entangled Bell states, cannot be purified by local operations and classical…

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 promising platform for semi-device-independent quantum information is prepare-and-measure experiments restricted only by a bound on the energy of the communication. Here, we investigate the role of shared entanglement in such scenarios.…

Entanglement and entanglement-assisted are useful resources to enhance the mutual information of the Pauli channels, when the noise on consecutive uses of the channel has some partial correlations. In this Paper, we study…

We demonstrate a two-player communication problem that can be solved in the one-way quantum model by a 0-error protocol of cost O (log n) but requires exponentially more communication in the classical interactive (bounded error) model.

We present a two-player communication task that can be solved by a protocol of polylogarithmic cost in the simultaneous message passing model with classical communication and shared entanglement, but requires exponentially more…

We demonstrate how to universally simulate ensemble statistics of projective local measurements on any $n$-qubit state shared among $n$ observers with classical communication and shared randomness. Our technique originates from protocols…

We propose a protocol based on coherent states and linear optics operations for solving the appointment-scheduling problem. Our main protocol leaks strictly less information about each party's input than the optimal classical protocol, even…

It is shown that with the use of entanglement a specific two party communication task can be done with a systematically smaller expected error than any possible classical protocol could do. The example utilises the very tight correlation…

We show that entangling capacities based on the Jamiolkowski isomorphism may be used to place lower bounds on the communication capacities of arbitrary bipartite unitaries. Therefore, for these definitions, the relations which have been…

This work studies the quantum query complexity of Boolean functions in a scenario where it is only required that the query algorithm succeeds with a probability strictly greater than 1/2. We show that, just as in the communication…

I show that two distant parties can transform pure entangled states to arbitrary pure states by stochastic local operations and classical communication (SLOCC) at the single copy level, if they share bound entangled states. This is the…

There has been substantial progress recently in understanding toy problems of purely implicit signaling. These are problems where the source and the channel are implicit -- the message is generated endogenously by the system, and the plant…

We investigate two senders and one receiver multiparty communication scenario. Following Phys.Rev.A83, 062112 and arXiv : 2506.07699, we study multiparty communication bounded by dimension and distinguishability. We provide an explicit…

We introduce a measure of both quantum as well as classical correlations in a quantum state, the entanglement of purification. We show that the (regularized) entanglement of purification is equal to the entanglement cost of creating a state…

A highly entangled bipartite quantum state is more advantageous for the quantum dense coding protocol than states with low entanglement. Such a correspondence, however, does not exist even for pure quantum states in the multipartite domain.…

We provide rigorous, efficiently computable and tight bounds on the average error probability of multiple-copy discrimination between qubit mixed states by Local Operations assisted with Classical Communication (LOCC). In contrast to the…