Francesco Buscemi

The information-theoretic costs of simulating quantum measurements

Winter?s measurement compression theorem stands as one of the most penetrating insights of quantum information theory. In addition to making an original and profound statement about measurement in quantum theory, it also underlies several other general protocols used for entanglement distillation and local purity distillation. The theorem provides for an asymptotic decomposition of any quantum measurement into noise and information. This decomposition leads to an optimal protocol for having a sender simulate many independent instances of a quantum measurement and send the measurement outcomes to a receiver, using as little communication as possible. The protocol assumes that the parties have access to some amount of common randomness, which is a strictly weaker resource than classical communication. In this review, we provide a second look at Winter?s measurement compression theorem, detailing the information processing task, giving examples for understanding it, reviewing Winter?s achievability proof, and detailing a new approach to its single-letter converse theorem. We prove an extension of the theorem to the case in which the sender is not required to receive the outcomes of the simulated measurement. The total cost of common randomness and classical communication can be lower for such a ?non-feedback? simulation, and we prove a single-letter converse theorem demonstrating optimality. We then review the Devetak?Winter theorem on classical data compression with quantum side information, providing new proofs of its achievability and converse parts. From there, we outline a new protocol that we call ?measurement compression with quantum side information,? announced previously by two of us in our work on triple trade-offs in quantum Shannon theory. This protocol has several applications, including its part in the ?classically-assisted state redistribution? protocol, which is the most general protocol on the static side of the quantum information theory tree, and its role in reducing the classical communication cost in a task known as local purity distillation. We also outline a connection between measurement compression with quantum side information and recent work on entropic uncertainty relations in the presence of quantum memory. Finally, we prove a single-letter theorem characterizing measurement compression with quantum side information when the sender is not required to obtain the measurement outcome.

The Quantum Capacity of Channels With Arbitrarily Correlated Noise

We study optimal rates for quantum communication over a single use of a channel, which itself can correspond to a finite number of uses of a channel with arbitrarily correlated noise. The corresponding capacity is often referred to as the one-shot quantum capacity. In this paper, we prove bounds on the one-shot quantum capacity of an arbitrary channel. This allows us to compute the quantum capacity of a channel with arbitrarily correlated noise, in the limit of asymptotically many uses of the channel. In the memoryless case, we explicitly show that our results reduce to known expressions for the quantum capacity.

Clean positive operator valued measures

In quantum mechanics the statistics of the outcomes of a measuring apparatus is described by a positive operator valued measure (POVM). A quantum channel transforms POVMs into POVMs, generally irreversibly, thus losing some of the information retrieved from the measurement. This poses the problem of which POVMs are “undisturbed,” i.e., they are not irreversibly connected to another POVM. We will call such POVMs clean. In a sense, the clean POVMs would be “perfect,” since they would not have any additional “extrinsical” noise. Quite unexpectedly, it turns out that such a “cleanness” property is largely unrelated to the convex structure of POVMs, and there are clean POVMs that are not extremal and vice versa. In this article we solve the cleannes classification problem for number n of outcomes n⩽d (d dimension of the Hilbert space), and we provide a set of either necessary or sufficient conditions for n>d, along with an iff condition for the case of informationally complete POVMs for n=d2.

All entangled quantum states are nonlocal.

Departing from the usual paradigm of local operations and classical communication adopted in entanglement theory, we study here the interconversion of quantum states by means of local operations and shared randomness. A set of necessary and sufficient conditions for the existence of such a transformation between two given quantum states is given in terms of the payoff they yield in a suitable class of nonlocal games. It is shown that, as a consequence of our result, such a class of nonlocal games is able to witness quantum entanglement, however weak, and reveal nonlocality in any entangled quantum state. An example illustrating this fact is provided.

Complete Positivity, Markovianity, and the Quantum Data-Processing Inequality, in the Presence of Initial System-Environment Correlations

We show that complete positivity is not only sufficient but also necessary for the validity of the quantum data-processing inequality. As a consequence, the reduced dynamics of a quantum system are completely positive, even in the presence of initial correlations with its surrounding environment, if and only if such correlations do not allow any anomalous backward flow of information from the environment to the system. Our approach provides an intuitive information-theoretic framework to unify and extend a number of previous results.

Global information balance in quantum measurements.

We perform an information-theoretical analysis of quantum measurement processes and obtain the global information balance in quantum measurements, in the form of a closed chain equation for quantum mutual entropies. Our balance provides a tight and general entropic information-disturbance trade-off, and explains the physical mechanism underlying it. Finally, the single-outcome case, that is, the case of measurements with posts election, is briefly discussed.

Inverting quantum decoherence by classical feedback from the environment

We show that for qubits and qutrits it is always possible to perfectly recover quantum coherence by performing a measurement only on the environment, whereas for dimension d >3 there are situations where recovery is impossible, even with complete access to the environment. For qubits, the minimal amount of classical information to be extracted from the environment equals the entropy exchange.

Distilling entanglement from arbitrary resources

We obtain the general formula for the optimal rate at which singlets can be distilled from any given noisy and arbitrarily correlated entanglement resource by means of local operations and classical communication (LOCC). Our formula, obtained by employing the quantum information spectrum method, reduces to that derived by Devetak and Winter [Proc. R. Soc. London, Ser. A 461, 207 (2005)], in the special case of an independent and identically distributed resource. The proofs rely on a one-shot version of the so-called “hashing bound,” which, in turn, provides bounds on the one-shot distillable entanglement under general LOCC.

Comparison of Quantum Statistical Models: Equivalent Conditions for Sufficiency

A family of probability distributions (i.e. a statistical model) is said to be sufficient for another, if there exists a transition matrix transforming the probability distributions in the former to the probability distributions in the latter. The Blackwell-Sherman-Stein (BSS) Theorem provides necessary and sufficient conditions for one statistical model to be sufficient for another, by comparing their information values in statistical decision problems. In this paper we extend the BSS Theorem to quantum statistical decision theory, where statistical models are replaced by families of density matrices defined on finite-dimensional Hilbert spaces, and transition matrices are replaced by completely positive, trace-preserving maps (i.e. coarse-grainings). The framework we propose is suitable for unifying results that previously were independent, like the BSS theorem for classical statistical models and its analogue for pairs of bipartite quantum states, recently proved by Shmaya. An important role in this paper is played by statistical morphisms, namely, affine maps whose definition generalizes that of coarse-grainings given by Petz and induces a corresponding criterion for statistical sufficiency that is weaker, and hence easier to be characterized, than Petz’s.

Entanglement Cost in Practical Scenarios

We quantify the one-shot entanglement cost of an arbitrary bipartite state, that is, the minimum number of singlets needed by two distant parties to create a single copy of the state up to a finite accuracy, by using local operations and classical communication only. This analysis, in contrast to the traditional one, pertains to scenarios of practical relevance, in which resources are finite and transformations can be achieved only approximately. Moreover, it unveils a fundamental relation between two well-known entanglement measures, namely, the Schmidt number and the entanglement of formation. Using this relation, we are able to recover the usual expression of the entanglement cost as a special case.