Quantum guessing games with posterior information.

Quantum guessing games form a versatile framework for studying different tasks of information processing. A quantum guessing game with posterior information uses quantum systems to encode messages and classical communication to give partial information after a quantum measurement has been performed. We present a general framework for quantum guessing games with posterior information and derive structure and reduction theorems that enable to analyze any such game. We formalize symmetry of guessing games and characterize the optimal measurements in cases where the symmetry is related to an irreducible representation. The application of guessing games to incompatibility detection is reviewed and clarified. All the presented main concepts and results are demonstrated with examples.

Quantum Incompatibility Witnesses.

We demonstrate that quantum incompatibility can always be detected by means of a state discrimination task with partial intermediate information. This is done by showing that only incompatible measurements allow for an efficient use of premeasurement information in order to improve the probability of guessing the correct state. Thus, the gap between the guessing probabilities with pre- and postmeasurement information is a witness of the incompatibility of a given collection of measurements. We prove that all linear incompatibility witnesses can be implemented as some state discrimination protocol according to this scheme. As an application, we characterize the joint measurability region of two noisy mutually unbiased bases.

Probing quantum state space: does one have to learn everything to learn something?

Determining the state of a quantum system is a consuming procedure. For this reason, whenever one is interested only in some particular property of a state, it would be desirable to design a measurement set-up that reveals this property with as little effort as possible. Here, we investigate whether, in order to successfully complete a given task of this kind, one needs an informationally complete measurement, or if something less demanding would suffice. The first alternative means that in order to complete the task, one needs a measurement which fully determines the state. We formulate the task as a membership problem related to a partitioning of the quantum state space and, in doing so, connect it to the geometry of the state space. For a general membership problem, we prove various sufficient criteria that force informational completeness, and we explicitly treat several physically relevant examples. For the specific cases that do not require informational completeness, we also determine bounds on the minimal number of measurement outcomes needed to ensure success in the task.

Verifying the Quantumness of Bipartite Correlations.

Entanglement is at the heart of most quantum information tasks, and therefore considerable effort has been made to find methods of deciding the entanglement content of a given bipartite quantum state. Here, we prove a fundamental limitation to deciding if an unknown state is entangled or not: we show that any quantum measurement which can answer this question for an arbitrary state necessarily gives enough information to identify the state completely. We also extend our treatment to other classes of correlated states by considering the problem of deciding if a state has negative partial transpose, is discordant, or is fully classically correlated. Remarkably, only the question related to quantum discord can be answered without resorting to full state tomography.