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.
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.
Abstract 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 establish universal limitations on the manipulation of quantum channel resources under the most general, adaptive transformation protocols. Focusing in particular 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 necessarily incurred in such transformations, applicable to many different settings in general resource theories. We introduce comprehensive lower bounds for the overhead of any physical distillation protocol in terms of required channel uses, imposing strong limitations on the practical efficiency and cost of channel manipulation protocols. In the asymptotic setting, our results yield broadly applicable strong converse bounds for the rates of distillation. As a special case, our methods apply to the manipulation of quantum states, in which case they significantly improve on and extend the recent no-go theorems for resource purification in [Fang and Liu, Phys. Rev. Lett. 125, 060405 (2020)]. We demonstrate our results through explicit applications to quantum communication, where we recover in particular a number of strong converse bounds for the quantum capacity of channels assisted by various classes of operations, as well as to stabilizer quantum computation, where we study the precise quantitative links between magic state distillation and quantum gate synthesis, and provide improved bounds for both tasks.
The manipulation of quantum "resources" such as entanglement, coherence, and magic states lies at the heart of quantum science and technology, empowering potential advantages over classical methods. In practice, a particularly important kind of manipulation is to "purify" the quantum resources since they are inevitably contaminated by noise and thus often lose their power or become unreliable for direct usage. Here we prove fundamental limitations on how effectively generic noisy resources can be purified enforced by the laws of quantum mechanics, which universally apply to any reasonable kind of quantum resource. More explicitly, we derive nontrivial lower bounds on the error of converting any full-rank noisy state to any target pure resource state by any free protocol (including probabilistic ones)-it is impossible to achieve perfect resource purification, even probabilistically. Our theorems indicate strong limits on the efficiency of distillation, a widely used type of resource purification routine that underpins many key applications of quantum information science. In particular, this general result induces the first explicit lower bounds on the resource cost of magic state distillation, a leading scheme for realizing scalable fault-tolerant quantum computation. Implications for the standard error-correction-based methods are specifically discussed.
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. We develop a general approach to this problem by introducing a new resource monotone that 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 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 strengthen our results to show that the monotone completely governs probabilistic transformations-it serves as a necessary and sufficient condition for state convertibility. This endows the monotone with a direct operational interpretation, as it can exactly quantify the highest fidelity achievable in resource distillation tasks by means of any probabilistic manipulation protocol.
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.
Abstract Probabilistic protocols can enlarge the set of feasible resource transformations by conditioning on successful outcomes, but in many practical setting there are fundamental limitations on the success probability and the error incurred in such transformation. We derive complementary one-shot converse bounds and their regularized asymptotic rate bounds. Successful outcomes are represented by branches of free superinstruments. While projective robustness yields an accuracy constraint independent of the success probability, generalized robustness directly bounds the probability itself. In particular, we establish the explicit relationship between the success probability and the error of the protocol using robustness measure. For a flagged erasure channel, postselection recovers the identity channel exactly. In this case, generalized robustness remains finite although projective robustness is infinite. Restricting the framework to preparation channels recovers state distillation and gives explicit bounds for coherence distillation from noisy coherent states. Together, these examples distinguish channel-level behavior from the state-theoretic case obtained by restricting the framework to preparation channels.