Related papers: Inner bounds via simultaneous decoding in quantum …

We show that quantum-to-classical channels, i.e., quantum measurements, can be asymptotically simulated by an amount of classical communication equal to the quantum mutual information of the measurement, if sufficient shared randomness is…

We initiate the study of quantifying nonlocalness of a bipartite measurement by the minimum amount of classical communication required to simulate the measurement. We derive general upper bounds, which are expressed in terms of certain…

In this paper, we provide a simple framework for deriving one-shot achievable bounds for some problems in quantum information theory. Our framework is based on the joint convexity of the exponential of the collision relative entropy, and is…

We determine the capacity of compound classical-quantum channels. As a consequence we obtain the capacity formula for the averaged classical-quantum channels. The capacity result for compound channels demonstrates, as in the classical…

We prove the first non-trivial one-shot inner bounds for sending quantum information over an entanglement unassisted two-sender quantum multiple access channel (QMAC) and an unassisted two-sender two-receiver quantum interference channel…

In information theory, we often use intersection and union of the typical sets to analyze various communication problems. However, in the quantum setting it is not very clear how to construct a measurement which behaves analogously to…

Optimally encoding classical information in a quantum system is one of the oldest and most fundamental challenges of quantum information theory. Holevo's bound places a hard upper limit on such encodings, while the…

In supervised learning, an inductive learning algorithm extracts general rules from observed training instances, then the rules are applied to test instances. We show that this splitting of training and application arises naturally, in the…

We investigate how much information about a quantum system can be simultaneously communicated to independent observers, by establishing quantitative limits to bipartite quantum correlations in many-body systems. As recently reported in…

A strong converse bound for the classical identification capacity of a quantum channel is an upper bound on the asymptotic identification rate of classical messages sent through the channel, such that, above this rate, the probability of an…

When classical or quantum information is broadcast to separate receivers, there exist codes that encrypt the encoded data such that the receivers cannot recover it when performing local operations and classical communication, but they can…

We consider a setting where a stream of qubits is processed sequentially. We derive fundamental limits on the rate at which classical information can be transmitted using qubits that decohere as they wait to be processed. Specifically, we…

We study entanglement-assisted quantum and classical communication over a single use of a quantum channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. We obtain characterizations of…

We consider the problem of error control in a coded, multicast network, focusing on the scenario where the errors can occur only on a proper subset of the network edges. We model this problem via an adversarial noise, presenting a formal…

We present two approaches for transmitting classical information over quantum broadcast channels. The first technique is a quantum generalization of the superposition coding scheme for the classical broadcast channel. We use a quantum…

We consider the problem of communicating over a classical-quantum (CQ) multiple access channel with random classical states non-causally available at the transmitter, referred to as a QMSTx. QMSTx is a classical-quantum multiple access…

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 find a strong-converse bound on the private capacity of a quantum channel assisted by unlimited two-way classical communication. The bound is based on the max-relative entropy of entanglement and its proof uses a new inequality for the…

We prove that the classical capacity of an arbitrary quantum channel assisted by a free classical feedback channel is bounded from above by the maximum average output entropy of the quantum channel. As a consequence of this bound, we…

We present some results that show that bounds from classical coding theory still work in many cases of quantum coding theory.