boltzmannian situation. The great conceptual puzzle of statistical mechanics is how a physical system, despite always being in some definite state, and evolving deterministically, can exhibit… (More)

A strong converse theorem for the classical capacity of a quantum channel states that the probability of correctly decoding a classical message converges exponentially fast to zero in the limit of… (More)

Degradable quantum channels are an important class of completely positive trace-preserving maps. Among other properties, they offer a single-letter formula for the quantum and the private classical… (More)

The purpose of these notes is to discuss the relation between the additivity questions regarding the quantities (Holevo) capacity of a quantum channel T and entanglement of formation of a bipartite… (More)

We establish an operational theory of coherence (or of superposition) in quantum systems, by focusing on the optimal rate of performance of certain tasks. Namely, we introduce the two basic… (More)

We show that there is of family of inequalities associated to each compatibility structure of a set of events (a graph), such that the bound for noncontextual theories is given by the independence… (More)

A strong converse theorem for the classical capacity of a quantum channel states that the probability of correctly decoding a classical message converges to zero in the limit of many channel uses, if… (More)

Strong subadditivity of von Neumann entropy, proved in 1973 by Lieb and Ruskai, is a cornerstone of quantum coding theory. All other known inequalities for entropies of quantum systems may be derived… (More)

Let A = {ρ1, . . . , ρn} be a given set of quantum states. We consider the problem of finding necessary and sufficient conditions on another set B = {σ1, . . . , σn} that guarantee the existence of a… (More)

A strong converse theorem for the classical capacity of a quantum channel states that the probability of correctly decoding a classical message converges exponentially fast to zero in the limit of… (More)