We show that incompatible ``higher-order quantum theoretic testing procedures", known as quantum testers, perform better in distinguishing causal quantum networks than its compatible counterparts. To demonstrate our finding, we consider a specific two-party quantum comb discrimination (QCD) game based on the task in which a receiver gets a black-box that implements a quantum comb and they attempt to determine which comb it implements based on prior information. We show that the receiver does better at winning the game when they have exclusive access to incompatible testers over compatible ones. Our investigation generalises the earlier finding that the incompatibility of POVMs is a {\em bona fide} resource in quantum state distinguishability. We also show that any quantum resource in testers is useful in comb exclusion tasks using the resource measure, {\em convex weight}.
We show that incompatible ``higher-order quantum theoretic testing procedures", known as quantum testers, perform better in distinguishing causal quantum networks than its compatible counterparts. To demonstrate our finding, we consider a specific two-party quantum comb discrimination (QCD) game based on the task in which a receiver gets a black-box that implements a quantum comb and they attempt to determine which comb it implements based on prior information. We show that the receiver does better at winning the game when they have exclusive access to incompatible testers over compatible ones. Our investigation generalises the earlier finding that the incompatibility of POVMs is a {\em bona fide} resource in quantum state distinguishability. We also show that any quantum resource in testers is useful in comb exclusion tasks using the resource measure, {\em convex weight}.
The existence of incompatible measurements, epitomized by Heisenberg's uncertainty principle, is one of the distinctive features of quantum theory. So far, quantum incompatibility has been studied for measurements that test the preparation of physical systems. Here we extend the notion to measurements that test dynamical processes, possibly consisting of multiple time steps. Such measurements are known as testers and are implemented by interacting with the tested process through a sequence of state preparations, interactions, and measurements. Our first result is a characterization of the incompatibility of quantum testers, for which we provide necessary and sufficient conditions. Then we propose a quantitative measure of incompatibility. We call this measure the robustness of incompatibility and define it as the minimum amount of noise that has to be added to a set of testers in order to make them compatible. We show that (i) the robustness is lower bounded by the distinguishability of the sequence of interactions used by the tester and (ii) maximum robustness is attained when the interactions are perfectly distinguishable. The general results are illustrated in the concrete example of binary testers probing the time evolution of a single-photon polarization.
We introduce operational tasks for measurement incompatibility in the form of multiobject quantum subchannel discrimination and exclusion games with prior information, where a player can simultaneously harness the resources contained within both a quantum state and a set of measurements. We show that any fully or partially resourceful pair of objects is useful for a suitably chosen multiobject subchannel discrimination and exclusion game with prior information. The advantage provided by a fully or partially resourceful object against all possible fully free objects in such a game can be quantified in a manner by the resource quantifiers of generalized robustness and the weight of a resource for discrimination and exclusion games, respectively. These results hold for arbitrary properties of quantum states as well as for arbitrary properties of sets of measurements closed under classical pre- and postprocessing and, consequently, include measurement incompatibility as a particular case. We furthermore show that these results are not exclusive to quantum theory, but can also be extended to the realm of general probabilistic theories.
Recent developments surrounding resource theories have shown that any quantum state or measurement resource, with respect to a convex (and compact) set of resourceless objects, provides an advantage in a tailored subchannel or state discrimination task, respectively. Here we show that an analogous, more general result is also true in the case of dynamical quantum resources, i.e., channels and instruments. In the scenario we consider, the tasks associated to a resource are input-output games. The advantage a resource provides in these games is naturally quantified by a generalized robustness measure. We illustrate our approach by applying it to a broad collection of examples, including classical and measure-and-prepare channels, measurement and channel incompatibility, local operations assisted by classical communication, and steering, as well as discussing its applicability to other resources in, e.g., quantum thermodynamics. We finish by showing that our approach generalizes to higher-order dynamics where it can be used, for example, to witness causal properties of supermaps.
It is one of the peculiar features of quantum physics that some sets of measurements are incompatible in the sense that they cannot be performed simultaneously. Incompatibility is an important quantum resource as it enables Bell nonlocality and steering. Here we show that incompatibility is crucial also in certain communication tasks; we prove that quantum random access code performs better than its classical counterpart only when incompatible quantum measurements are used in the decoding task. As a consequence, evaluating the average success probability for quantum random access code provides a semi-device-independent test for the detection of quantum incompatibility. We further demonstrate that any incompatible pair of projective measurements gives an advantage over all classical strategies. Finally, we establish a connection between the maximal average success probability for quantum random access code and earlier quantities introduced to assess incompatibility.
We consider the quantum resource theory of measurement informativeness and introduce a weight-based quantifier of informativeness. We show that this quantifier has operational significance from the perspective of quantum state exclusion, by showing that it precisely captures the advantage a measurement provides in minimising the error in this game. We furthermore introduce information theoretic quantities related to exclusion, in particular the notion of excludible information of a quantum channel, and show that for the case of quantum-to-classical channels it is determined precisely by the weight of informativeness. This establishes a three-way correspondence which sits in parallel to the recently discovered correspondence in quantum resource theories between robustness-based quantifiers, discrimination games, and accessible information. We conjecture that the new correspondence between a weight-based quantifier and an exclusion-based task found in this work is a generic correspondence that holds in the context of quantum resource theories.
A key ingredient in quantum resource theories is a notion of measure. Such as a measure should have a number of fundamental properties, and desirably also a clear operational meaning. Here we show that a natural measure known as the convex weight, which quantifies the resource cost of a quantum device, has all the desired properties. In particular, the convex weight of any quantum resource corresponds exactly to the relative advantage it offers in an exclusion (or antidistinguishability) task. After presenting the general result, we show how the construction works for state assemblages, sets of measurements, and sets of transformations. Moreover, in order to bound the convex weight analytically, we give a complete characterization of the convex components and corresponding weights of such devices.