Abstract Quantifying purity is a basic problem in quantum information theory. When a quantum state passes through a quantum channel, its purity may be changed. In order to explore what role the quantum channel plays in this process, it is necessary to study the purity of quantum channels. In this paper, we formulate the quantum resource theory for channel purity. There are two basic elements in the quantum resource theory for channel purity: free channels and free superchannels. The free channels are completely randomizing channels which neither store nor output purity. The free superchannels are the uniformity preserving superchannels which do not generate resource channels from free ones. We also provide a method for the realization of a uniformity preserving superchannel. We quantify the purity of quantum channels by the robustness and show that the robustness of purity of a quantum channel (RPC) is a purity monotone. We obtain the efficient numerical calculation of RPC through semidefinite programming. Moreover, we find that the RPC has operational significance as the best advantage that one can obtain in the ensemble of quantum state discrimination games. As an application, we also study the RPC for some single-qubit channels.
Abstract Quantifying purity is a basic problem in quantum information theory. When a quantum state passes through a quantum channel, its purity may be changed. In order to explore what role the quantum channel plays in this process, it is necessary to study the purity of quantum channels. In this paper, we formulate the quantum resource theory for channel purity. There are two basic elements in the quantum resource theory for channel purity: free channels and free superchannels. The free channels are completely randomizing channels which neither store nor output purity. The free superchannels are the uniformity preserving superchannels which do not generate resource channels from free ones. We also provide a method for the realization of a uniformity preserving superchannel. We quantify the purity of quantum channels by the robustness and show that the robustness of purity of a quantum channel (RPC) is a purity monotone. We obtain the efficient numerical calculation of RPC through semidefinite programming. Moreover, we find that the RPC has operational significance as the best advantage that one can obtain in the ensemble of quantum state discrimination games. As an application, we also study the RPC for some single-qubit channels.
Abstract Recently, the projective robustness of quantum states was introduced in (Regula 2022 Phys. Rev. Lett. 128 110505). This demonstrates that the projective robustness is a useful resource monotone and can comprehensively characterize the capabilities and limitations of probabilistic protocols that manipulate quantum resources deterministically. In this paper, we will extend the projective robustness to any convex resource theory of quantum channels and measurements. First, we introduce the projective robustness of quantum channels and prove that it satisfies some good properties, especially sub-multiplicativity under any free quantum process. Moreover, we show that the projective robustness of channels quantifies the maximal advantage that a given channel outperforms all free channels in the simultaneous discrimination and exclusion of a fixed-state ensemble. Second, we define the projective robustness of quantum measurements and prove that it exactly quantifies the maximal advantage that a given measurement outperforms all free measurements in the simultaneous discrimination and exclusion of two fixed-state ensembles. Finally, within a specific channel resource setting based on measurement incompatibility, we show that the projective robustness of quantum channels coincides with the projective robustness of measurement incompatibility.
We initiate the systematic study of resource theories of quantum channels, i.e. of the dynamics that quantum systems undergo by completely positive maps, in abstracto: Resources are in principle all maps from one quantum system to another, but some maps are deemed free. The free maps are supposed to satisfy certain axioms, among them closure under tensor products, under composition and freeness of the identity map (the latter two say that the free maps form a monoid). The free maps act on the resources simply by tensor product and composition. This generalizes the much-studied resource theories of quantum states, and abolishes the distinction between resources (states) and the free maps, which act on the former, leaving only maps, divided into resource-full and resource-free ones. We discuss the axiomatic framework of quantifying channel resources, and show two general methods of constructing resource monotones of channels. Furthermore, we show that under mild regularity conditions, each resource theory of quantum channels has a distinguished monotone, the robustness (and its smoothed version), generalizing the analogous concept in resource theories of states. We give an operational interpretation of the log-robustness as the amount of heat dissipation (randomness) required for resource erasure by random reversible free maps, valid in broad classes of resource theories of quantum channels. Technically, this is based on an abstract version of the recent convex-split lemma, extended from its original domain of quantum states to ordered vector spaces with sufficiently well-behaved base norms (which includes the case of quantum channels with diamond norm or variants thereof). Finally, we remark on several key issues concerning the asymptotic theory.
We initiate the systematic study of resource theories of quantum channels, i.e. of the dynamics that quantum systems undergo by completely positive maps, in abstracto: Resources are in principle all maps from one quantum system to another, but some maps are deemed free. The free maps are supposed to satisfy certain axioms, among them closure under tensor products, under composition and freeness of the identity map (the latter two say that the free maps form a monoid). The free maps act on the resources simply by tensor product and composition. This generalizes the much-studied resource theories of quantum states, and abolishes the distinction between resources (states) and the free maps, which act on the former, leaving only maps, divided into resource-full and resource-free ones. We discuss the axiomatic framework of quantifying channel resources, and show two general methods of constructing resource monotones of channels. Furthermore, we show that under mild regularity conditions, each resource theory of quantum channels has a distinguished monotone, the robustness (and its smoothed version), generalizing the analogous concept in resource theories of states. We give an operational interpretation of the log-robustness as the amount of heat dissipation (randomness) required for resource erasure by random reversible free maps, valid in broad classes of resource theories of quantum channels. Technically, this is based on an abstract version of the recent convex-split lemma, extended from its original domain of quantum states to ordered vector spaces with sufficiently well-behaved base norms (which includes the case of quantum channels with diamond norm or variants thereof). Finally, we remark on several key issues concerning the asymptotic theory.
We extend the definition of the conditional min-entropy from bipartite quantum states to bipartite quantum channels. We show that many of the properties of the conditional min-entropy carry over to the extended version, including an operational interpretation as a guessing probability when one of the subsystems is classical. We then show that the extended conditional min-entropy can be used to fully characterize when two bipartite quantum channels are related to each other via a superchannel (also known as supermap or a comb) that is acting on one of the subsystems. This relation is a pre-order that extends the definition of “quantum majorization” from bipartite states to bipartite channels, and can also be characterized with semidefinite programming. As a special case, our characterization provides necessary and sufficient conditions for when a set of quantum channels is related to another set of channels via a single superchannel. We discuss the applications of our results to channel discrimination, and to resource theories of quantum processes. Along the way we study channel divergences, entropy functions of quantum channels, and noise models of superchannels, including random unitary superchannels and doubly-stochastic superchannels. For the latter we give a physical meaning as being completely-uniformity preserving.
Quantum communication relies on the existence of high quality quantum channels to exchange information. In practice, however, all communication links are affected by noise from the environment. Here we investigate the ability of quantum channels to perform quantum communication tasks by restricting the participants to use only local operations and one-way classical communication (one-way LOCC) along with the available quantum channel. In particular, a channel can be used to distill a highly entangled state between two parties, which further enables quantum or private communication. In this work, we invoke the framework of superchannels to study the distillation of a resourceful quantum state, such as a maximally entangled state or a private state, using multiple instances of a point-to-point quantum channel. We use the idea ofk-extendibility to obtain a semidefinite relaxation of the set of one-way LOCC superchannels and define a class of entanglement measures for quantum channels that decrease monotonically under such superchannels; therefore these measures, dubbed collectively the “unextendible entanglement of a channel”, yield upper bounds on several communication-theoretic quantities of interest in the regimes of resource distillation and zero error.We then generalize the formalism ofk-extendibility to bipartite superchannels, thus obtaining functions that are monotone under two-extendible superchannels. This allows us to analyze probabilistic distillation of ebits or secret key bits from a bipartite state when using a resourceful quantum channel. Moreover, we propose semidefinite programs to evaluate several of these quantities, providing a computationally feasible method of comparison between quantum channels for resource distillation.
Quantum channels are quintessential to quantum information, being used in all protocols, and describing how systems evolve in space and time. As such, they play a key role in the manipulation of quantum resources, and they are often resources themselves, called dynamical resources. This forces us to go beyond standard resource theories of quantum states. Here we provide a rigorous foundation for dynamical resource theories, where the resources into play are quantum channels, explaining how to manipulate dynamical resources with free superchannels. In particular, when the set of free superchannels is convex, we present a novel construction of an infinite and complete family of convex resource monotones, giving necessary and sufficient conditions for convertibility under free superchannels. After showing that the conversion problem in convex dynamical resource theories can be solved with conic linear programming, we define various resource-theoretic protocols for dynamical resources. These results serve as the framework for the study of concrete examples of theories of dynamical resources, such as dynamical entanglement theory.