No Arabic abstract
Recently, various non-classical properties of quantum states and channels have been characterized through an advantage they provide in specific quantum information tasks over their classical counterparts. Such advantage can be typically proven to be quantitative, in that larger amounts of quantum resources lead to better performance in the corresponding tasks. So far, these characterizations have been established only in the finite-dimensional setting. In this manuscript, we present a technique for extending the known results to the infinite-dimensional regime. The technique relies on approximating infinite-dimensional resource measures by their finite-dimensional counterparts. We give a sufficient condition for the approximation procedure to be tight, i.e. to match with established infinite-dimensional resource quantifiers, and another sufficient condition for the procedure to match with relevant extensions of these quantifiers. We show that various continuous variable quantum resources fall under these conditions, hence, giving them an operational interpretation through the advantage they can provide in so-called quantum games. Finally, we extend the interpretation to the max relative entropy in the infinite-dimensional setting.
The difficulty in manipulating quantum resources deterministically often necessitates the use of probabilistic protocols, but the characterization of their capabilities and limitations has been lacking. Here, we develop two general approaches to this problem. First, we introduce a new resource monotone based on the Hilbert projective metric and we show that it obeys a very strong type of monotonicity: it can rule out all transformations, probabilistic or deterministic, between states in any quantum resource theory. This allows us to place fundamental limitations on state transformations and restrict the advantages that probabilistic protocols can provide over deterministic ones, significantly strengthening previous findings and extending recent no-go theorems. We apply our results to obtain a substantial improvement in lower bounds for the errors and overheads of probabilistic distillation protocols, directly applicable to tasks such as entanglement or magic state distillation, and computable through convex optimization. In broad classes of resources, we show that no better restrictions on probabilistic protocols are possible -- our monotone can provide a necessary and sufficient condition for probabilistic resource transformations, thus allowing us to quantify exactly the highest fidelity achievable in resource distillation tasks by means of any probabilistic manipulation protocol. Complementing this approach, we introduce a general method for bounding achievable probabilities in resource transformations through a family of convex optimization problems. We show it to tightly characterize single-shot probabilistic distillation in broad types of resource theories, allowing an exact analysis of the trade-offs between the probabilities and errors in distilling maximally resourceful states.
The diverse range of resources which underlie the utility of quantum states in practical tasks motivates the development of universally applicable methods to measure and compare resources of different types. However, many of such approaches were hitherto limited to the finite-dimensional setting or were not connected with operational tasks. We overcome this by introducing a general method of quantifying resources for continuous-variable quantum systems based on the robustness measure, applicable to a plethora of physically relevant resources such as optical nonclassicality, entanglement, genuine non-Gaussianity, and coherence. We demonstrate in particular that the measure has a direct operational interpretation as the advantage enabled by a given state in a class of channel discrimination tasks. We show that the robustness constitutes a well-behaved, bona fide resource quantifier in any convex resource theory, contrary to a related negativity-based measure known as the standard robustness. Furthermore, we show the robustness to be directly observable -- it can be computed as the expectation value of a single witness operator -- and establish general methods for evaluating the measure. Explicitly applying our results to the relevant resources, we demonstrate the exact computability of the robustness for several classes of states.
Quantum channels underlie the dynamics of quantum systems, but in many practical settings it is the channels themselves that require processing. We establish universal limitations on the processing of both quantum states and channels, expressed in the form of no-go theorems and quantitative bounds for the manipulation of general quantum channel resources under the most general transformation protocols. Focusing on the class of distillation tasks -- which can be understood either as the purification of noisy channels into unitary ones, or the extraction of state-based resources from channels -- we develop fundamental restrictions on the error incurred in such transformations and comprehensive lower bounds for the overhead of any distillation protocol. In the asymptotic setting, our results yield broadly applicable bounds for rates of distillation. We demonstrate our results through applications to fault-tolerant quantum computation, where we obtain state-of-the-art lower bounds for the overhead cost of magic state distillation, as well as to quantum communication, where we recover a number of strong converse bounds for quantum channel capacity.
We present an optimal probabilistic protocol to distill quantum coherence. Inspired by a specific entanglement distillation protocol, our main result yields a strictly incoherent operation that produces one of a family of maximally coherent states of variable dimension from any pure quantum state. We also expand this protocol to the case where it is possible, for some initial states, to avert any waste of resources as far as the output states are concerned, by exploiting an additional transformation into a suitable intermediate state. These results provide practical schemes for efficient quantum resource manipulation.
Although entanglement is necessary for observing nonlocality in a Bell experiment, there are entangled states which can never be used to demonstrate nonlocal correlations. In a seminal paper [PRL 108, 200401 (2012)] F. Buscemi extended the standard Bell experiment by allowing Alice and Bob to be asked quantum, instead of classical, questions. This gives rise to a broader notion of nonlocality, one which can be observed for every entangled state. In this work we study a resource theory of this type of nonlocality referred to as Buscemi nonlocality. We propose a geometric quantifier measuring the ability of a given state and local measurements to produce Buscemi nonlocal correlations and establish its operational significance. In particular, we show that any distributed measurement which can demonstrate Buscemi nonlocal correlations provides strictly better performance than any distributed measurement which does not use entanglement in the task of distributed state discrimination. We also show that the maximal amount of Buscemi nonlocality that can be generated using a given state is precisely equal to its entanglement content. Finally, we prove a quantitative relationship between: Buscemi nonlocality, the ability to perform nonclassical teleportation, and entanglement. Using this relationship we propose new discrimination tasks for which nonclassical teleportation and entanglement lead to an advantage over their classical counterparts.