We develop the general framework of virtual resource distillation, an alternative distillation strategy proposed in Phys. Rev. Lett. 132, 050203 (2024), which extends conventional quantum resource distillation by integrating the power of classical postprocessing. The framework presented here is applicable not only to quantum states, but also to dynamical quantum objects such as quantum channels and higher-order processes. We provide a general characterization and benchmarks for the performance of virtual resource distillation in the form of computable semidefinite programs as well as several operationally motivated quantities. We apply our general framework to various concrete settings of interest, including standard resource theories such as entanglement, coherence, and magic, as well as settings involving dynamical resources such as quantum memory, quantum communication, and non-Markovian dynamics. The framework of probabilistic distillation is also discussed.
We develop the general framework of virtual resource distillation, an alternative distillation strategy proposed in Phys. Rev. Lett. 132, 050203 (2024), which extends conventional quantum resource distillation by integrating the power of classical postprocessing. The framework presented here is applicable not only to quantum states, but also to dynamical quantum objects such as quantum channels and higher-order processes. We provide a general characterization and benchmarks for the performance of virtual resource distillation in the form of computable semidefinite programs as well as several operationally motivated quantities. We apply our general framework to various concrete settings of interest, including standard resource theories such as entanglement, coherence, and magic, as well as settings involving dynamical resources such as quantum memory, quantum communication, and non-Markovian dynamics. The framework of probabilistic distillation is also discussed.
Distillation, or purification, is central to the practical use of quantum resources in noisy settings often encountered in quantum communication and computation. Conventionally, distillation requires using some restricted "free" operations to convert a noisy state into one that approximates a desired pure state. Here, we propose to relax this setting by only requiring the approximation of the measurement statistics of a target pure state, which allows for additional classical postprocessing of the measurement outcomes. We show that this extended scenario, which we call "virtual resource distillation," provides considerable advantages over standard notions of distillation, allowing for the purification of noisy states from which no resources can be distilled conventionally. We show that general states can be virtually distilled with a cost (measurement overhead) that is inversely proportional to the amount of existing resource, and we develop methods to efficiently estimate such cost via convex and semidefinite programming, giving several computable bounds. We consider applications to coherence, entanglement, and magic distillation, and an explicit example in quantum teleportation (distributed quantum computing). This work opens a new avenue for investigating generalized ways to manipulate quantum resources.
Quantum resource distillation converts imperfect resource states into highly resourceful targets and is a central task in quantum information processing. When distillation is probabilistic, unfavorable outcomes may be discarded and the quality of the output is evaluated conditioned on success, leading to a notion of reliability that differs from the deterministic setting. Here we study the conditional error exponents of probabilistic quantum resource distillation under approximately resource-nongenerating instruments and derive its general connection to the postselected composite quantum hypothesis testing against the corresponding set of free states. This reduction leads naturally to scale-invariant projective distinguishability measures and provides finite-blocklength bounds for a broad class of resource theories. We apply the framework to entanglement, coherence, and magic. For entanglement and magic, we obtain exact zero-rate asymptotic characterizations of the conditional error exponent in terms of regularized projective distinguishability, while for coherence we derive general finite-blocklength and asymptotic bounds. For representative entangled and magic states, the resulting quantities can be evaluated analytically and reveal regimes in which postselection yields a strictly larger conditional error exponent than deterministic distillation. Furthermore, we also show that the conditional error exponents for probabilistic entanglement distillation under a strictly positive success probability constraint are smaller than those with no constraints on the success probability.
Noise is, in general, inevitable and detrimental to practical and useful quantum communication and computation. Under the resource theory framework, resource distillation serves as a generic tool to overcome the effect of noise. Yet, conventional resource distillation protocols generally require operations on multiple copies of resource states, and strong limitations exist that restrict their practical utilities. Recently, by relaxing the setting of resource distillation to only approximating the measurement statistics instead of the quantum state, a resource-frugal protocol, "virtual resource distillation," is proposed, which allows more effective distillation of noisy resources. Here, we report its experimental implementation on a photonic quantum system for the distillation of quantum coherence (up to dimension four) and bipartite entanglement. We show the virtual distillation of the maximal superposed state of dimension four from the state of dimension two, an impossible task in conventional coherence distillation. Furthermore, we demonstrate the virtual distillation of entanglement with operations acting only on a single copy of the noisy Einstein-Podolsky-Rosen (EPR) pair and showcase the quantum teleportation task using the virtually distilled EPR pair with a significantly improved fidelity of the teleported state. These results illustrate the feasibility of the virtual resource distillation method and pave the way for accurate manipulation of quantum resources with noisy quantum hardware.
Quantum technologies rely on high-quality resource states, such as maximally entangled or private states, which are indispensable for quantum communication and cryptography. In practice, however, these states are inevitably degraded by noise. Distillation protocols aim to recover high-resource states from multiple imperfect copies, and while stabilizer-based methods have demonstrated high performance in entanglement purification, they have yet to be established for broader tasks such as secret-key distillation. This work introduces a unified framework for stabilizer-based resource distillation in systems of prime local dimension. By formulating stabilizer routines as quantum channels and deriving closed-form expressions for their output, we enable the application of stabilizer operations to general input states and diverse distillation objectives. We identify key invariances in resource measures, such as coherent and private information, and demonstrate how they can be leveraged to significantly reduce the numerical complexity of channel optimization. To illustrate the framework's versatility, we introduce several protocols: gF-IMAX for general fidelity optimization, and (S)CI-IMAX and (S)PI-IMAX for optimizing (smooth) coherent and private information in both asymptotic and one-shot regimes. Our numerical results confirm that these protocols effectively tailor stabilizer channels to specific operational tasks, establishing them as a robust and flexible tool for quantum resource distillation.
We develop a general framework for higher-order quantum resources that treats the resourcefulness of quantum states, channels, and supermaps (also called processes) in a unified manner. By generalizing well-established concepts from resource theories of states and channels, we introduce and study supermap resource monotones and supermap distillation and dilution. As free supermaps, we consider free networks (supermaps that can be implemented with free channels), compatible supermaps (sets of supermaps closed under arbitrary composition), and maximally free superchannels. Specializing to approximate channel-to-channel conversions, we show that under mild assumptions, the conversion error with respect to the diamond distance and the worst-case infidelity coincide. We then apply the general framework to resource theories of dynamical coherence, where we establish the existence of largest sets of compatible supermaps. By characterizing these sets with semidefinite constraints, we show that they are strictly larger than the corresponding free networks but do not contain all maximally free superchannels. We finish by investigating the operational differences of these sets in one-shot channel distillation and dilution, providing solutions for both tasks in the parallel setting and for dilution in the adaptive setting.
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.