Related papers: Separation between quantum Lov\'asz number and ent…
We solve the entanglement-assisted (EA) classical capacity region of quantum multiple-access channels with an arbitrary number of senders. As an example, we consider the bosonic thermal-loss multiple-access channel and solve the one-shot…
We present a communication protocol for the erasure channel assisted by backward classical communication, which achieves a significantly better rate than the best prior result. In addition, we prove an upper bound for the capacity of the…
We analyze the quantum capacity of a unital quantum channel, using ideas from the proof of near-optimality of Petz recovery map [Barnum and Knill 2000] and give an upper bound on the quantum capacity in terms of regularized output $2$-norm…
We construct a new entanglement-assisted quantum polar coding scheme which achieves the symmetric coherent information rate by synthesizing "amplitude" and "phase" channels from a given, arbitrary quantum channel. We first demonstrate the…
A contemporary technological milestone is to build a quantum device performing a computational task beyond the capability of any classical computer, an achievement known as quantum adversarial advantage. In what ways can the entanglement…
Quantum capacity, as the key figure of merit for a given quantum channel, upper bounds the channel's ability in transmitting quantum information. Identifying different type of channels, evaluating the corresponding quantum capacity and…
Capacity of a quantum channel characterizes the limits of reliable communication through a noisy quantum channel. This fundamental information theoretic question is very well studied specially in the setting of many independent uses of the…
The mathematical structure of quantum entanglement is studied and classified from the point of view of quantum compound states. We show that t he classical-quantum correspondences such as encodings can be treated as dia gonal (d-)…
We work out a theory of approximate quantum error correction that allows us to derive a general lower bound for the entanglement fidelity of a quantum code. The lower bound is given in terms of Kraus operators of the quantum noise. This…
We explore several new converse bounds for classical communication over quantum channels in both the one-shot and asymptotic regimes. First, we show that the Matthews-Wehner meta-converse bound for entanglement-assisted classical…
The quantum capacity captures the value of a quantum channel for transmitting quantum information, establishing the fundamental limits on quantum communication. In spite of its central role in quantum information theory, the quantum…
Shannon's theory of zero-error communication is re-examined in the broader setting of using one classical channel to simulate another exactly, and in the presence of various resources that are all classes of non-signalling correlations:…
We analyse the role of entanglement for transmission of classical information through a memoryless depolarising channel. Using the isotropic character of this channel we prove analytically that the mutual information cannot be increased by…
The logarithmic negativity of a bipartite quantum state is a widely employed entanglement measure in quantum information theory, due to the fact that it is easy to compute and serves as an upper bound on distillable entanglement. More…
A direct proof of the relation between the one-shot classical capacity and the minimal output entropy for covariant quantum channels is suggested. The structure of covariant channels is described in some detail. A simple proof of a general…
We define non-commutative versions of the vertex packing polytope, the theta convex body and the fractional vertex packing polytope of a graph, and establish a quantum version of the Sandwich Theorem of Gr\"{o}tschel, Lov\'{a}sz and…
We consider classical and entanglement-assisted versions of a distributed computation scheme that computes nonlinear Boolean functions of a set of input bits supplied by separated parties. Communication between the parties is restricted to…
We show that entanglement is a useful resource to enhance the mutual information of the depolarizing channel when the noise on consecutive uses of the channel has some partial correlations. We obtain a threshold in the degree of memory,…
Motivated by applications to covert quantum radar, we analyze a covert quantum sensing problem, in which a legitimate user aims at estimating an unknown parameter taking finitely many values by probing a quantum channel while remaining…
Recently there has been considerable activity on the subject of additivity of various quantum channel capacities. Here, we construct a family of channels with sharply bounded classical, hence private capacity. On the other hand, their…